Novel high-radix residue number system architectures

Vassilis Paliouras, Thanos Stouraitis

Research output: Contribution to journalArticlepeer-review

23 Scopus citations

Abstract

Novel radix-r modulo-rn arithmetic units for residue number system (RNS)-based architectures are introduced in this paper. The proposed circuits are shown to require several times less area than previously reported architectures for particular moduli of operation, while also being preferable in the area × time complexity sense. The complexity reduction is achieved by extending the carry-ignore property of modulo-2n operations to radices higher than two, which are not powers of two. The carry-ignore property is efficiently exploited by introducing simplified digit adders, instead of general radix-r adders. The proposed simplification of digit adders is possible, since the maximum values of certain intermediate digits produced in the architecture are found to be less than r - 1. Detailed area and time complexity models are derived for the arithmetic units. The proposed radix-r architectures include multipliers, adders, and merged multipliers-adders. In addition, efficient radix-r binary-to-residue and residue-to-binary conversion techniques and architectures are introduced.

Original languageBritish English
Pages (from-to)1059-1073
Number of pages15
JournalIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Volume47
Issue number10
DOIs
StatePublished - Oct 2000

Fingerprint

Dive into the research topics of 'Novel high-radix residue number system architectures'. Together they form a unique fingerprint.

Cite this