Referenced Items are not available for this document.
This paper considers translation problems in residue number systems. The conversion from a fixed-base representation to a residue representation can be done using residue adders only; we show that relatively simple combinational logic can be used to replace one level of residue addition. In the reverse translation problem, we examine the conditions under which base extension can be used to compute the fixed-base digits from a residue code number, and we study the efficiency of the algorithm.
Published in:
Computers, IEEE Transactions on
(Volume:C-21
,
Issue:
12
)
Date of Publication: Dec. 1972
- Page(s):
- 1281 - 1285
- ISSN :
- 0018-9340
- Digital Object Identifier :
- 10.1109/T-C.1972.223499
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 14 August 2006
- Issue Date :
- Dec. 1972
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
