Topic
Prime-factor FFT algorithm
About: Prime-factor FFT algorithm is a research topic. Over the lifetime, 2346 publications have been published within this topic receiving 65147 citations. The topic is also known as: Prime Factor Algorithm.
Papers published on a yearly basis
Papers
More filters
•
TL;DR: An improved algorithm with high accuracy is proposed based on the attenuation characteristics of the Hanning-windowed discrete spectrum of signal, which reduces the spectral leakage further, and then the interpolation is applied to derive the practical correction formulas of the harmonic frequency, amplitude and phase.
Abstract: Due to the wide use of non-linear components, harmonic problem becomes increasingly serious It is difficult to perform accurate harmonic analysis with fast Fourier transform (FFT) under the unsynchronized sampling conditions Windowed interpolation methods can improve the accuracy of FFT for harmonic analysis An improved algorithm with high accuracy is proposed based on the attenuation characteristics of the Hanning-windowed discrete spectrum of signal Via a specific polynomial transform of the spectral sequence, the algorithm reduces the spectral leakage further, and then the interpolation is applied to derive the practical correction formulas of the harmonic frequency, amplitude and phase Comparison with Hanning and Blackman-Harris interpolation FFT methods is carried out by Matlab simulations, which verifies the higher analysis accuracy of the proposed algorithm An experiment on capacitor harmonic current demonstrates its validity further
6 citations
••
25 Mar 2011
TL;DR: In this paper, a high accuracy method based on the all-phase and interpolated FFT is presented for harmonic analysis in power system, where the input signal is preprocessed to mitigate spectral leakage through all phase and the interpolation algorithm is adopted to eliminate the picket-fence effects.
Abstract: Nowadays, the Fast Fourier transform (FFT) has been widely adopted for harmonic analysis in power system. However, a direct application of FFT-based algorithms may bring about inaccurate results because of spectral leakage and picket-fence effects. In this paper, a high accuracy method based on the all-phase and interpolated FFT is presented for harmonic analysis. Firstly, the input signal is preprocessed to mitigate spectral leakage through all-phase. Secondly, the interpolation algorithm is adopted to eliminate the picket-fence effects. As a result, the analysis accuracy of the harmonic parameters has been greatly improved and the phase estimation is not biased. The formulas of amplitude, frequency and phase are also obtained based on all-phase and interpolated FFT. The simulation results reflect that this method can better meet the requirements of harmonic detection in power system.
6 citations
••
26 May 2013TL;DR: The proposed lifting based FFT (L-FFT) based on fast Hartley transform (FHT) has a simpler structure than existing ones because fewer lifting steps need to be approximated and requires fewer memories for the internal implementation than the conventional FFTs.
Abstract: The multiplierless fast Fourier transform (FFT) with dyadic-valued (rational) coefficients is important for many signal processing tools. The proposed lifting based FFT (L-FFT) based on fast Hartley transform (FHT) has a simpler structure than existing ones because fewer lifting steps need to be approximated. In addition, it has a structure of real-valued calculation followed by complex-valued parts, thereby it requires fewer memories for the internal implementation than the conventional FFTs.
6 citations
••
01 Dec 2014TL;DR: The proposed architecture consists of cascaded multiplier-less cells, and each cell stage performs partial twiddle factor multiplications with low-complexity adders and multiplexers, and is suitable for either pipelined or memory based FFT architectures.
Abstract: This paper presents new rotator architecture for FFT computation. The proposed architecture consists of cascaded multiplier-less cells, and each cell stage performs partial twiddle factor multiplications with low-complexity adders and multiplexers. Besides, for further area reduction, each cell is optimized with the technique of common subexpression sharing. Since those twiddle factors involved in computation are realized with multipliers generated on-the-fly by a scheme of coefficient selection, the proposed architecture doesn't require memory space to store any twiddle factors. Variable FFT lengths ranging from 64 ∼ 32768 points can be supported by flexibly adding or removing some cell stages, depends on FFT length. Compared to CORDIC-based architectures, the proposed architecture has lower latency. The implementation results show that the proposed architecture is area-efficient and is suitable for either pipelined or memory based FFT architectures.
6 citations
••
TL;DR: Two approaches for a concurrent implementation of the prime factor algorithm on distributed-memory multi-processor structures are presented and the crystal_router algorithm was exploited as a concurrent technique for communicating data among nodes.
Abstract: On sequential computers, the prime factor algorithm (PFA) allows the Computation of the discrete Fourier transform (DFT) with a higher efficiency than the traditional Cooley-Tukey FFT algorithm (CTA). However, the PFA requires substantial data movement, which poses a challenging problem for distributed-memory multi-processor systems. In this paper, two approaches for a concurrent implementation of the PFA on these structures are presented. In the first approach, the concurrent PFA runs on all nodes of the multi-processor system, which is inefficient on large configurations due to the large communication overhead. A second approach developed to reduce this bottleneck is also presented. These solutions have been benchmarked on Caltech hypercubes, and the performances achieved are reported. In both approaches, the crystal_router algorithm was exploited as a concurrent technique for communicating data among nodes.
6 citations