## With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

No credit card required

## 14.1 BASE CONVERSION

### 14.1.1 General Base Conversion

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-B1 numbers into m-digit base-B2 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. Figure 14.1 Block diagram of a general base converter.

The multiplier by B1, the adder stage, and the divider by B2 are binary operators defined as follows:

• The multiplier-by-B1 has a (1 + log2 (B2 − 1) )-bit input and a (2 + log2(B2 − 1) + log2 B1 )-bit output.
• The adder stage inputs are ...

## With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

No credit card required