Fast sign-detection algorithm for residue number system moduli set {2(n)-1, 2(n), 2(n+1)-1}

Cheeckottu Vayalil Niras*, Yinan Kong

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)

Abstract

Sign detection is an essential part of many computer hardware designs, and is not a trivial task in residue number systems because it is a function of all the residues. This study proposes an algorithm for the residue number system with a three-moduli set {2n - 1, 2n, 2n+1 - 1} using New Chinese Remainder Theorem II. The unit is built with one n-bit carry-save adder and a 2n-bit parallel prefix carry-generation unit. In the best case the Synoposys 90 nm synthesis result shows a 24% reduction in the area-delay product than existing algorithms for the same moduli set.

Original languageEnglish
Pages (from-to)54-58
Number of pages5
JournalIET Computers and Digital Techniques
Volume10
Issue number2
DOIs
Publication statusPublished - 1 Mar 2016

Fingerprint Dive into the research topics of 'Fast sign-detection algorithm for residue number system moduli set {2(n)-1, 2(n), 2(n+1)-1}'. Together they form a unique fingerprint.

Cite this