A pipelined FFT processor for word-sequential data
Guoan Bi, E.V. Jones · IEEE Transactions on Acoustics Speech and Signal Processing · 1989
A modified fast Fourier transform algorithm is described together with a real-time pipelined implementation. The approach is particularly suited to sequentially presented input data. The method can be used for both mixed and uniform radix number implementations. For example, for the radix-4 implementation, the method requires less data memory and only 1/3 of the number of complex multipliers of a conventional design.>