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.

A comparison of WFTA and FFT programs

Abstract: Bounds on the minimum number of data transfers (i.e., loads and stores) required by WFTA (Winograd Fourier Transform Algorithm) and FFT programs are presented. The analysis is applicable to those general-purpose computers with a small number of general processor registers (e.g., the IBM370, PDP-11, etc.). It is shown that the 1008-point WFTA requires about 21% more data transfers than the 1024-point radix-4 FFT; on the other hand, the 120-point WFTA has about 22% fewer data transfers than the 128-point radix-2 FFT. Finally, comparisons of the 'total' program execution times (multiplications, additions, and data transfers, but not indexing or permutations) are presented.

Blackman-Harris Window Based Interpolation FFT Harmonic Analysis and Its Application

Abstract: There is a great error in situation of non-synchronous sampling and non-interger cycle truncation for the fast Fourier transform( FFT) so as hard to obtain the exact harmonic parameters Widely used in the electric power system,the windowed interpolation FFT algorithms could compensate the spectral leakage in frequency domain caused by non-coherent sampling and non-integral period truncation in order to improve the analysis accuracy The spectral characteristics of Blackman-Harris window are analyzed and an approach for harmonic analysis based on Blackman-Harris window interpolation FFT has been proposed The applicable rectification formulas of the interpolation are obtained by fitting of a polynomial Simulation results indicate that the approach based on Blackman-Harris window interpolation FFT can be designed and realized easily which will restrain the spectral leakage effectively

Higher-order spectra computation using wavelet transform

Abstract: It has been a desire of a design engineer to combine various tools of analysis and apply them on one problem at hand. In this paper, we propose an algorithm that combines two signal processing analysis tools: higher-order spectral analysis and wavelets. The computation of polyspectra using conventional approaches involves the use of FFT algorithm. It has been shown that discrete Fourier transform (DFT) can be implemented by a fast algorithm using wavelets. By using this algorithm, polyspectra computational complexity for a certain class of signals reduces to lesser number of computations. In actual implementation, the wavelets in use have to be carefully chosen to balance the benefit of pruning of insignificant data and the price of the transform. Clearly, the optimal choice depends on the class of the data we would encounter. In this paper, we first present an introduction f higher-order spectral analysis. Then we discuss wavelet-based fast implementation of DFT and its importance from higher-order spectral analysis viewpoint. Finally, we develop wavelet-based algorithm for computational of polyspectra followed by conclusions.© (2000) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

Design of 256-point FFT processor for 100 Gb/s coherent optical OFDM system

Abstract: This paper presents fully parallel fast Fourier transform (FFT) processor for coherent optical OFDM system. It has a length of 256. For processing of 100 Gb/s throughput it has parallel input and output structure. FFT processor has 32 radix-16 processor with trivial multiplication and consists of an array structure in parallel arithmetic processing. We designed and implemented the proposed FFT processor using Xilinx FPGA XCVU190. The result shows 205,530 LUTs and the maximum throughput is 46.592 Giga-Samples/sec.