The general conversion algorithm described in Algorithm 7.1 for natural numbers has a mainly theoretical interest. In the context of general-purpose binary computers, a general circuit to convert *n*-digit base-*B*_{1} numbers into *m*-digit base-*B*_{2} ones doesn't seem to warrant practical interest. A block diagram is nevertheless presented in Figure 14.1 to illustrate a possible implementation of such a circuit, assuming a binary coding for the digits in both bases.

The multiplier by *B*_{1}, the adder stage, and the divider by *B*_{2} are binary operators defined as follows:

- The multiplier-by-
*B*_{1}has a (1 + log_{2}(*B*_{2}− 1))-bit input and a (2 + log_{2}(*B*_{2}− 1)+ log_{2}*B*_{1})-bit output. - The adder stage inputs are ...

Start Free Trial

No credit card required