Topic
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.
Papers published on a yearly basis
Papers
More filters
TL;DR: Some applications to geoscience, along with some examples where the FFT subroutine based on the Cooley and Tukey algorithm is undesirable also are given.
40 citations
TL;DR: In this article, the time variant discrete Fourier transform (TVDFT) was proposed as an alternative order tracking method for rotating machinery, which is a combination of the Fast Fourier Transform (FFT) and the resampling based methods.
40 citations
TL;DR: In the letter a fast and efficient algorithm is presented for calculating both the DFT and the WHT through the factorisation of the intermediate transform into a product of sparse matrices.
Abstract: In the letter a fast and efficient algorithm is presented for calculating both the DFT and the WHT. This is achieved through the factorisation of the intermediate transform into a product of sparse matrices. The algorithm can implemented using a single butterfly structure, and is amenable for both software and hardware implementations.
40 citations
TL;DR: A fast algorithm for rapid calculation of the potential fields in three dimensions known as the Fast Fourier Transform on Multipoles (FFTM) is presented and it is demonstrated that FFTM is all accurate method.
40 citations
TL;DR: The interpolating formula for the modulus-based interpolated FFT is presented with up to nine-point for a cosine window with maximum side lobe decaying and its expression is general in the window order and number of interpolating points.
39 citations