Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed
Patent
1998-01-21
2000-05-09
Mai, Tan V.
Electrical computers: arithmetic processing and calculating
Electrical digital calculating computer
Particular function performed
708404, 708409, G06F 1500
Patent
active
060617055
ABSTRACT:
A fast Fourier transform (FFT) processor is constructed using discrete Fourier transform (DFT) butterfly modules having, in preferred example embodiments, sizes greater than 4. In a first example embodiment, the FFT processor employs size-8 butterflies. In a second example embodiment, the FFT processor employs size-16 butterflies. In addition, low power, fixed coefficient multipliers are employed to perform nontrivial twiddle factor multiplications in each butterfly module. The number of different, nontrivial twiddle factor multipliers is reduced by separating trivial and nontrivial twiddle factors and by taking advantage of twiddle factor symmetries in the complex plane and/or twiddle factor decomposition. In accordance with these and other factors, the present invention permits construction of an FFT processor with minimal power and IC chip surface area consumption.
REFERENCES:
patent: 4689762 (1987-08-01), Thibodeau, Jr.
patent: 4821224 (1989-04-01), Liu et al.
patent: 4868776 (1989-09-01), Gray et al.
patent: 5034910 (1991-07-01), Whelchel et al.
patent: 5042000 (1991-08-01), Baldwin
patent: 5093801 (1992-03-01), White et al.
patent: 5095456 (1992-03-01), Wong et al.
patent: 5293330 (1994-03-01), Sayegh
patent: 5313413 (1994-05-01), Bhatia et al.
patent: 5473556 (1995-12-01), Aguilar et al.
patent: 5694347 (1997-12-01), Ireland
Electronics & Communication Engineering Journal, Aug. 1995, pp. 169-177, G.M. Blair, "A review of the discrete Fourier transform, Part 1: Manipulating the powers of two".
IEEE Signal Processing, Apr. 1994, vol. 11, No. 2, ISSN 1053-5888, pp. 24-35, Peter Kraniauskas, "A Plain Man's Guide to the FFT".
Shousheng He, "Concurrent VLSI Architectures for DFT Computing and Algorithms for Multi-output Logic Decomposition, Ph.D. Thesis, Lund University, 1995, Chapter 8: A Pipeline FFT Processor Based on the Radix-2.sup.2 Algorithm".
Bernard, E. et al., "A Pipeline Architecture for Modified Higher Radix FFT," Digital Signal Processing 2, Estimation, VLSI, San Francisco, Mar. 23-26, 1992, vol. 5, No. Conf. 17, Mar. 23, 1992, pp. 617-620, XP000341496, Institute of Electrical and Electronics Engineers.
Widhe T., et al., "Design of efficient radix-8 butterfly PEs for VLSI," Proceedings of 1997 IEEE International Symposium on Circuits and Systems in the Information Age, ISCAS '97 (Cat. No. 97CH35987), Proceedings of 1997 IEEE International Symposium on Circuits and Systems, Circuits and Systems in TH, pp. 2084-2087, vol. 3, XP002074421, ISBN 0-7803-3583-X, 1997, New York, NY, USA, IEEE, Bernard, E. et al., "A Pipeline Architecture for Modified Higher Radix FFT," Digital Signal Processing 2, Estimation, VLSI, San Francisco, Mar. 23-26, 1992, vol. 5, No. Conf. 17, Mar. 23, 1992, pp. 617-620, XP000341496, Institute of Electrical and Electronics Engineers.
Swartzlander, Jr., E.E., et al., "A Radix-8 Wafer Scale FFT Processor," Journal of VLSI Signal Processing, vol. 4, No. 2/03, May 1, 1992, pp. 165-176, XP0002733177.
Mai Tan V.
Telefonaktiebolaget LM Ericsson
LandOfFree
Power and area efficient fast fourier transform processor does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Power and area efficient fast fourier transform processor, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Power and area efficient fast fourier transform processor will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1074874