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.

Accurate and fast discrete polar Fourier transform

Abstract: In this article we develop a fast high accuracy polar FFT. For a given two-dimensional signal of size N/spl times/N, the proposed algorithm's complexity is O(N/sup 2/ log N), just like in a Cartesian 2D-FFT. A special feature of our approach is that it involves only 1-D equispaced FFT's and 1D interpolations. A central tool in our approach is the pseudopolar FFT, an FFT where the evaluation frequencies lie in an over-sampled set of nonangularly equispaced points. The pseudopolar FFT plays the role of a halfway point-a nearly-polar system from which conversion to polar coordinates uses processes relying purely on interpolation operations. We describe the conversion process, and compare accuracy results obtained by unequally-sampled FFT methods to ours and show marked advantage to our approach.

Method for efficiently computing a fast fourier transform

Abstract: A method for computing an out of place FFT in which each stage of the FFT has an identical signal flow geometry. In each stage of the presently disclosed FFT method the group loop has been eliminated, the twiddle factor data is stored in bit-reversed manner, and the output data values are stored with a unity stride.

Generic Mixed-Radix FFT Pruning

Abstract: Compared with traditional Fast Fourier Transform (FFT) algorithms, FFT pruning is more computationally efficient in those cases where some of the input values are zero and/or some of the output components are not needed. In this letter, a novel pruning scheme is developed for mixed-radix and high-radix FFT pruning. The proposed approach is applicable over a wide range of FFT lengths and input/output pruning patterns. In addition, it can effectively employ the benefits of high-radix FFT algorithms that have lower computational complexity.

Precise algorithms for harmonic analysis based on fft algorithm

Abstract: The wide use of non-linear components in power system gives rise to not only integer harmonics, but also non-integer harmonics in the power system. The conventional harmonic measurement algorithm Fast Fourier Transform (FFT) is suitable to be used in integer harmonic analysis, but is not fit to analyze non-integer harmonics due to its leakage and picket fence effects, which brings about large errors in practical applications. The engender of the leakage effect is caused bythe different characters between the theoretic implementation of the Fourier Transform which deals with infinite signals and the practical implementation of Fourier Transform which deals with finite signals. These differences give rise to measurement errors of non-integer harmonics of FFT algorithm. In order to reduce the leakage errors and improve the measurement precision, this paper presents amending algorithm based on the analysis of the FFT algorithm. Through simple transforms of FFT algorithm, the amending algorithm can reduce satisfactorily the leakage error, and obtain accurate analysis results. Simulations validate the high precision of this novel algorithm. The amending algorithm have the characteristics of easy implementation and high precision, and will be a practical method for harmonic analysis in power system.

Digital signal processor structure for performing length-scalable fast fourier transformation

Abstract: A digital signal processor structure by performing length-scalable Fast Fourier Transformation (FFT) discloses a single processor element (single PE), and a simple and effective address generator are used to achieve length-scalable, high performance, and low power consumption in split-radix-2/4 FFT or IFFT module In order to meet different communication standards, the digital signal processor structure has run-time configuration to perform for different length requirements Moreover, its execution time can fit the standards of Fast Fourier Transformation (FFT) or Inverse Fast Fourier Transformation (IFFT)