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
01 Jan 1978
TL;DR: An algorithm based on the Winograd method is developed to compute a Fourier-like transform over Galois field GF(2 exp n) for n equal to 5 and 6 and it is shown that this transform algorithm requires fewer multiplications than the more conventional fast transform algorithm described by Gentleman (1968).
Abstract: An algorithm based on the Winograd (1976) method is developed to compute a Fourier-like transform over Galois field GF(2 exp n) for n equal to 5 and 6. It is shown that this transform algorithm requires fewer multiplications than the more conventional fast transform algorithm described by Gentleman (1968). Such a transform can be used to encode and decode Reed-Solomon codes of length (2 exp n) -1.
2 citations
TL;DR: Two parallel algorithms for computing fast Fourier transform (FFT) on a new type of architecture called the n-star-connected, cycles ( n -SCC) have been considered and these algorithms are based on the Cooley-Tukey FFT algorithm and combine the principles of parallelism and pipelining.
2 citations
2 citations
15 Apr 2005
TL;DR: The development of the fast Fourier transform algorithm is reviewed, some representative applications in electromagnetics are illustrated, and some recent developments in extending the FFT algorithms to nonuniformly sampled data and to discontinuous functions are summarized.
Abstract: The fast Fourier transform (FFT) algorithm is one of most fundamental and powerful computational tools in computational science and engineering. In this article, the development of the fast Fourier transform algorithm is reviewed, some representative applications in electromagnetics are illustrated, and some recent developments in extending the FFT algorithms to nonuniformly sampled data and to discontinuous functions are summarized.
Keywords:
fourier transform;
fast Fourier transform (FFT);
discrete Fourier transform (DFT);
nonuniform fast Fourier transform (NUFFT);
discontinuous fast Fourier transform (DFFT)
2 citations