Fast DFT algorithms for length N=q*2m

This paper presents a general split-radix algorithm which can flexibly compute the discrete Fourier transforms (DFT) of length q*2^m where q is an odd integer. Comparisons with previously reported algorithms show that substantial savings on arithmetic operations can be made. Furthermore, a wider range of choices on different sequence lengths is naturally provided