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: This paper investigates the accuracy of the sine-wave parameter estimators provided by the Weighted Three-Parameter Sine-Fit algorithm when a generic cosine window is adopted and shows that the W3PSF algorithm can be well approximated by the classical weighted Discrete Time Fourier Transform (DTFT) when the number of analyzed waveform cycles is high enough.
18 citations
TL;DR: A new fast algorithm for computing the two-dimensional discrete Hartley transform that requires the lowest number of multiplications compared with other related algorithms is presented.
Abstract: A new fast algorithm for computing the two-dimensional discrete Hartley transform is presented. This algorithm requires the lowest number of multiplications compared with other related algorithms.
18 citations
07 Nov 2005
TL;DR: In this article, a three-step phase-shifting algorithm was proposed, which is 3.4 times faster than the traditional 3-step algorithm, using a simple intensity ratio function to replace the arctangent function in the traditional algorithm.
Abstract: We propose a new three-step phase-shifting algorithm, which is much faster than the traditional three-step algorithm. We achieve the speed advantage by using a simple intensity ratio function to replace the arctangent function in the traditional algorithm. The phase error caused by this new algorithm is compensated for by use of a look-up-table (LUT). Our experimental results show that both the new algorithm and the traditional algorithm generate similar results, but the new algorithm is 3.4 times faster. By implementing this new algorithm in a high-resolution, real-time 3D shape measurement system, we were able to achieve a measurement speed of 40 frames per second (fps) at a resolution of 532 × 500 pixels, all with an ordinary personal computer.
18 citations
01 Jan 1988
TL;DR: In this article, the multiplicative complexity of the discrete Fourier transform (DFT) was analyzed and the complexity of DFT for any positive integer was shown. But the complexity was not shown for any integer.
Abstract: In this chapter the multiplicative complexity of the discrete Fourier transform (DFT) is analyzed. The next several sections define the DFT and then show how the complexity of the DFT is determined when the number of inputs is prime, a power of an odd prime, a power of two, and finally for any positive integer.
18 citations
TL;DR: The author states that generally, the vector split-radix method provides a significant reduction in the number of complex multiplications required to implement a two-dimensional discrete Fourier transform.
Abstract: The complete equations are presented for the first stage of the two-dimensional vector split-radix decimation-in-frequency fast Fourier transform algorithm using a structural approach. The computational complexity of the algorithm is discussed and compared to other published results. The author states that generally, the vector split-radix method provides a significant reduction in the number of complex multiplications required to implement a two-dimensional discrete Fourier transform. >
18 citations