1 Excerpt

- Published 2010 in 2010 International Conference on Advances in…

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.

@article{Sridharan2010LowPH,
title={Low Power Hardware Implementation of High Speed FFT Core},
author={Akshay Sridharan and Angel Viji},
journal={2010 International Conference on Advances in Computer Engineering},
year={2010},
pages={223-227}
}