Extension of the fast Fourier number theoretic transform to multiple radix

A multi-radix fast Fourier number theoretic transform is proposed for the calculation of the discrete Fourier transform of sequences with a prime length P=2/sup k1/*3/sup k2/*5/sup k3/+1, where k1, k2, and k3 are integers. Advantages include availability of fast algorithms for a set of prime lengths, residue arithmetic with benefit in speed and hardware cost, and parallel implementation. A discrete power spectrum example is included.<
>