Fast Multipliers for Number Theoretic Transforms

  • Authors:
  • H. J. Nussabaumer

  • Affiliations:
  • IBM France, La Gaude Laboratory

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1978

Quantified Score

Hi-index 14.98

Visualization

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.