Split-radix algorithm for 2D DFT

摘要

A general split-radix algorithm is presented to compute 2D discrete Fourier transforms of sequence length q'2/sup m/ by q'2/sup m/ where q is an odd integer. By setting different values of q, DFT's 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.