By Topic

An RNS to binary converter in 2n+1, 2n, 2n -1 moduli set

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 $13
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

1 Author(s)
Premkumar, A.B. ; Sch. of Appl. Sci., Nanyang Technol. Univ., Singapore

A residue number system to binary converter that converts numbers in the moduli set 2n+1,2n,2n-1 is described. This moduli set is an extension of the more popular set, 2n+1, 2n, 2n-1. A low-complexity implementation using some properties of modular arithmetic is proposed. The converter does not use any explicit modulo operation in the evaluation as is normally done in the Chinese remainder theorem

Published in:

Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on  (Volume:39 ,  Issue: 7 )