Efficient computation of the DFT for some transform lengths that are not integral powers of two

In this paper, it is shown that radix-2 discrete Fourier transform algorithms can be designed for some transform lengths that are not integral powers of two. These algorithms reduce the overhead operations significantly compared with the mixed-radix algorithms. A specific algorithm is described in detail and its computational complexity and run-time performance are compared with the corresponding mixed-radix algorithm.