The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1997 vol.46)
pp: 611-616
ABSTRACT
<p><b>Abstract</b>—<it>N</it>-digit, radix-α bases are proposed for VLSI implementation of redundant arithmetic, mod <it>m</it>, where</p><tf>$$\Big\langle {\alpha ^N} \Big\rangle _m=\pm 1, \Big\langle {\alpha ^j} \Big\rangle _m\ne \pm 1,$$</tf><p>for 0 < <it>j</it> < <it>N</it> and <it>m</it> is prime. These bases simplify arithmetic overflow and are well suited to redundant arithmetic. The representations provide competitive, multiplierless <it>T</it>-point Number Theoretic Transforms, mod <it>m</it>, where <it>T</it> | <it>N</it> or <it>T</it> | 2<it>N</it>.</p>
INDEX TERMS
Modular arithmetic, redundant number systems, number theoretic transforms, residue and polynomial number systems.
CITATION
M.g. Parker, M. Benaissa, "Modular Arithmetic Using Low Order Redundant Bases", IEEE Transactions on Computers, vol.46, no. 5, pp. 611-616, May 1997, doi:10.1109/12.589237
34 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool