scispace - formally typeset
Search or ask a question
Topic

Split-radix FFT algorithm

About: Split-radix FFT algorithm is a research topic. Over the lifetime, 1845 publications have been published within this topic receiving 41398 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: A method for computing the inverse discrete Fourier transform (IDFT) by the in-place, in-order prime factor FFT algorithm (PFA) by modifying the input and the output index mapping equations.
Abstract: We present a method for computing the inverse discrete Fourier transform (IDFT) by the in-place, in-order prime factor FFT algorithm (PFA). This is achieved by modifying the input and the output index mapping equations. This approach does not result in any additional cost in terms of program length and computational time. >

9 citations

Proceedings ArticleDOI
26 Dec 2006
TL;DR: The (non-stationary) Markov process is derived that describes the number of occupied (i.e. non-zero) paths at each stage of a pruned FFT, which is used to compute the FFT of an input vector with a given sparsity distribution.
Abstract: The Fourier transform is instrumental in many signal processing applications such as digital filtering, spectral analysis and communications. In 1965, Cooley and Tukey demonstrated that the discrete Fourier transform (DFT) can be computed using the fast Fourier transform (FFT) algorithm with reduced computational complexity. When the input vector to the FFT contains mostly zeros (i.e., is sparse), it is possible to realize computational savings over a full FFT by only performing the arithmetic operations on non-zero elements. That is, the FFT is "pruned" so that only the useful computations are performed. In this paper, we derive the (non-stationary) Markov process that describes the number of occupied (i.e. non-zero) paths at each stage of a pruned FFT. With the probability distribution of the number of non-zero paths at each FFT stage, we then determine the probability distribution of the number of multiplications and additions necessary to compute the FFT of an input vector with a given sparsity distribution

9 citations

Journal ArticleDOI
01 Apr 2014
TL;DR: A method is incorporated to overcome the result overflow problem introduced by DA method and proposed FFT architecture is implemented in 180 nm CMOS technology at a supply voltage of 1.8 V.
Abstract: In this paper we have designed a Split-radix type FFT unit without using multipliers. All the complex multiplications required for this type of FFT are implemented using Distributed Arithmetic (DA) technique. A method is incorporated to overcome the result overflow problem introduced by DA method. Proposed FFT architecture is implemented in 180 nm CMOS technology at a supply voltage of 1.8 V.

9 citations

Proceedings ArticleDOI
14 Apr 1991
TL;DR: A comparative assessment of the computational complexity of several Gabor transform algorithms is given, with results in the range O(P)/sup 2/ to O (P log/sub 2/ P), where P is the number of data points being transformed.
Abstract: A comparative assessment of the computational complexity of several Gabor transform algorithms is given, with results in the range O(P)/sup 2/ to O(P log/sub 2/ P), where P is the number of data points being transformed. Among the results is a novel algorithm of lower complexity than previously known FFT (fast Fourier transform) based methods. The most efficient of the methods, which uses the Zak transform as an operational calculus, performs the Gabor analysis and synthesis transforms with a complexity comparable to that of the FFT. >

9 citations

01 Jan 2008
TL;DR: In this article, a new method for phase difference measurement that contains the contribution of negative frequency is proposed, which has the virtue of simplicity and practicability and is proved to be applicable especially for signals with a quite low frequency or with a frequency close to the Nyquist frequency.
Abstract: While measuring the phase difference between two sine signals with a low frequency using the FFT method,the precision declines evidently and the method even becomes ineffective,for the contribution of negative frequency is neglected in the model.A new method for phase difference measurement that contains the contribution of negative frequency is proposed.New formulas for phase difference calculation are presented in the case of rectangular window and Hanning window respectively.Simulation results show that the precision of the new method,especially in the case of Hanning window,is so high that it almost approaches the lower limit of double precision arithmetic.Under noise background,the precision of the new method is also higher than that of the FFT method.The new method has the virtue of simplicity and practicability,and is proved to be applicable especially for signals with a quite low frequency or with a frequency close to the Nyquist frequency.

9 citations


Network Information
Related Topics (5)
Signal processing
73.4K papers, 983.5K citations
80% related
Filter (signal processing)
81.4K papers, 1M citations
78% related
Robustness (computer science)
94.7K papers, 1.6M citations
78% related
Iterative method
48.8K papers, 1.2M citations
77% related
Optimization problem
96.4K papers, 2.1M citations
77% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20239
202234
20192
20188
201748
201689