High-Throughput VLSI Architecture for FFT Computation

IEEE Transactions on Circuits and Systems II: Express Briefs

Volumn 54, Issue 10, 2007, Pages 863-867

  Cheng, Chao ^a   Parhi, Keshab K ^a  

^a University of Minnesota   (United States)

Author keywords

Fast Fourier transform; tensor product; very large scale integration

Indexed keywords

ELECTRIC COMMUTATORS; FAST FOURIER TRANSFORMS; MULTIPATH PROPAGATION; TENSORS;

MULTI-PATH DELAY COMMUTATOR; THROUGHPUT RATE;

VLSI CIRCUITS;

EID: 36248940255     PISSN: 15497747     EISSN: 15583791     Source Type: Journal    
DOI: 10.1109/TCSII.2007.901635     Document Type: Article

References (8)

1. J. M. Cioffi, The communications Handbook. Boca Raton, FL: CR, 1997.
2. N. Weste and D. J. Skellern, “VLSI for OFDM,” IEEE Commun. Mag., vol. 36, pp. 127–131, Oct. 1998.
3. C.-H. Chang, C.-L. Wang, and Y.-T. Chang, “Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse,” IEEE Trans. Signal Process., vol. 48, pp. 3206–3216, Nov. 2000.
4. S.-F. Hsiao and W.-R. Shiue, “Design of low-cost and high-throughput linear arrays for DFT computations: Algorithms, architectures, and implementations,” IEEE Trans. Circuits Syst. II, Anal. Digit. Signal Process., vol. 47, no. 11, pp. 1188–1203, Nov. 2000.
5. W.-C. Yeh and C.-W. Jen, “High-speed and low-power split-radix FFT,” IEEE Trans. Signal Process., vol. 51, no. 3, pp. 864–874, Mar. 2003.
6. S. He and M. Torkelson, “Designing pipeline FFT processor for OFDM (de) modulation,” in Proc. IEEE URSI Int. Symp. Signals, Syst., Electron., 1998, pp. 257–262.
7. Y. W. Lin, H. Y. Liu, and C. Y. Lee, “A dynamic scaling FFT processor for DVB-T applications,” IEEE J. Solid-State Circuits, vol. 39, no. 11, pp. 2005–2013, Nov. 2004.
8. P. Duhamel and H. Hollmann, “Split radix FFT algorithms,” Electron. Lett., vol. 20, pp. 14–16, 1984.