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
29 Aug 2008
TL;DR: A scheme of ultra-long variable-size pipelined FFT processor is presented and a prototype is implemented with one FPGA, which may compute various 4n (n = 1 ~ 10) points FFT at a speed as high as 150 MHz.
Abstract: A scheme of ultra-long variable-size pipelined FFT processor is presented and a prototype is implemented with one FPGA, which may compute various 4n (n = 1 ~ 10) points FFT at a speed as high as 150 MHz. The solutions are to transform the one-dimension FFT to two-dimension repeatedly, and propose an efficient twiddle-factor memory compression method. Based on two techniques storage resource of FFT processor can be reduced largely.
10 citations
TL;DR: Two multiplicative FFT algorithms have operational counts close to the Winograd algorithm, but they have a better structure, which simplifies their implementation and are suited for conventional serial machines.
10 citations
25 Jun 2012
TL;DR: The proposed implementation of a parallel one-dimensional fast Fourier transform (FFT) on the K computer is based on the six-step FFT algorithm, which can be altered into the recursive six- step F FT algorithm to reduce the number of cache misses.
Abstract: In this paper, we propose an implementation of a parallel one-dimensional fast Fourier transform (FFT) on the K computer. The proposed algorithm is based on the six-step FFT algorithm, which can be altered into the recursive six-step FFT algorithm to reduce the number of cache misses. The recursive six-step FFT algorithm improves performance by utilizing the cache memory effectively. We use the recursive six-step FFT algorithm to implement the parallel one-dimensional FFT algorithm. The performance results of one-dimensional FFTs on the K computer are reported. We successfully achieved a performance of over 18 TFlops on 8192 nodes of the K computer (82944 nodes, 128 GFlops/node, 10.6 PFlops peak performance) for a 2^41-point FFT.
10 citations
IBM1
TL;DR: A variant of the Cooley-Tukey algorithm due to Stockham is derived and vectorized and is shown to be on a par with the Pease algorithm.
Abstract: A variant of the Cooley-Tukey algorithm due to Stockham is derived and vectorized and is shown to be on a par with the Pease algorithm. The Stockham algorithm is then proposed for the entire computation of the two-dimensional fast Fourier transform on a vector computer.
10 citations
TL;DR: This letter describes fixed-point implementations of the Winograd and prime factor FFT algorithms in which multiplications are replaced by additions, subtractions and shifts, which could achieve very high speed and/or power efficiency.
Abstract: This letter describes fixed-point implementations of the Winograd and prime factor FFT algorithms in which multiplications are replaced by additions, subtractions and shifts. Methods are described for minimizing the number of additions and subtractions, while achieving a required level of accuracy. VLSI implementation of the resulting FFTs could achieve very high speed and/or power efficiency. The method can be used to provide any chosen accuracy; examples are presented for 12 to 20 bit accuracy.
10 citations