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.
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 ...
Get Synthesis of Arithmetic Circuits: FPGA, ASIC and Embedded Systems now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.