Split-radix algorithm for 2D DFT
Guoan Bi, Yangqiu Chen · Electronics Letters · 1997
A general split-radix algorithm is presented to compute 2D discrete Fourier transforms of sequence length q*2m by q*2m, where q is an odd integer. By setting different values of q, DFTs of various sequence lengths can be efficiently computed. When q = 3, for example, savings in the number of operations can be achieved in comparison with that needed by other algorithms.