A Fast Address Generation Scheme for FFT Processor

LU Tao; HE Pei-kun; CHEN He; HAN Yue-qiu

LU Tao, HE Pei-kun, CHEN He, HAN Yue-qiu. A Fast Address Generation Scheme for FFT ProcessorJ. Transactions of Beijing institute of Technology, 2006, (1): 68-71.

Citation:

LU Tao, HE Pei-kun, CHEN He, HAN Yue-qiu. A Fast Address Generation Scheme for FFT ProcessorJ. Transactions of Beijing institute of Technology, 2006, (1): 68-71.

Citation:

LU Tao, HE Pei-kun, CHEN He, HAN Yue-qiu. A Fast Address Generation Scheme for FFT ProcessorJ. Transactions of Beijing institute of Technology, 2006, (1): 68-71.

A Fast Address Generation Scheme for FFT Processor

Graphical Abstract

Abstract

Abstract

A fast address generation scheme of radix r(r=2,4,8,…) Cooley-Tukey fast Fourier transform(FFT) algorithm for fixed point and variable point is proposed.The new scheme is based on the r number system and it's calculating rule.The advantage of this address generation scheme lies in that it generates fast the operation and twiddle factors address and further reduces the twiddle factors access times and compresses the twiddle factors' storage volume in variable point FFT processor.

FullText(HTML)

References (7)

Cited By

Turn off MathJax

Article Contents

A Fast Address Generation Scheme for FFT Processor

Abstract

Catalog

Export File

Citation

Format

Content