Modular arithmetic using low order redundant bases

Author

Parker, M.G. ; Benaissa, M.

Author_Institution

Dept. of Electr. & Electron. Eng., Bradford Univ., UK

Volume

Issue

fYear

1997

fDate

5/1/1997 12:00:00 AM

Firstpage

611

Lastpage

616

Abstract

N-digit, radix-α bases are proposed for VLSI implementation of redundant arithmetic, mod m, where ⟨α^N⟩ _m=±1, ⟨α^j⟩_m≠±1, for 0<j<N and m is prime. These bases simplify arithmetic overflow and are well suited to redundant arithmetic. The representations provide competitive, multiplierless T-point number theoretic transforms, mod m, where Tl N or Tl 2N

Keywords

number theory; polynomials; redundant number systems; residue number systems; transforms; T-point number theoretic transforms; VLSI implementation; arithmetic overflow; low order redundant bases; modular arithmetic; radix-α bases; redundant arithmetic; Arithmetic; Concurrent computing; FAA; Fault tolerant systems; Hardware; Neural networks; Polynomials; Redundancy; Signal processing; Very large scale integration;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.589237

Filename

589237

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1557390