Patent ID: 6549925
Filing Date: 2003-04-15
Classification: G06F

Abstract:
A circuit for calculating a fast Fourier transform (FFT) of a plurality of data values comprising:a data memory for storing data values; a coefficient memory for storing coefficient values; a multiplier disposed to receive data from both the data memory and the coefficient memory, the multiplier being configured to multiply values retrieved from the data memory and the coefficient memory; an adder configured to add a value output from the multiplier with another value that is selected by a first multiplexer, wherein the another value selected by the first multiplexer includes one selected from the group consisting of: a value from the data memory, zero, a value output from an accumulator that receives the output of the adder, and a value output from a delayed accumulator that receives the output from the accumulator; and an arithmetic logic unit (ALU) configured to add a value retrieved from the data memory with another value that is selected by a second multiplexer.