By Topic

Efficient RNS-to-binary conversion using high-radix SRT division

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
$33 $33
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)
N. Burgess ; Div. of Electron., Cardiff Univ., UK

A new Chinese remainder theorem (CRT)-based technique for the conversion of numbers in residue number system (RNS) format to binary representation is proposed that employs a high-radix SRT division-like architecture. The major benefit of the new technique is that it permits the efficient conversion of residue numbers with many moduli. A k-modulus RNS converter returning a w-bit result employs a([log2 k]+1)-bit carry-propagate adder, a ROM with [log, k]+3 address bits, a (w+[log, k])-bit borrow-save subtracter, and a M -bit carry-propagate adder. This comprises less hardware than any other reported general modulus CRT-based converter

Published in:

IEE Proceedings - Computers and Digital Techniques  (Volume:148 ,  Issue: 1 )