Outline of Chapter 1

1.1 Digital Systems 1.2 Binary Numbers

1.3 Number-base Conversions

1.4 Octal and Hexadecimal Numbers 1.5 Complements 1.6 Signed Binary Numbers 1.7 Binary Codes 1.8 Binary Storage and Registers 1.9 Binary Logic

Digital Logic Design Ch1-1

Digital Systems and Binary Numbers

Digital age and information age Digital computers

General purposes Many scientific, industrial and commercial applications Telephone switching exchanges Digital camera Electronic calculators, PDA's Digital TV

Digital systems

Discrete information-processing systems

Manipulate discrete elements of information For example, {1, 2, 3, } and {A, B, C, }

Digital Logic Design Ch1-2

Analog and Digital Signal

Analog system

The physical quantities or signals may vary continuously over a specified range. The physical quantities or signals can assume only discrete values. Greater accuracy X(t) X(t)

Digital system

t
Analog signal Digital signal

t
Digital Logic Design Ch1-3

Binary Digital Signal

An information variable represented by physical quantity. For digital systems, the variable takes on discrete values.

Two level, or binary values are the most prevalent values. Digits 0 and 1 Words (symbols) False (F) and True (T) Words (symbols) Low (L) and High (H) And words On and Off

Binary values are represented abstractly by:

V(t)

Logic 1
undefine Logic 0

Binary values are represented by values

or ranges of values of physical quantities.

t
Binary digital signal
Digital Logic Design Ch1-4

Decimal Number System

Base (also called radix) = 10

10 digits { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } Integer & fraction Weight = (Base) Position

100 10 1 0.1 0.01

Digit Position

-1

-2

Digit Weight

5 1 2

7 4

Magnitude

Sum of Digit x Weight

500 10 2 0.7 0.04

Formal Notation
d2*B2+d1*B1+d0*B0+d-1*B-1+d-2*B-2

(512.74)10
Digital Logic Design Ch1-5

Octal Number System

Base = 8

8 digits { 0, 1, 2, 3, 4, 5, 6, 7 } Weight = (Base) Position Sum of Digit x Weight

64 8 1 1/8 1/64

Weights

Magnitude

5 1 2
2 1 0

7 4
-1 -2

Formal Notation

5 *82+1 *81+2 *80+7 *8-1+4 *82

=(330.9375)10 (512.74)8

Digital Logic Design Ch1-6

Binary Number System

Base = 2

2 digits { 0, 1 }, called binary digits or bits

Weights

Weight = (Base) Position

Sum of Bit x Weight

1/2 1/4

Magnitude

1 0 1
2 1 0

0 1
-1 -2

Formal Notation Groups of bits

4 bits = Nibble 8 bits = Byte

1 *22+0 *21+1 *20+0 *2-1+1 *22

=(5.25)10 (101.01)2

1011
11000101
Digital Logic Design Ch1-7

Hexadecimal Number System

Base = 16

16 digits { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F } Weight = (Base) Position Sum of Digit x Weight

256 16 1
1/16 1/256

Weights

Magnitude

1 E 5
2 1 0

7 A
-1 -2

Formal Notation

1 *162+14 *161+5 *160+7 *16-1+10 *16-2

=(485.4765625)10

(1E5.7A)16

Digital Logic Design Ch1-8

The Power of 2
n 0 1 2n 20=1 21=2 n 8 9 2n 28=256 29=512

2
3 4 5

22=4
23=8 24=16 25=32

10
11 12 20

210=1024
211=2048 212=4096 220=1M

Kilo

Mega Giga Tera

6
7

26=64
27=128

30
40

230=1G
240=1T

Digital Logic Design Ch1-9

Addition
Decimal Addition

1 + 1

1 5 5 1 5 5 0

Carry

= Ten Base Subtract a Base

Digital Logic Design Ch1-10

Binary Addition
Column Addition

1 +

1
1

1
0

1
1

0
1

1
1

= 61 = 23 = 84

(2)10

Digital Logic Design Ch1-11

Binary Subtraction
Borrow a Base when needed

0 1 0

1 2
0

2
2 0 1 0 1 0 0 0 1 1 1 2 0 1 1 1 1 0

= (10)2
= 77 = 23 = 54

Digital Logic Design Ch1-12

Binary Multiplication
Bit by bit

1
x

0
1

1
0

1
1

1
0

0
1 0 0 0 0

0
1 0

0
1 0

0
1

1 1

0 1

1 1

1 0

1 0 1 1 0
Digital Logic Design Ch1-13

Number Base Conversions

Evaluate Magnitude

Octal (Base 8)
Evaluate Magnitude

Decimal (Base 10)

Binary (Base 2)

Hexadecimal (Base 16)

Evaluate Magnitude
Digital Logic Design Ch1-14

Decimal (Integer) to Binary Conversion

Divide the number by the Base (=2) Take the remainder (either 0 or 1) as a coefficient

Take the quotient and repeat the division

Example: (13)10
Quotient Remainder

