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.

Selection criteria for efficient implementation of FFT algorithms

Abstract: The number of real operations and memory is presented for three efficient Fortran algorithms which compute the mixed radix discrete Fourier transform (DFT). It is shown that Singleton's mixed radix algorithm (MFFT) is the most flexible and uses the least memory, while the Winograd Fourier transform algorithm (WFTA) and Kolba-Parks prime factor algorithm (PFA) are the most efficient.

Benchmarking of FFT algorithms

Abstract: A large number of fast Fourier transform (FFT) algorithms have been developed over the years. Among these, the most promising are the radix-2, radix-4, split-radix, fast Hartley transform (FHT), quick Fourier transform (QFT), and the decimation-in-time-frequency (DITF) algorithms. We present a rigorous analysis of these algorithms that includes the number of mathematical operations, computational time, memory requirements, and object code size. The results of this work will serve as a framework for creating an object-oriented, poly-functional FFT implementation which will automatically choose the most efficient algorithm given user-specified constraints.

Transfer function computation for generalized n-dimensional systems

Abstract: A new algorithm is presented for the determination of the coefficients of an n -dimensional ( n -D) transfer function. The n -D state-space system is described by the n -D Fornasini–Marchesini models. The proposed algorithm is theoretically attractive and computationally fast and it is based on the discrete Fourier transform (DFT). A step-by-step example is given to illustrate the application of the proposed algorithm.

The extended function fast Fourier transform (EF-FFT)

Abstract: The periodicity assumption implicit in fast Fourier transform (FFT) techniques can be utilized through time-domain prealiasing to obtain the spectral components of infinite-duration time-domain reflectometry signals when they can be modeled, outside the observation window, with step and/or exponential functions. The technique is shown to be more accurate than both conventional windowing and the other FFT approaches described in the literature for analysis of steplike signals. The duality equation relating the extension functions introduced in the extended function FFT (EF-FFT) method to conventional window functions is derived. Using this relation, it is shown that signals with high-frequency content only within the observation window are best analyzed with EF-FFT methods and that signals with time-distributed spectral components (e.g., speech) are best analyzed with conventional FFT methods. >

Evaluation of deflections of the vertical on the sphere and the plane : a comparison of FFT techniques

Abstract: This paper presents a set of efficient formulas to evaluate the deflections of the vertical on the sphere using gridded data. The Vening-Meinesz formula, the topographic indirect effect on the deflections of the vertical as well as the terrain corrections are expressed as both 2D and 1D convolutions on the sphere, and consequently can be evaluated by the 2D and the 1D fast Fourier transform (FFT). When compared with the results obtained from pointwise integration, the use of the 1D FFT gives identical results, and therefore these results were used as control values in this paper. The use of the spherical 2D FFT improves significantly the computational efficiency with little sacrifice of accuracy (0.6″ rms difference from the 1D FFT results). The planar 2D FFT, which is as efficient as the spherical 2D FFT, gives worse results (1.2″ rms difference from the 1D FFT results) because of the extra approximations.