FFT-based parallel system with memory reuse scheme

摘要

A method may include storing N number of Fast Fourier Transform (FFT) data points into x-memories, N and x being integers greater than one, and the x-memories having a total memory capacity equivalent to store the N number of FFT data points, and reading K FFT data points of the N number of FFT data points from each of the x-memories so that the N number of FFT data points are read, K being an integer greater than one. The method may further include performing parallel radix-m FFTs on the x*K number of FFT data points, multiplying the x*K number of FFT data points by twiddle factors to obtain resultants, shifting the resultants, and writing back the shifted resultants of the x*K number of FFT data points to the x-memories. The method may also include repeating the reading, the multiplying, the shifting and the writing back until the N number of FFT data points have been completely transformed into an FFT resultant, and where there is x*K number of FFT data points available for processing during every repetition, and outputting the FFT resultant.