Coefficient

13 / 2 = 6 /2= 3 /2= 1 /2=

Answer:

6 3 1 0

1 0 1 1

a0 = 1 a1 = 0 a2 = 1 a3 = 1

(13)10 = (a3 a2 a1 a0)2 = (1101)2

MSB LSB
Digital Logic Design Ch1-15

Decimal (Fraction) to Binary Conversion

Multiply the number by the Base (=2) Take the integer (either 0 or 1) as a coefficient

Take the resultant fraction and repeat the division

Example: (0.625)10
Integer Fraction

Coefficient

0.625 * 2 = 0.25 * 2 = 0.5 *2=

Answer:

1 0 1

. . .

25 5 0

a-1 = 1 a-2 = 0 a-3 = 1

(0.625)10 = (0.a-1 a-2 a-3)2 = (0.101)2

MSB LSB
Digital Logic Design Ch1-16

Decimal to Octal Conversion

Example: (175)10
Quotient Remainder Coefficient

175 / 8 = 21 / 8 = 2 /8=

21 2 0

7 5 2

a0 = 7 a1 = 5 a2 = 2

Answer:

(175)10 = (a2 a1 a0)8 = (257)8

Example: (0.3125)10
Integer Fraction Coefficient

0.3125 * 8 = 2 0.5 *8= 4

Answer:

. .

5 0

a-1 = 2 a-2 = 4

(0.3125)10 = (0.a-1 a-2 a-3)8 = (0.24)8

Digital Logic Design Ch1-17

Binary Octal Conversion

8 = 23 Each group of 3 bits represents an octal
Octal 0 1 2
Assume Zeros

Binary 000 001 010 011 100 101 110 111

digit Example:

3 4 5 6

( 1 0 1 1 0 . 0 1 )2

( 2

. 2 )8

Works both ways (Binary to Octal & Octal to Binary)

Digital Logic Design Ch1-18

Binary Hexadecimal Conversion

16 =

24

Hex
0 1 2 3 4 5 6 7 8 9 A B C D E F

Binary
0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111

Each group of 4 bits represents a

hexadecimal digit Example:

Assume Zeros

( 1 0 1 1 0 . 0 1 )2

(1

. 4 )16

Works both ways (Binary to Hex & Hex to Binary)

Digital Logic Design Ch1-19

Octal Hexadecimal Conversion

Convert to Binary as an intermediate step

Example:

( 2
Assume Zeros

2 )8
Assume Zeros

( 0 1 0 1 1 0 . 0 1 0 )2

(1

4 )16

Works both ways (Octal to Hex & Hex to Octal)

Digital Logic Design Ch1-20

Decimal, Binary, Octal and Hexadecimal

Decimal
00 01 02 03 04 05 06 07 08 09 10 11 12 13 14 15

Binary
0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111

Octal
00 01 02 03 04 05 06 07 10 11 12 13 14 15 16 17

Hex
0 1 2 3 4 5 6 7 8 9 A B C D E F

Digital Logic Design Ch1-21

1.5 Complements
There are two types of complements for each base-r system: the radix complement and

diminished radix complement. Diminished Radix Complement - (r-1)s Complement

Given a number N in base r having n digits, the (r1)s complement of N is defined as:

(rn 1) N
Example for 6-digit decimal numbers:

9s complement is (rn 1)N = (1061)N = 999999N 9s complement of 546700 is 999999546700 = 453299 1s complement is (rn 1) N = (271)N = 1111111N 1s complement of 1011000 is 11111111011000 = 0100111 Subtraction from (rn 1) will never require a borrow Diminished radix complement can be computed digit-by-digit For binary: 1 0 = 1 and 1 1 = 0 Digital Logic Design Ch1-22

Example for 7-digit binary numbers:

Observation:

Complements
1s Complement (Diminished Radix Complement)
All 0s become 1s All 1s become 0s Example (10110000)2 (01001111)2 If you add a number and its 1s complement

10110000 + 01001111 11111111

Digital Logic Design Ch1-23

Complements
Radix Complement
The r's complement of an n-digit number N in base r is defined as rn N for N 0 and as 0 for N = 0. Comparing with the (r 1) 's complement, we note that the r's complement is obtained by adding 1 to the (r 1) 's complement, since rn N = [(rn 1) N] + 1.

Example: Base-10
The 10's complement of 012398 is 987602 The 10's complement of 246700 is 753300

Example: Base-2
The 2's complement of 1101100 is 0010100 The 2's complement of 0110111 is 1001001
Digital Logic Design Ch1-24

Complements
2s Complement (Radix Complement)
Take 1s complement then add 1 OR Toggle all bits to the left of the first 1 from the right Example: Number: 1s Comp.:

10110000

10110000

01001111
+ 1 01010000 01010000

Digital Logic Design Ch1-25

Complements
Subtraction with Complements

The subtraction of two n-digit unsigned numbers M N in base r can be done as follows:

Digital Logic Design Ch1-26

