Implementation Of High Speed FFT Core For Low Power Hardware Without Using ROM For Twiddle Factor

Storage.

4/7/12

ABSTRACT

Fast Fourier transform (FFT) is an efficient algorithm to calculate Discrete Fourier Transform (DFT) and its inverse. A wide variety of applications like Digital Signal processing and image processing rely heavily on it. The FFT computation is done by the FFT processors and its design is a key factor for the application. The proposed design implements a radix-4 FFT processor, which incorporates a low power commutator and a Butterfly structure without a multiplier. The parallel pipe lined architecture of the processor also has higher throughput with lowered power consumption.
4/7/12 Click to edit Master subtitle style

We can implement new FFT core to process FFT computation without using ROM for twiddle factor storage or FFT without externally using any external memory

4/7/12