Multiple radix fast Fourier transformation based on number theoretic transforms
Discrete Fourier transform on a prime number of samples is computed by means of the multiple radix fast Fourier transformation based on number theoretic transforms. This proposal is efficient in the transformation of samples \(P=2^{k1}3^{k2}5^{k3}\) with arbitrary integers ki \((i=1,2,3)\).
multiple radix fast Fourier transformation
scientific article; zbMATH DE number 4193072