摘要
Fast Fourier transform is adopted in many applications. Through the study of the character of the radix-2 and radix-4 decimation-in-time Cooley-Turkey FFT algorithm, a kind of high performance FFT/IFFT processor is proposed. With the modified radix-4 butterfly unit it can process stride-by-2 permutation. The processor allows conflict-free access of the four operands distributed over parallel memory modules. Simulation result shows that the processor can be used in many situations demanding high speed and area.
源语言 | 英语 |
---|---|
页(从-至) | 338-341 |
页数 | 4 |
期刊 | Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology |
卷 | 26 |
期 | 4 |
出版状态 | 已出版 - 4月 2006 |