Chapter 1

SLIDES FOR
CHAPTER 1
INTRODUCTION
NUMBER SYSTEMS AND CONVERSION
This chapter in the book includes:
Objectives
Study Guide
1.1 Digital Systems and Switching Circuits
1.2 Number Systems and Conversion
1.3 Binary Arithmetic
1.4 Representation of Negative Numbers
1.5 Binary Codes
Problems
Click the mouse to move to the next page.

Use the ESC key to exit this chapter.
©2010 Cengage Learning
Figure 1-1: Switching circuit

Decimal Notation
953.7810 = 9x102 + 5x101 + 3x100 + 7x10-1 + 8x10-2
Binary
1011.112 = 1x23 + 0x22 + 1x21 + 1x20 + 1x2-1 + 1x2-2
= 8 + 0 + 2 + 1 + 1/2 + 1/4
= 11.7510

EXAMPLE: Convert 5310 to binary.
Conversion (a)

EXAMPLE: Convert .62510 to binary.
Conversion (b)
EXAMPLE: Convert 0.710 to binary.
Conversion (c)
EXAMPLE: Convert 231.34 to base 7.
Conversion (d)
Binary  Hexadecimal
Conversion
Equation (1-1)
Conversion from binary to hexadecimal (and conversely) can

be done by inspection because each hexadecimal digit
corresponds to exactly four binary digits (bits).

Add 1310 and 1110 in binary.
Addition

The subtraction table for binary numbers is
0–0=0
0–1=1 and borrow 1 from the next column
1–0=1
1–1=0
Borrowing 1 from a column

is equivalent to subtracting 1 from that column.
Subtraction (a)

EXAMPLES OF BINARY SUBTRACTION:
Subtraction (b)

A detailed analysis of the borrowing process for this
example, indicating first a borrow of 1 from column 1 and
then a borrow of 1 from column 2, is as follows:
Subtraction (c) ©2010 Cengage Learning

The multiplication table for binary numbers is
0x0=0
0x1=0
1x0=0
1x1=1
Multiplication (a)

The following example illustrates
multiplication of 1310 by 1110 in binary:
Multiplication (b)
When doing binary multiplication, a common way to avoid
carries greater than 1 is to add in the partial products one at
a time as illustrated by the following example:
1111 multiplicand
1101 multiplier
1111 1st partial product
0000 2nd partial product
(01111) sum of first two partial products
1111 3rd partial product
(1001011) sum after adding 3rd partial product
1111 4th partial product
11000011 final product (sum after adding 4th
partial product)
Multiplication (c)
Binary Division
Binary division is similar to decimal division, except it
is much easier because the only two possible quotient
digits are 0 and 1.
We start division by comparing the divisor with the
upper bits of the dividend.
If we cannot subtract without getting a negative result,
we move one place to the right and try again.
If we can subtract, we place a 1 for the quotient above
the number we subtracted from and append the next
dividend bit to the end of the difference and repeat this
process with this modified difference until we run out
of bits in the dividend.

The following example illustrates
division of 14510 by 1110 in binary:
Binary Division

3 Systems for representing negative
numbers in binary
Sign & Magnitude: Most significant bit is the sign
Ex: – 510 = 11012
1’s Complement: = (2n – 1) - N

Ex: – 510 = (24 – 1) – 5 = 16 – 1 – 5 = 1010 = 10102
2’s Complement: N* = 2n - N
Ex: – 510 = 24 – 5 = 16 – 5 = 1110 = 10112
Section 1.4 (p. 16)

Table 1-1: Signed Binary Integers (word length n = 4)

2’s Complement Addition (a)
2’s Complement Addition (b)

2’s Complement Addition (c)

1’s Complement Addition (b)
1’s Complement Addition (c)
1’s Complement Addition (d)

2’s Complement Addition (d)

Binary Codes
Although most large computers work internally with

binary numbers, the input-output equipment generally
uses decimal numbers. Because most logic circuits
only accept two-valued signals, the decimal numbers
must be coded in terms of binary signals. In the
simplest form of binary code, each decimal digit is
replaced by its binary equivalent. For example, 937.25
is represented by:
Section 1.5 (p. 21)

Table 1–2. Binary Codes for Decimal Digits
8-4-2-1
Decimal 6-3-1-1 Excess-3 2-out-of-5 Gray
Code
Digit Code Code Code Code
(BCD)
0 0000 0000 0011 00011 0000
1 0001 0001 0100 00101 0001
2 0010 0011 0101 00110 0011
3 0011 0100 0110 01001 0010
4 0100 0101 0111 01010 0110
5 0101 0111 1000 01100 1110
6 0110 1000 1001 10001 1010
7 0111 1001 1010 10010 1011
8 1000 1011 1011 10100 1001
9 1001 1100 1100 11000 1000

Table 1-3
ASCII code
(incomplete)

Chapter 1

Uploaded by

Copyright:

Available Formats

Chapter 1

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Chapter 1

Uploaded by

Copyright:

Available Formats

SLIDES FOR

Click the mouse to move to the next page.

©2010 Cengage Learning

©2010 Cengage Learning

©2010 Cengage Learning

Conversion from binary to hexadecimal (and conversely) can

©2010 Cengage Learning

©2010 Cengage Learning

Borrowing 1 from a column

©2010 Cengage Learning

©2010 Cengage Learning

Subtraction (c) ©2010 Cengage Learning

©2010 Cengage Learning

©2010 Cengage Learning

©2010 Cengage Learning

1’s Complement: = (2n – 1) - N

Section 1.4 (p. 16)

©2010 Cengage Learning

©2010 Cengage Learning

©2010 Cengage Learning

©2010 Cengage Learning

©2010 Cengage Learning

Although most large computers work internally with

Section 1.5 (p. 21)

©2010 Cengage Learning

©2010 Cengage Learning

You might also like