PIPELINE FFT ARCHITECTURE AND METHOD ABSTRACT Techniques for performing Fast Fourier Transforms (FFT) are described. In some aspects, calculating the Fast Fourier Transform is achieved with an apparatus having a memory (610), a Fast Fourier Transform engine (Feted) having one or more registers (650) and a delayless pigpen (630) the FFTe configured to receive a multi¬point input from the main memory (610), store the received input in at least one of the one or more registers (650), and compute either or both of a Fast Fourier Transform (FFT) and an Inverse Fast Fourier Transform (IFFT) on the input using the delayless pipeline.
展开▼
