A Generalized Mixed-Radix Algorithm for Memory-Based FFT Processors
Chen-Fong Hsiao, Yuan Chen, Chen‐Yi Lee · IEEE Transactions on Circuits & Systems II Express Briefs · 2010
In this brief, a generalized mixed-radix (GMR) algorithm is proposed for memory-based fast Fourier transform (FFT) processors to support prime-sized and traditional 2n-point FFTs simultaneously. It transforms the index to a multidimensional vector for efficient computation. By controlling the index vector to satisfy the ¿vector reverse¿ behavior, the GMR algorithm can support not only in-place policy for both computation and I/O data for continuous data flow to minimize the memory size but also multibank memory structures to increase the maximum throughput without memory conflict. Finally, a low-complexity implementation of an index vector generator is also proposed for our algorithm.
Cited by 78 works. doi:10.1109/tcsii.2009.2037262
Authors
References
- A prime factor FFT algorithm using high-speed convolution
- Very Fast Fourier Transform Algorithms Hardware for Implementation
- Index mappings for multidimensional formulation of the DFT and convolution
- Conflict free memory addressing for dedicated FFT hardware
- An effective memory addressing scheme for FFT processors
- New continuous-flow mixed-radix (CFMR) FFT Processor using novel in-place strategy
- Area-efficient architecture for Fast Fourier transform
- Design of a 3780-point IFFT processor for TDS-OFDM
- Minimizing the memory requirement for continuous flow FFT implementation: continuous flow mixed mode FFT (CFMM-FFT)
- Conflict-Free Parallel Memory Accessing Techniques for FFT Architectures