Efficient number theoretic transforms for convolutions using ROM arrays

DOI10.1080/00207218908921087MaRDI QIDQ3486848zbMATH OpenOpenAlexFDO

Authors W. C. Siu, A. G. Constantinides

Publication date 1989

Published in International Journal of Electronics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207218908921087

zbMATH Keywords

convolutionsChinese remainder theoremnumber theoretic transformsROM arrays

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for specific classes of architectures (65Y10)

Recommendations

• Residue number system implementations of number theoretic transforms in complex residue rings
• Number-theoretic transforms with 2 as a root of unity
• Number theoretic transforms for the calculation of convolutions
• Fast Fourier transformation based on number theoretic transforms
• scientific article; zbMATH DE number 3843648

Cites work

• An in-place, in-order prime factor FFT algorithm
• Discrete Convolutions via Mersenne Transforms
• Index mappings for multidimensional formulation of the DFT and convolution
• Some good fields and rings for computing number theoretic transforms

Cited in

(1)

• Polynomial products by means of generalized number theoretic transforms

This page was built for publication: Efficient number theoretic transforms for convolutions using ROM arrays

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