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
Proceedings ArticleDOI
07 Apr 2015
TL;DR: This paper introduces a new class of multiplierless hardware algorithm consisting only of arithmetic adder circuits that closely approximates the 2-D version of the 8-point DFT.
Abstract: The two-dimensional (2-D) discrete Fourier transform (DFT) is widely used in digital signal processing (DSP) and computing applications. Fast Fourier transforms (FFTs) are widely used as low-complexity algorithms for the computation of the DFT as it reduces the required computation operations from O(N2) to O(N log 2 N). The multiplicative complexity is used as a benchmark in comparing different algorithms as it affects the circuit complexity, chip area and power. This paper introduces a new class of multiplierless hardware algorithm consisting only of arithmetic adder circuits that closely approximates the 2-D version of the 8-point DFT. The paper discusses the theory behind the proposed new algorithm, with the DFT presented in the form of an 8 × 8 matrix. Furthermore it provide a multi-beam RF aperture application example where the 2-D DFT approximation has been used to closely obtain the antenna array patterns.

3 citations

Journal ArticleDOI
TL;DR: An overview of the work done by a different FFT processor previously is given and the comparison of different architecture is also discussed.
Abstract: A time-domain sequence is converted into an equivalent frequency-domain sequence using discrete Fourier transform. The reverse operation converts a frequency-domain sequence into an equivalent time- domain sequence using inverse discrete Fourier transform. Based on the discrete Fourier transform. Fast Fourier transform (FFT) is an effective algorithm with few computations. FFT is used in everything from broadband to 3G and Digital TV to radio LAN"s. To improve its architecture different efficient algorithms are developed. This paper gives an overview of the work done by a different FFT processor previously. The comparison of different architecture is also discussed.

3 citations

Journal Article
TL;DR: Based on the analysis of the classical Zoom-FFT, a Zoom-FFT algorithm based on Fourier transform spectroscopy was presented in this paper, which showed that the spectrum could be inverted by both FFT and ZF when the sampling step was less than 20 μm and less than 333 μm, respectively.
Abstract: Based on the analysis of the classical Zoom-FFT,a Zoom-FFT algorithm based on Fourier transform spectroscopy was presentedBoth FFT and Zoom-FFT were used to process the interferogram with different sampling steps by Matlab simulation software,through the comparison of the inverted and original spectrum curves,it indicated that the spectrum could be inverted by both FFT and Zoom-FFT when the sampling step was less than 20 μm;But when the sampling step was greater than 20 μm and less than 333 μm,the spectrum could not be inverted by FFT algorithm,while the spectrum could be inverted by Zoom-FFT

3 citations

Proceedings ArticleDOI
Xiao Yong1, Wei Zhao1, Lei Chen1, Songling Huang1, Qing Wang2 
24 Oct 2016
TL;DR: This paper puts forward a Fast Quasi-Synchronous Harmonic Algorithm using weight window function combined with Mixed Radix Fast Fourier Transform Algorithm that will reduce the calculation by more than 94%.
Abstract: According to the requirements of IEC61850-9-2LE, digital energy metering devices mainly adopt 80×fr fixed sampling rate. When the harmonic analysis is carried out under asynchronous sampling, it will produce large errors due to spectral leakage. Quasi-Synchronous Algorithm has high accuracy, but the calculation process is complicated and the hardware overheads are high. Based on the characteristics of digital energy metering devices, this paper puts forward a Fast Quasi-Synchronous Harmonic Algorithm using weight window function combined with Mixed Radix Fast Fourier Transform Algorithm. It will reduce the calculation by more than 94%. Compared with the Triangle/Hanning/Nuttall4(III)-Windowed Interpolated FFT Algorithm, the proposed algorithm will perform better in accuracy and has the feature that the more asynchronous of the sampling, the more obvious the error will be.

3 citations

Proceedings ArticleDOI
01 Jan 1985
TL;DR: A bit-level systolic array system is proposed for the Winograd Fourier Transform Algorithm and it is demonstrated how long transforms can be implemented with components designed to perform short length transforms.
Abstract: A bit-level systolic array system is proposed for the Winograd Fourier Transform Algorithm. The design uses bit-serial arithmetic and, in common with other systolic arrays, features nearest neighbour interconnections, regularity and high throughput. The short interconnections in this method contrast favourably with the long interconnections between butterflies required in the FFT. The structure is well suited to VLSI implementations. It is demonstrated how long transforms can be implemented with components designed to perform short length transforms. These components build into longer transforms preserving the regularity and structure of the short length transform design.

3 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