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.

Study of efficient algorithm for harmonic analysis

Abstract: In order to satisfy the real-time requirement of measurements of the power's quality and to reduce the amount of calculation to the best of the ability, the research of fast Fourier transform(EFT) based on complex sequence is carried out. Compared with the primary FFT, this algorithm only needs half of the amount of calculation when analyzing the same sequence length data of the voltage or the current. Therefore, this algorithm will apply well in the on-line monitoring system.

New radix-3 fast algorithm for the discrete cosine transform

Abstract: In this paper a new radix-3 fast algorithm for the length -3/sup m/ discrete cosine transform (DCT) is proposed, to further extend the applicability of the fast cosine transform (FCT) algorithm. First, the basic 3-point DCT is considered. Then, the formulae of the new radix-3 FCT algorithm are derived. Next, a block diagram of the radix-3 FCT algorithm is shown and the signal flowgraph for length-3/sup 2/ FCT is given to illustrate the proposed algorithm. Finally, the computational complexity is analysed. The proposed algorithm requires less number of arithmetic operations and allows in-place computation. The simple and regular structure makes it easy to be implemented. One can compute effectively the length-2/sup 1/.3/sup m/ DCT using this length-3/sup m/ algorithm together with the existing length-2/sup 1/ algorithm by prime factor decomposition. The proposed new radix-3 FCT algorithm is expected to find wide practical applications. >

Design of Combined Radix-2, Radix- 4 and Radix-8 based Single Path Delay Feedback (SDF) FFT

Abstract: Objectives: FFT algorithm is used for enhancing the performance of DFT.In the previous years, various types of FFT algorithms have been introduced. Particularly, the pipeline algorithms have been reputed as proper algorithms for processing high-speed data. Some pipeline FFT algorithms like split radix, radix-2 and the mixed radix have been developed. Methods: In the existing method of Radix-2 SDF FFT has more hardware utilization and also computational stages are increased. Findings: To conquer this problem, we developed a combined radix-2, 4 & 8 butterfly elements based Single path Delay Feedback (SDF) fast fourier transform method for reducing the computational stages in this paper. The developed method has the identical number of multipliers and the smaller number of stages and butterfly elements than the existing radix-2 FFT. Improvements: This architecture offers 62.47% reduction in LUTs, 58.78% reduction in slices, and 37.85% reduction in delay and 30.86% reduction in power consumption than the existing method.

System design for a million channel digital spectrum analyzer /MCSA/

Abstract: The system design of a wideband (8 MHz) million-channel digital spectrum analyzer for use with a SETI receiver is presented. The analyzer makes use of a digital bandpass filter bank for transforming the wideband input signal into a specified number (120) of uniform narrowband output channels by the use of a Fourier transform digital processor combined with a prototype digital weighting network (finite impulse response filter). The output is then processed separately by 120 microprocessor-based discrete Fourier transform computers, each producing 8190 output channels of approximately 8 Hz bandwidth by the use of an 8190-point prime factor algorithm.

Comments on and extensions to "Evaluation of Fourier integrals using a FFT with improved accuracy and its applications"

Abstract: The evaluation of Fourier integrals using fast Fourier transform (FFT) employing the Narasimhan scheme is examined. It is observed to be a special case of spline interpolation. His method is effective when the sampling rate is sufficiently high and piecewise linear approximation between sampling points is adequate. If knowledge about the signal smoothness is available, further improvement in accuracy can be achieved by judicious choice of high degree spine interpolant.