New FFT structures based on the Bruun algorithm
Yiquan Wu · IEEE Transactions on Acoustics Speech and Signal Processing · 1990
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.>