Multiple radix fast Fourier transformation based on number theoretic transforms

From MaRDI portal
Publication:757003





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)\).











This page was built for publication: Multiple radix fast Fourier transformation based on number theoretic transforms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757003)