.png){kind=icon}
.png){kind=icon}
Return
A Generalized Mixed-Radix Algorithm for Memory-Based FFT Processors
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2009.2037262.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Continuous data flow
fast Fourier transform (FFT)
generalized mixed radix (GMR)
in-place
vector reverse
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W