Split-radix algorithms for length-p/sup m/ DFTs
Reasons are suggested why the split-radix algorithm is better than any single-radix algorithm on length-2/sup m/ DFTs (discrete Fourier transforms). 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, 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>>