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.<<ETX>>
[1] Rainer Storn,et al. Fast algorithms for the discrete Hartley transform , 1986 .
[2] G. Bruun. z-transform DFT filters and FFT's , 1978 .
[3] R. Smith,et al. Digital matched filtering with pipelined floating point fast Fourier transforms (FFT's) , 1975 .
[4] Douglas L. Jones,et al. Real-valued fast Fourier transform algorithms , 1987, IEEE Trans. Acoust. Speech Signal Process..
[5] J. A. Johnston. Parallel pipeline fast fourier transformer , 1983 .