Split-radix algorithms for length-p/sup m/ DFT's

Abstract

The split-radix algorithm for the discrete Fourier transform (DFT) of length-2/sup m/ is considered. First, the reason why the split-radix algorithm is better than any single-radix algorithm on length-2/sup m/ DFTs is given. Then, the split-radix approach is generalized to length-p/sup m/ DFTs. It is shown that whenever a radix-p/sup 2/ outperforms a radix-p algorithm, then a radix-p/p/sup 2/ algorithm will outperform both of them. As an example, a radix-3/9 algorithm is developed for length-3/sup m/ DFTs.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>