The Residue Number System (RNS) offers unlimited opportunities for high performance arithmetic provided efficient forward and reverse converters could be constructed for the moduli set at hand. All forward conversion proposals to date, require some form of Read Only Memory (ROM) along with computational elements like Full Adders (FA). In this paper, we show that by formulating the forward conversion problem in terms of modular exponentiation and addition, we can achieve memory free conversion. We generalize our solution such that bit serial and bit parallel implementations can be derived by simply varying a parameter, namely, multiplexers. Apart from this formulation itself, the paper makes two other contributions. Firstly, it demonstrates an entirely new set of converters that use no look up. Secondly, we show how conversion complexity can be reduced significantly by sharing circuitry over several forward converters.
[1]
G. Alia,et al.
A VLSI algorithm for direct and reverse conversion from weighted binary number system to residue number system
,
1984
.
[2]
Giuseppe Alia,et al.
VLSI Binary-Residue Converters for Pipelined Processing
,
1990,
Comput. J..
[3]
P. V. Ananda Mohan.
Novel design for binary to RNS converters
,
1994,
Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.
[4]
Michael A. Soderstrand,et al.
Residue number system arithmetic: modern applications in digital signal processing
,
1986
.
[5]
R. Capocelli,et al.
Efficient VLSI networks for converting an integer from binary system to residue number system and vice versa
,
1988
.