APPARATUS AND METHOD FOR AREA AND SPEED EFFICIENT FAST FOURIER TRANSFORM (FFT) PROCESSORING WITH RUNTIME AND STATIC PROGRAMMABILITY OF NUMBER OF POINTS

摘要

An apparatus and method for area and speed efficient fast Fourier transform (FFT) processing comprising mapping a one-dimensional DFT to a multi-dimensional representation; re-indexing the multi-dimensional representation as a radix 23 decimation architecture; simplifying the radix 23 decimation architecture to obtain a nested butterfly architecture; acquiring N samples of a finite duration time-sampled signal; and inputting the acquired N samples into the nested butterfly architecture to obtain a N-point fast Fourier transform (FFT) output.