By Topic

New efficient residue-to-binary converters for 4-moduli set {2n - 1, 2n, 2n + 1, 2n+1 - 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 $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 ; Chip-Hong Chang ; Srikanthan, T.

This paper describes a new algorithm of residue-to-binary conversion for the 4-moduli set {2n - 1, 2n, 2n + 1, 2n+1 - 1} RNS which is valid for even n. The number theoretic properties of this moduli set are exploited to realize an efficient reverse converter. By using the most efficient residue-to-binary conversion algorithm for the triple moduli set {2n - 1, 2n, 2n + 1}, the problem can be reduced to a simpler residue-to-binary converter for two moduli set RNS amenable to fast mixed-radix conversion. Two different versions of architecture based on this new formulation are proposed. Comparing to the fastest reverse converter reported for the same moduli set, our proposed converters surpass it in both the area and time complexities.

Published in:

Circuits and Systems, 2003. ISCAS '03. Proceedings of the 2003 International Symposium on  (Volume:4 )

Date of Conference:

25-28 May 2003