Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

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

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

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Computers and Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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 (⌈log2k⌉+1)-bit carry–propagate adder, a ROM with ⌈log2k⌉+3 address bits, a (w+⌈log2k⌉)-bit borrow–save subtractor, and a w-bit carry–propagate adder. This comprises less hardware than any other reported general modulus CRT-based converter.

References

    1. 1)
      • N. BURGESS , T.E. WILLIAMS . Choices of operand truncation in the SRT division algorithm. IEEE Trans. , 7 , 933 - 938
    2. 2)
      • K.M. ELLEITHY , M.A. BAYOUMI . Fast and flexible architectures for RNS arithmetic decoding. IEEE Trans. , 4 , 226 - 235
    3. 3)
      • G.I. DAVIDA , B. LITOW . Fast parallel arithmetic via modular representation. SIAM J. Comput. , 4 , 756 - 765
    4. 4)
      • T. SRIKANATHAN , M. BHARDWAJ , C.T. CLARKE . Area-time efficient VLSI residue-to-binary converters. IEE Proc. Comput. Digital Tech. , 3 , 229 - 236
    5. 5)
      • C.K. KOC , C.Y. HUNG . Fast algorithm for modular reduction. IEE Proc. Comput. Digital Tech. , 4 , 261 - 265
    6. 6)
      • I. Koren . (1993) Computer arithmetic algorithms.
    7. 7)
      • S. BANDYOPADHYAY , G.A. JULLIEN , A. SENGUPTA . A fast VLSI systolic array for large modulus residue addition. J. VLSI Signal Process. , 3 , 305 - 318
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-cdt_20010202
Loading

Related content

content/journals/10.1049/ip-cdt_20010202
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address