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

• Published in: Chronic diseases and translational medicine Vol. 10; no. 2; pp. 54 - 58
• Main Authors: Niras, Cheeckottu Vayalil, Kong, Yinan
• Format: Journal Article
• Language: English
• Published: Beijing The Institution of Engineering and Technology 01.03.2016; John Wiley & Sons, Inc
• Subjects: 2n‐bit parallel prefix carry‐generation unit; adders; Algorithms; area‐delay product; computer hardware designs; Computer peripherals; Design engineering; Digital techniques; fast sign‐detection algorithm; Hardware; Mathematical analysis; Multiplication & division; New Chinese Remainder Theorem II; Number systems; n‐bit carry‐save adder; Read only memory; residue number system moduli set {2n − 1, 2n, 2n+1 − 1}; Residue number systems; Residues; ROM; size 90 nm; Synoposys synthesis; Tasks; size 90 nm; residue number system moduli set {2n − 1, 2n, 2n+1 − 1}; Synoposys synthesis; adders; 2n-bit parallel prefix carry-generation unit; area-delay product; fast sign-detection algorithm; n-bit carry-save adder; computer hardware designs; New Chinese Remainder Theorem II; residue number systems
• ISSN: 1751-8601; 1751-861X; 2095-882X; 1751-861X; 2589-0514
• DOI: 10.1049/iet-cdt.2015.0050

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.