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.<
>