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 scheme is based on the r number system and its 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 factor storage volume in variable point FFT processor.
| Original language | English |
|---|---|
| Pages (from-to) | 68-71 |
| Number of pages | 4 |
| Journal | Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology |
| Volume | 26 |
| Issue number | 1 |
| Publication status | Published - Jan 2006 |
Keywords
- Butterfly calculation
- Fast Fourier transform
- Twiddle factor
- Variable size fast Fourier transform
Fingerprint
Dive into the research topics of 'Fast address generation scheme for FFT processor'. Together they form a unique fingerprint.Cite this
Lu, T., He, P. K., Chen, H., & Han, Y. Q. (2006). Fast address generation scheme for FFT processor. Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology, 26(1), 68-71.