PIPELINE FFT ARCHITECTURE AND METHOD

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 (FFTe) having one or more registers ( 650 ) and a delayless pipeline ( 630 ), the FFTe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: KRISHNAMOORTHI, RAGHURAMAN, COUSINEAU, KEVIN S
Format: Patent
Sprache:eng ; fre ; ger
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 (FFTe) having one or more registers ( 650 ) and a delayless pipeline ( 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.