New FFT structures based on the Bruun algorithm

In some signal processing applications, the input data are real. In this case, the Bruun algorithm for computation of the discrete Fourier transform (DFT) is attractive. The author offers a pipeline and a recirculated shuffle network implementation of the Bruun algorithm. The implementation of the parallel pipeline and recirculated FFT structures is based on the modified perfect shuffle network. >

[1]  Bongiovanni,et al.  A VLSI Network for Variable Size FFT's , 1983, IEEE Transactions on Computers.

[2]  Thompson.  Fourier Transforms in VLSI , 1983, IEEE Transactions on Computers.

[3]  G. Bruun.  z-transform DFT filters and FFT's , 1978 .

[4]  Douglas Stott Parker,et al.  Notes on Shuffle/Exchange-Type Switching Networks , 1980, IEEE Transactions on Computers.

[5]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.