FAST RESIDUE-TO-BINARY CONVERSION USING BASE EXTENSION AND THE CHINESE REMAINDER THEOREM
Amos R. Omondi · Journal of Circuits Systems and Computers · 2007
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.