A novel radix-2 pipeline architecture for the computation of the DFT

A radix-two discrete Fourier transform (DFT) algorithm is derived which supports a pipeline architecture realization. The amount of necessary multipliers for the pipeline structure can be reduced by a factor up to four compared to the conventional and most often used radix-2 pipeline-FFT. This reduction is obtained without sacrificing computational speed. Several applications of digital signal processing require dedicated hardware to compute the DFT and/or its inverse in order to cope with the fast processing speeds which are needed