By Topic

Adder based residue to binary converters for a new balanced 4-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

3 Author(s)
Bin Cao ; Centre for High Performance Embedded Syst., Nanyang Technol. Univ., Singapore ; Chang, C.-H. ; Srikanthan, T.

In this paper, an efficient residue to binary conversion algorithm is derived for a new four-moduli set {2n-1, 2n, 2n+1, 2n-1-1} with large dynamic range and well-balanced moduli. Our algorithm exploits the special periodicity properties of the proposed moduli set to obtain hardware efficacy. By using the most efficient residue to binary conversion of the three-moduli set {2n-1, 2n, 2n+1}, the proposed algorithm can be reduced to a simpler two moduli set RNS where fast mixed-radix conversion can be used to obtain the weighted binary number. Four different adder-based architectures are proposed, all are pipelinable to achieve very high throughput rate, and all are more efficient than the residue to binary converters for other four-moduli sets in terms of area and delay.

Published in:

Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the 3rd International Symposium on  (Volume:2 )

Date of Conference:

18-20 Sept. 2003