Title :
Fast Multipliers for Number Theoretic Transforms
Author_Institution :
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.
Keywords :
Fermat; Fermat number transform (FNT); Mersenne; multipliers; residue arithmetic; Convolution; Costs; Digital arithmetic; Digital filters; Filtering; Performance evaluation; Signal processing; Fermat; Fermat number transform (FNT); Mersenne; multipliers; residue arithmetic;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1978.1675187
