By Topic

Generalised fault-tolerant stored-unibit-transfer residue number system multiplier for moduli set {2n - 1, 2n, 2n + 1}

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Timarchi, S. ; Electr. Eng. Dept., Shahid Beheshti Univ., Tehran, Iran ; Fazlali, M.

Residue number system (RNS) which utilises redundant encoding for the residues is called redundant residue number system (RRNS). It can accelerate multiplication which is a high-latency operation. Using stored-unibit-transfer (SUT) redundant encoding in RRNS called SUT-RNS has been shown as an efficient number system for arithmetic operation. Radix-2h SUT-RNS multiplication has been proposed in previous studies for modulo 2n-1, but it has not been generalised for each moduli lengths (n) and radix (r=2h). Also, SUT-RNS multiplication for modulo 2n+1 has not been discussed. In this study the authors remove these weaknesses by proposing general radix-2h SUT-RNS multiplication for the moduli set {2n-1, 2n, 2n+1+}. Moreover, the authors demonstrate that our approach enables a unified design for the moduli set multipliers, which results in designing fault-tolerant SUT-RNS multipliers with low hardware redundancy. Results indicate that the proposed general SUT-RNS multiplier for the moduli set +2n-1, 2n, 2n+1+ is a fast fault-tolerant multiplier which outperforms area, power and energy/operation of existing RRNS multiplier.

Published in:

Computers & Digital Techniques, IET  (Volume:6 ,  Issue: 5 )