Streamlined real-factor FFTs

In this paper we show that Rader and Brenner's ‘real-factor’ FFT can be streamlined so that it requires lower computational complexity as compared to the Cooley- Tukey radix-2 FFT. We then show that the fixed point implementation of ‘real-factor’ FFT can be modified so that its noise-to-signal ratio (NSR) is lower than the NSR of Cooley-Tukey radix-2 FFT. Finally simulation results are presented which verify the suitability of ‘real-factor’ FFTs.