الفهرس 
A low complexity fast fourier transform architecture
SummaryOnly 14 pages are availabe for public view
 |  | from | 132 |  |  |
| | | from | 132 | | |
Abstract
In digital signal processing {uFB01}eld, it is often required to transform the signal between time and frequency domains using the fast fourier transform (FFT) algorithm. Therefore FFT blocks is one of the basic building block in digital signal processors. The basic computational units of the high-throughput pipeline FFT architectures are the butter{uFB02}y block and a rotator block. The butter{uFB02}y block performs a weighted complex addition and subtraction, while the rotator block performs a rotation in the complex plane by a given rotation angles, i.e., the twiddle factors. Compared to the butter{uFB02}y operation, the rotator operation is the costly one. In this work we propose a restructure to the conventional FFT rotational angles into a modi{uFB01}ed hardWare friendly FFT (HW-F FFT) angles. The main goal is to enhance either power, area or speed performance while maintaining the signal to Quantization Noise Ratio (SQNR) requirements