No Access

FAST RESIDUE-TO-BINARY CONVERSION USING BASE EXTENSION AND THE CHINESE REMAINDER THEOREM

AMOS R. OMONDI

School of Electrical and Electronic Engineering, Yonsei University, 134 Shinchon-dong, Seodaemun-gu, Seoul, Korea 120-749, Korea

Search for more papers by this author

https://doi.org/10.1142/S021812660700371XCited by:3 (Source: Crossref)

Abstract

Residue number systems are attractive due to their basic arithmetic operations, such as addition and multiplication, are carry-free; this facilitates low-power, high-speed implementations. But converting from residue to conventional notation is generally problematic. In this paper, we propose a high-speed architecture for reverse conversion; this is based on Base Extension and the Chinese Remainder Theorem.

Keywords:

References

N. S. Szabo and R. I. Tanaka , Residue Arithmetic and its Applications to Computer Technology ( McGraw Hill , New York , 1967 ) . Google Scholar
R. Charles and L. Sousa , RDSP: A RISC DSP based on residue number system , Proc. Euromicro Symp. Digital System Design ( 2003 ) . Google Scholar
B. Parhami and C. Y. Hung , Optimal table lookup schemes for VLSI implementation of input/output conversions and other residue number operations , VLSI Signal Processing VII ( IEEE Press , New York , 1994 ) . Google Scholar
S. J. Piestrak, IEEE Trans. Circuits Syst. II 42, 661 (1995), DOI: 10.1109/82.471401. Crossref, Google Scholar
N. Burgess , Efficient RNS to binary conversion using high-radix SRT division , Proc. 14th Int. Symp. Computer Arithmetic ( 1999 ) . Google Scholar
K. M. Elleithy and M. A. Bayoumi, IEEE Trans. Circuits Syst. II 39, 226 (1992), DOI: 10.1109/82.136572. Crossref, Google Scholar
B. Parhami , Computer Arithmetic ( Oxford University Press , New York , 2000 ) . Google Scholar
A. P. Shenoy and R. Kumaresan, IEEE Trans. Comput. 38, 292 (1989), DOI: 10.1109/12.16508. Crossref, Web of Science, Google Scholar