Efficient number theoretic transforms for convolutions using ROM arrays

DOI10.1080/00207218908921087zbMath0706.65157OpenAlexW1978987989MaRDI QIDQ3486848

Wan-Chi 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

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

Cites Work

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

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