High-Throughput VLSI Architecture for FFT Computation
暂无分享,去创建一个
[1] Chin-Liang Wang,et al. Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse , 2000, IEEE Trans. Signal Process..
[2] P. Duhamel,et al. `Split radix' FFT algorithm , 1984 .
[3] Jerry D. Gibson,et al. The Communications Handbook , 2002 .
[4] Shousheng He,et al. Designing pipeline FFT processor for OFDM (de)modulation , 1998, 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167).
[5] Chein-Wei Jen,et al. High-speed and low-power split-radix FFT , 2003, IEEE Trans. Signal Process..
[6] Chen-Yi Lee,et al. A dynamic scaling FFT processor for DVB-T applications , 2004 .
[7] D. J. Skellern,et al. VLSI for OFDM , 1998 .
[8] Shen-Fu Hsiao,et al. Design of low-cost and high-throughput linear arrays for DFT computations: algorithms, architectures, and implementations , 2000 .