scispace - formally typeset
Search or ask a question
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
More filters
01 Jan 2001
TL;DR: The leakage of FFT is discussed briefly and the interpolation algorithm on Blackman Harris window is analyzed in detail, showing that the improved algorithm holds a very high precision when used for the unsynchronized sample sequence.
Abstract: The FFT has a higher error when used with a sample sequence which is not synchronized with the signal,which makes that the electric harmonic parameters can not be gotten accurately.To reduce the influence of an unsynchronized sample sequence on FFT and to improve the precision of harmonics in electric machine testing, This paper improves the algorithm by using windows and interpolation methods.This paper first discusses the leakage of FFT briefly and then analyzes the interpolation algorithm on Blackman Harris window in detail. With the new algorithm,we can get the accurate frequency offset and other accurate harmonic parameters by solving high order interpolation equation with the help of MATLAB language.After this,we make a little change to the interpolation formula,which can make the calculating accuracy be further improved on every condition especially for the severe leakage.An example of simulation is given and validates that the improved algorithm holds a very high precision when used for the unsynchronized sample sequence.

21 citations

01 Jan 2004
TL;DR: It is shown that Winograds algorithm for computing convolutions and a fast, prime factor, discrete Fourier transform (DFT) algorithm can be modified to compute Fourier-like transforms of long sequences of 2 m.
Abstract: In this paper it is shown that Winograds algorithm for computing convolutions and a fast, prime factor, discrete Fourier transform (DFT) algorithm can be modified to compute Fourier-like transforms of long sequences of 2 m

21 citations

Proceedings ArticleDOI
24 Oct 2013
TL;DR: A parameterized FFT architecture is proposed to identify the design trade-offs in achieving energy efficiency, and designs achieve up to 28% and 38% improvement in the energy efficiency and EAT, respectively, compared with a state-of-the-art design.
Abstract: In this paper, we revisit the classic Fast Fourier Transform (FFT) for energy efficient designs on FPGAs. A parameterized FFT architecture is proposed to identify the design trade-offs in achieving energy efficiency. We first perform design space exploration by varying the algorithm mapping parameters, such as the degree of vertical and horizontal parallelism, that characterize decomposition based FFT algorithms. Then we explore an energy efficient design by empirical selection on the values of the chosen architecture parameters, including the type of memory elements, the type of interconnection network and the number of pipeline stages. The trade offs between energy, area, and time are analyzed using two performance metrics: the energy efficiency (defined as the number of operations per Joule) and the Energy×Area×Time (EAT) composite metric. From the experimental results, a design space is generated to demonstrate the effect of these parameters on the various performance metrics. For N-point FFT (16 ≤ N ≤ 1024), our designs achieve up to 28% and 38% improvement in the energy efficiency and EAT, respectively, compared with a state-of-the-art design.

21 citations

Proceedings ArticleDOI
05 Dec 2005
TL;DR: A new general method to deduce FFT algorithms is introduced, and the deduced second radix-2 decimation-in-time FFT algorithm is transformed into another parallelizable sequential form, reducing the time complexity of DFT to O(nlogn/p) (where p is the number of processors).
Abstract: Discrete Fourier transform (DFT) has many applications in digital signal and image processing and other scientific and technological domains, but its time complexity of direct computation is O(n2), limiting greatly its application range. Thus many people have developed fast Fourier transform (FFT) algorithms, reducing the complexity from O(n2) to O(nlogn)(In this paper logn denotes log2n).But for large n, O(nlogn) is still very high. So multiprocessor systems have been used to speed up the computation of DFT. This paper first introduces a new general method to deduce FFT algorithms, then transforms the deduced second radix-2 decimation-in-time FFT algorithm into another parallelizable sequential form, and finally transforms the latter algorithm into a new parallel FFT algorithm, reducing the time complexity of DFT to O(nlogn/p) (where p is the number of processors). Using similar methods, the authors can also design other new parallel 1-D and 2-D FFT algorithms.

21 citations

Patent
22 Aug 2003
TL;DR: In this article, a Fourier transform apparatus whose pipeline width is independent of transform point number of individual pipeline FFT circuits in each stage is presented, composed of a preceding stage and a succeeding stage.
Abstract: A Fourier transform apparatus whose pipeline width is independent of transform point number of individual pipeline FFT circuits in each stage and composed of a preceding stage and a succeeding stage. Each of the stages includes M(power of 2)-point radix 2 pipeline FFT circuits each having two-parallel inputs/outputs in a number of a (divisor of M) which are equal in respect to the transform point number and data permutating means for data supply to the transform means of each stage so that the pipeline width of the Fourier transform apparatus is made independent of the transform point numbers of the individual pipeline FFT circuits in each stage.

21 citations


Network Information
Related Topics (5)
Wavelet
78K papers, 1.3M citations
81% related
Robustness (computer science)
94.7K papers, 1.6M citations
78% related
Feature extraction
111.8K papers, 2.1M citations
77% related
Support vector machine
73.6K papers, 1.7M citations
76% related
Optimization problem
96.4K papers, 2.1M citations
76% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20235
202224
20211
20188
201757
201692