A Generalized Mixed-Radix Algorithm for Memory-Based FFT Processors

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 2 n -point FFTs simultaneously. It transforms the index to a multidimensional vector for efficient computation. By controlling the inde...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems. II, Express briefs Express briefs, 2010-01, Vol.57 (1), p.26-30
Main Authors: Hsiao, Chen-Fong, Chen, Yuan, Lee, Chen-Yi
Format: Article
Language:English
Subjects:
Algorithms
Circuits
Computational efficiency
Computer architecture
Continuous data flow
Costs
Design optimization
Digital video broadcasting
Discrete Fourier transforms
fast Fourier transform (FFT)
Fast Fourier transforms
Flexible printed circuits
Fourier transforms
generalized mixed radix (GMR)
in-place
Mathematical analysis
Process design
Processors
Random access memory
Throughput
Transforms
vector reverse
Vectors (mathematics)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 2 n -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.
ISSN:1549-7747
1558-3791
DOI:10.1109/TCSII.2009.2037262