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

被引：60

作者：

Hsiao, Chen-Fong ^{[1
]}

Chen, Yuan ^{[1
]}

Lee, Chen-Yi ^{[1
]}

机构：

[1] Natl Chiao Tung Univ, Dept Elect Engn, Hsinchu 30010, Taiwan

来源：

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS | 2010年 / 57卷 / 01期

关键词：

Continuous data flow; fast Fourier transform (FFT); generalized mixed radix (GMR); in-place; vector reverse;

D O I：

10.1109/TCSII.2009.2037262

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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.

引用

页码：26 / 30

页数：5

共 13 条

[1]

[Anonymous], 36201 3GPP TS

[2] INDEX MAPPINGS FOR MULTIDIMENSIONAL FORMULATION OF DFT AND CONVOLUTION [J].

BURRUS, CS .

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1977, 25 (03) :239-242

[3]

DESPAIN AM, 1979, IEEE T COMPUT, V28, P333, DOI 10.1109/TC.1979.1675363

[4]

*DREY ENT INC, 1998, JAG 2 VAR POINT 8 10

[5] Area-efficient architecture for Fast Fourier Transform [J].

Hidalgo, JA ;

López, J ;

Argüello, F ;

Zapata, EL .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING, 1999, 46 (02) :187-193

[6] New continuous-flow mixed-radix (CFMR) FFT processor using novel in-place strategy [J].

Jo, BG ;

Sunwoo, MH .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2005, 52 (05) :911-919

[7] CONFLICT FREE MEMORY ADDRESSING FOR DEDICATED FFT HARDWARE [J].

JOHNSON, LG .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING, 1992, 39 (05) :312-316

[8] PRIME FACTOR FFT ALGORITHM USING HIGH-SPEED CONVOLUTION [J].

KOLBA, DP ;

PARKS, TW .

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1977, 25 (04) :281-294

[9] An effective memory addressing scheme for FFT processors [J].

Ma, YT .

IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1999, 47 (03) :907-911

[10]

Radhouane J, 2000, ISCAS 2000: IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS - PROCEEDINGS, VOL I, P116, DOI 10.1109/ISCAS.2000.857040

← 1 2 →