On the suitability of Bruun’s FFT algorithm for software defined radio

Fast Fourier Transform (FFT) is the most basic and essential part of Software Defined Radio (SDR). Therefore, designing regular, reconfigurable, modular and low hardware complexity FFT computation block is very important. A single FFT block should be configurable for varying length FFT computation and also for computation of different transforms like DCT, DST etc. In this paper, the authors analyze implementation complexity and Noise to Signal Ratio (NSR) of Bruunpsilas FFT w.r.t. classical FFT for SDR. It is shown that, Bruunpsilas algorithm for FFT computation is ideally suited for SDR and should be used in preference over any classical FFT architecture for most practical cases.