Subscribe
Issue No.08 - August (1978 vol.27)
pp: 764-765
H.J. Nussabaumer , IBM France, La Gaude Laboratory
ABSTRACT
When digital filters are implemented with number theoretic transforms (NTT's), the bulk of the computation usually corresponds to multiplications in residue arithmetic. We show that, with the most commonly used NTT's, multiplication can be speeded up at the expense of small additional storage requirements.
INDEX TERMS
residue arithmetic, Fermat, Fermat number transform (FNT), Mersenne, multipliers
CITATION
H.J. Nussabaumer, "Fast Multipliers for Number Theoretic Transforms", IEEE Transactions on Computers, vol.27, no. 8, pp. 764-765, August 1978, doi:10.1109/TC.1978.1675187