Multiple radix fast Fourier transformation based on number theoretic transforms

DOI10.1016/0016-0032(91)90003-LzbMath0723.65148OpenAlexW2003712614MaRDI QIDQ757003

Brooks Lawrence, Robert J. Polge, Adhami, Reza R.

Publication date: 1991

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(91)90003-l

zbMATH Keywords

Chinese remainder theoremcyclic convolutionnumber theoretic transformsDiscrete Fourier transformmultiple radix fast Fourier transformationresidue arithmetic

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Numerical methods for discrete and fast Fourier transforms (65T50)

Cites Work

• Fast Fourier transformation based on number theoretic transforms
• Efficient Fast Fourier Transform Programs for Arbitary Factors with One Step Loop Unscrambling

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