Topic
Split-radix FFT algorithm
About: Split-radix FFT algorithm is a research topic. Over the lifetime, 1845 publications have been published within this topic receiving 41398 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: Critical algorithm design issues are discussed, necessary machine performance measurements are identified and made, and the performance of the developed FFT programs are measured.
Abstract: The Fast Fourier Transform is a mainstay of certain numerical techniques for solving fluid dynamics problems. The Connection Machine CM-2 is the target for an investigation into the design of multidimensional SIMD parallel FFT algorithms for high performance. Critical algorithm design issues are discussed, necessary machine performance measurements are identified and made, and the performance of the developed FFT programs are measured. Our FFT programs are compared to the currently best Cray-2 FFT library program, CFFT2.
15 citations
TL;DR: The proposed scheme is area-efficient since the computational elements (CEs) use the minimum number of multipliers, and the number of CEs increases only linearly with respect to the dimension m, and it can be easily extended to the N/sup m/-point m-dimensional DFT with large m and/or N.
Abstract: This paper presents an efficient pipelined architecture for the N/sup m/-point m-dimensional discrete Fourier transform (DFT). By using a two-level index mapping scheme that is different from the conventional decimation-in-time (DIT) or decimation-infrequency (DIF) algorithms, the conventional pipelined architecture for the one-dimensional (1-D) fast Fourier transform (FFT) can be efficiently used for the computation of higher dimensional DFTs. Compared with systolic architectures, the proposed scheme is area-efficient since the computational elements (CEs) use the minimum number of multipliers, and the number of CEs increases only linearly with respect to the dimension m. It can be easily extended to the N/sup m/-point m-dimensional DFT with large m and/or N, and it is more flexible since the throughput can be easily varied to accommodate various area/throughput requirements.
15 citations
TL;DR: It is shown by numerical experiments that for certain rank-one vectors with full-rank Fourier images, the practical -ranks remain moderate for large mode sizes.
15 citations
TL;DR: Rader's FFT is derived, Rader's zero-padding technique is described, and the performance of the unpadded and the zero-padded approaches is examined.
Abstract: This note provides a self-contained introduction to Rader's fast Fourier transform (FFT). We start by explaining the need for an additional type of FFT. The properties of the multiplicative group o...
15 citations
TL;DR: Results show that the pruning algorithm significantly reduces energy consumption compared to a nonpruned version of the FFT algorithm.
Abstract: An energy-efficient fast Fourier transform (FFT) algorithm for cognitive radio communication systems uses a homogeneous multiprocessor system on chip. The algorithm allows for pruning of inputs such that algorithm complexity can be reduced whenever several of the FFT inputs are zero. Results show that the pruning algorithm significantly reduces energy consumption compared to a nonpruned version.
15 citations