MODULAR ARITHMETIC USING LOW-ORDER REDUNDANT BASES

Authors
PARKER MG BENAISSA M
Citation
Mg. Parker et M. Benaissa, MODULAR ARITHMETIC USING LOW-ORDER REDUNDANT BASES, I.E.E.E. transactions on computers, 46(5), 1997, pp. 611-616
Citations number
10
Categorie Soggetti
Computer Sciences","Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture
Journal title
I.E.E.E. transactions on computers → ACNP
ISSN journal
00189340
Volume
46
Issue
5
Year of publication
1997
Pages
611 - 616
Database
ISI
SICI code
0018-9340(1997)46:5<611:MAULRB>2.0.ZU;2-Z
Abstract
N-digit, radix-alpha bases are proposed by VLSI implementation of redu ndant arithmetic, mod m, where [alpha(N)](m) = +/-1, [alpha(i)](m) not equal +/-1, for 0 < j < N and m is prime. These bases simplify arithm etic overflow and are well suited to redundant arithmetic. The represe ntations provide competitive, multiplierless T-point Number Theoretic Transforms, mod m, where Tl N or Tl 2N.