YP.2.4 Binary-Decimal Conversion（双语）

最新推荐文章于 2022-05-09 17:20:44 发布

szlzeng

最新推荐文章于 2022-05-09 17:20:44 发布

阅读量491

点赞数

分类专栏：计算系统基础

计算系统基础专栏收录该内容

13 篇文章 0 订阅

订阅专栏

from：

[1] Introduction to Computing System, from Bits and Gates to C and Beyond. Yale N. Patt and Sanjay J. Patel. McGraw-Hill Higher Education.（英）

[2] 计算系统基础_陈道蓄http://course.jingpinke.com/details?uuid=8a833999-2031c13b-0120-31c13bb1-012b

2.4 Binary-Decimal Conversion

It is often useful to convert integers between the 2's complement data type and the decimal representation that you have used all your life.

2.4.1 Binary to Decimal Conversion

We convert from 2's complement to a decimal representation as follows: For purposes of illustration, we will assume 2's complement representations of eight bits, corresponding to decimal integer values from -128 to +127.

Recall that an eight-bit 2's complement number takes the form

a₇ a₆ a₅ a₄ a₃ a₂ a₁ a₀

where each of the bits a_i is either 0 or 1.

1. Examine the leading bit a₇. If it is a 0, the integer is positive, and we can begin evaluating its magnitude. If it is a 1, the integer is negative. In that case, we need to first obtain the 2's complement representation of the positive number having the same magnitude.

2. The magnitude is simply

a₆ • 2⁶ + a₅ • 2⁵ +a₄ •2⁴ +a₃ • 2³ +a₂ • 2² +a₁ • 2¹ +a₀ • 2⁰

which we obtain by simply adding the powers of 2 that have coefficients of 1.

3. Finally, if the original number is negative, we affix a minus sign in front.

Done!

Example 2.2

Convert the 2's complement integer 11000111 to a decimal integer value.

1. Since the leading binary digit is a 1, the number is negative. We must first find the 2's complement representation of the positive number of the same magnitude.

This is 00111001.

2. The magnitude can be represented as

0 • 2⁶ + 1 • 2⁵ + 1 • 2⁴ + 1 • 2³ + 0 • 2² +0 • 2¹ + 1 • 2⁰

32 + 16 + 8 + 1.

3. The decimal integer value corresponding to 11000111 is -57.

2.4.2 Decimal to Binary Conversion

Converting from decimal to 2's complement is a little more complicated. The crux of the method is to note that a positive binary number isodd if the rightmost digit is 1 andeven if the rightmost digit is 0.

Consider again our generic eight-bit representation:

a₇ • 2⁷ + a₆ • 2⁶ +a₅ • 2⁵ +a₄ •2⁴ +a₃ • 2³ +a₂ • 2² +a₁ • 2¹ +a₀ • 2⁰

We can illustrate the conversion best by first working through an example.

Suppose we wish to convert the value +105 to a 2's complement binary code. We note that +105 is positive. We first find values fora_i, representing the magnitude 105. Since the value is positive, we will then obtain the 2's complement result by simply appendinga₇, which we know is 0.

Our first step is to find values for a_i that satisfy the following:

105 = a₆ • 2⁶ + a₅ • 2⁵ +a₄ •2⁴ +a₃ • 2³ +a₂ • 2² +a₁ • 2¹ +a₀ • 2⁰

Since 105 is odd, we know that a₀ is 1. We subtract 1 from both sides of the equation, yielding

104 = a₆ • 2⁶ + a₅ • 2⁵ +a₄ •2⁴ +a₃ • 2³ +a₂ • 2² +a₁ • 2¹

We next divide both sides of the equation by 2, yielding

52 = a₆ • 2⁵ + a₅ • 2⁴ +a₄ •2³ +a₃ • 2² +a₂ • 2¹ +a₁• 2⁰

We note that 52 is even, so a₁ the only coefficient not multiplied by a power of 2, must be equal to 0.

We now iterate the process, each time subtracting the rightmost digit from both sides of the equation, then dividing both sides by 2, and finally noting whether the new decimal number on the left side is odd or even. Starting where we left off, with

52 = a₆ • 2⁵ + a₅ • 2⁴ +a₄ •2³ +a₃ • 2² +a₂ • 2¹

the process produces, in turn:

26 = a₆ • 2⁴ + a₅ • 2³ +a₄ •2² +a₃ • 2¹ +a₂ • 2⁰

Therefore, a₂ = 0.

13 = a₆ • 2³ + a₅ • 2² +a₄ •2¹ +a₃ • 2⁰

Therefore, a₃ = 1.

6 = a₆ • 2² + a₅ • 2¹ +a₄ •2⁰

Therefore, a₄ = 0.

3 = a₆ • 2¹ + a₅ • 2⁰

Therefore, a₅= 1.

1 = a₆ • 2⁰

Therefore, a₆= 1, and we are done. The binary representation is 01101001.

Let's summarize the process. If we are given a decimal integer valueN,we construct the 2's complement representation as follows:

1. We first obtain the binary representation of the magnitude ofNby forming the equation

N = a₆ • 2⁶ + a₅ • 2⁵ +a₄ •2⁴ +a₃ • 2³ +a₂ • 2² +a₁ • 2¹ +a₀ • 2⁰

and repeating the following, until the left side of the equation is 0:

a. If N is odd, the rightmost bit is 1. If N is even, the rightmost bit is 0.

b. Subtract 1 or 0 (according to whether N is odd or even) fromN,

remove the least significant term from the right side, and divide both sides of the equation by 2.

Each iteration produces the value of one coefficient a_i.

2. If the original decimal number is positive, append a leading 0 sign bit, and you are done.

3. If the original decimal number is negative, append a leading 0 and then form the negative of this 2's complement representation, and then you are done.