Complements
Example 1.5

Using 10's complement, subtract 72532 3250.

Example 1.6

Using 10's complement, subtract 3250 72532. There is no end carry.

Therefore, the answer is (10's complement of 30718) = 69282.
Digital Logic Design Ch1-27

Complements
Example 1.7

Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a) X Y ; and (b) Y X, by using 2's complement.

There is no end carry. Therefore, the answer is Y X = (2's complement of 1101111) = 0010001.
Digital Logic Design Ch1-28

Complements
Subtraction of unsigned numbers can also be done by means of the (r 1)'s

complement. Remember that the (r 1) 's complement is one less then the r's complement. Example 1.8

Repeat Example 1.7, but this time using 1's complement.

There is no end carry, Therefore, the answer is Y X = (1's complement of 1101110) = 0010001.
Digital Logic Design Ch1-29

1.6 Signed Binary Numbers

To represent negative integers, we need a notation for negative

values. It is customary to represent the sign with a bit placed in the leftmost position of the number since binary digits. The convention is to make the sign bit 0 for positive and 1 for negative. Example:

Table 1.3 lists all possible four-bit signed binary numbers in the

three representations.

Digital Logic Design Ch1-30

Signed Binary Numbers

Digital Logic Design Ch1-31

Signed Binary Numbers

Arithmetic addition The addition of two numbers in the signed-magnitude system follows the rules of ordinary arithmetic. If the signs are the same, we add the two magnitudes and give the sum the common sign. If the signs are different, we subtract the smaller magnitude from the larger and give the difference the sign if the larger magnitude. The addition of two signed binary numbers with negative numbers represented in signed-2's-complement form is obtained from the addition of the two numbers, including their sign bits. A carry out of the sign-bit position is discarded. Example:

Digital Logic Design Ch1-32

Signed Binary Numbers

Arithmetic Subtraction

In 2s-complement form:

1.
2.

Take the 2s complement of the subtrahend (including the sign bit) and add it to the minuend (including sign bit). A carry out of sign-bit position is discarded.

( A) ( B ) ( A) ( B ) ( A) ( B ) ( A) ( B )
Example:
( 6) ( 13) (11111010 11110011) (11111010 + 00001101) 00000111 (+ 7)
Digital Logic Design Ch1-33

1.7 Binary Codes

BCD Code

A number with k decimal digits will require 4k bits in BCD. Decimal 396 is represented in BCD with 12bits as 0011 1001 0110, with each group of 4 bits representing one decimal digit. A decimal number in BCD is the same as its equivalent binary number only when the number is between 0 and 9. The binary combinations 1010 through 1111 are not used and have no meaning in BCD.

Digital Logic Design Ch1-34

Binary Code
Example:

Consider decimal 185 and its corresponding value in BCD and binary:

BCD addition

Digital Logic Design Ch1-35

Binary Code
Example:

Consider the addition of 184 + 576 = 760 in BCD:

Decimal Arithmetic: (+375) + (-240) = +135

Hint 6: using 10s of BCD

Digital Logic Design Ch1-36

Binary Codes
Other Decimal Codes

Digital Logic Design Ch1-37

Binary Codes)
Gray Code

The advantage is that only bit in the code group changes in going from one number to the next.
Error detection. Representation of analog data. Low power design.

000 001

010 100

011 101

110

111

1-1 and onto!!

Digital Logic Design Ch1-38

Binary Codes
American Standard Code for Information Interchange (ASCII) Character Code

Digital Logic Design Ch1-39

Binary Codes
ASCII Character Code

Digital Logic Design Ch1-40

1.9 Binary Logic

Definition of Binary Logic Binary logic consists of binary variables and a set of logical operations. The variables are designated by letters of the alphabet, such as A, B, C, x, y, z, etc, with each variable having two and only two distinct possible values: 1 and 0, Three basic logical operations: AND, OR, and NOT.

Digital Logic Design Ch1-41

Binary Logic
Truth Tables, Boolean Expressions, and Logic Gates

AND
x 0 0 1 1 y 0 1 0 1 z 0 0 0 1 x 0 0 1 1

OR
y 0 1 0 1 z 0 1 1 1

NOT
x 0 1 z 1 0

z=xy=xy

z=x+y

z = x = x

x y

x y

Digital Logic Design Ch1-42

Switching Circuits
AND OR

Digital Logic Design Ch1-43

Binary Logic
Logic gates

Example of binary signals

3 Logic 1 2 Un-define 1 0

Logic 0

Figure 1.3 Example of binary signals

Digital Logic Design Ch1-44

Binary Logic
Logic gates

Graphic Symbols and Input-Output Signals for Logic gates:

Fig. 1.4 Symbols for digital logic circuits

Fig. 1.5 Input-Output signals for gates

Digital Logic Design Ch1-45

Binary Logic
Logic gates

Graphic Symbols and Input-Output Signals for Logic gates:

Fig. 1.6 Gates with multiple inputs

Digital Logic Design Ch1-46