This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast Multipliers for Number Theoretic Transforms
August 1978 (vol. 27 no. 8)
pp. 764-765
H.J. Nussabaumer, IBM France, La Gaude Laboratory
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, Aug. 1978, doi:10.1109/TC.1978.1675187
Usage of this product signifies your acceptance of the Terms of Use.