Power and area efficient fast fourier transform processor
First Claim
1. A fast Fourier transform (FFT processor formed using minimal integrated circuit chip area for efficiently performing low power fast Fourier transform operations, comprising:
- one or more butterfly modules having a radix greater than four, at least one butterfly module including a fixed coefficient multiplier circuit for performing a twiddle factor multiplication,wherein an input data stream is processed by the one or more butterfly modules to generate a transformed output data sequence.
11 Assignments
0 Petitions
Accused Products
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.
49 Citations
45 Claims
-
1. A fast Fourier transform (FFT processor formed using minimal integrated circuit chip area for efficiently performing low power fast Fourier transform operations, comprising:
-
one or more butterfly modules having a radix greater than four, at least one butterfly module including a fixed coefficient multiplier circuit for performing a twiddle factor multiplication, wherein an input data stream is processed by the one or more butterfly modules to generate a transformed output data sequence. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. A method for computing a fast Fourier transform (FFT) with an FFT processor formed using minimal integrated circuit chip area to efficiently perform fast Fourier transform operations with reduced power, comprising the steps of:
-
constructing the FFT processor with plural processing modules having a radix greater than four, each processing module including a fixed coefficient multiplier for performing a twiddle factor multiplication, and processing an input data stream in each processing module to generate a transformed output data sequence. - View Dependent Claims (14, 15, 16, 17, 18, 19, 20, 21, 22, 23)
-
-
24. A fast Fourier transform (FFT) processor formed using minimal integrated circuit chip area for efficiently performing low power fast Fourier transform operations, comprising:
-
one or more discrete Fourier transfer (DFT) modules, each DFT module having three, 2-point butterfly units coupled together, and one or more twiddle factor multipliers implemented using a fixed coefficient multiplier circuit linking two of the 2-point butterfly units, wherein an input data stream is processed by the three butterfly units to generate a transformed output data sequence. - View Dependent Claims (25, 26, 27, 28, 29, 30, 31)
-
-
32. A fast Fourier transform (FFT) processor formed using minimal integrated circuit chip area for efficiently performing low power fast Fourier transform operations, comprising:
-
one or more discrete Fourier transform (DFT) modules, each DFT module having four, 2-point butterfly units coupled together, and one or more twiddle factor multipliers implemented using a fixed coefficient multiplier circuit linking at least two of the 2-point butterfly units, wherein an input data stream is processed by the three butterfly units to generate a transformed output data sequence. - View Dependent Claims (33, 34, 35, 36, 37, 38, 39)
-
-
40. A method for computing a fast Fourier transform (FFT) with an FFT processor formed using minimal integrated circuit chip area to efficiently perform fast Fourier transform operations with reduced power, comprising the steps of:
-
constructing the FFT processor with one or more processing modules, each processing module implementing three, 2-point butterfly units coupled together in pipeline fashion and at least two of the butterfly units linked by a fixed coefficient multiplier circuit; applying an input data stream to an input of a first one of the three butterfly units and processing the input data stream; processing an output of the first butterfly unit in a second one of the three butterfly units; and processing an output of the second butterfly unit in a third one of the three butterfly units to generate an output data sequence. - View Dependent Claims (41, 42)
-
-
43. A method for computing a fast Fourier transform (FFT) with an FFT processor formed using minimal integrated circuit chip area to efficiently perform fast Fourier transform operations with reduced power, comprising the steps of:
-
constructing the FFT processor with one or more processing modules, each processing module having four, 2-point butterfly units coupled together in pipeline fashion with at least two of the 2-point butterfly units linked by a fixed coefficient multiplier circuit; applying an input data stream to an input of a first one of the four butterfly units and processing the input data stream; processing an output of the first butterfly unit in a second one of the four butterfly units; processing an output of the second butterfly unit in a third one of the four butterfly units; and processing an output of the second butterfly unit in a fourth one of the four butterfly units to generate an output data sequence. - View Dependent Claims (44, 45)
-
Specification