Subscribe
Issue No.12 - December (1972 vol.21)
pp: 1281-1285
D.K. Banerji , Department of Computer Science, University of Ottawa
ABSTRACT
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.
INDEX TERMS
Base extension, input translation, modular arithmetic, output translation, residue number systems.
CITATION
D.K. Banerji, J.A. Brzozowski, "On Translation Algorithms in Residue Number Systems", IEEE Transactions on Computers, vol.21, no. 12, pp. 1281-1285, December 1972, doi:10.1109/T-C.1972.223499