Some results in fixed point error analysis of the Bruun-FTT algorithm

Results for a fixed-point error analysis of the Bruun-fast Fourier-transform (FFT) algorithm are presented. The noise-to-signal ratio of the Bruun algorithm is evaluated theoretically as well as experimentally and is compared to that of the decimation-in-time FFT. The noise-to-signal ratio of the Bruun-FFT is found to be significantly higher if safe scaling is applied in both cases. >

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

[2]  Rainer Storn A novel radix-2 pipeline architecture for the computation of the DFT , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[3]  Yuhang Wu New FFT structures based on the Bruun algorithm , 1990, IEEE Trans. Acoust. Speech Signal Process..