Digital Logic Design I (EE360)

CHAPTER 1
DIGITAL SYSTEMS AND BINARY NUMBERS
1
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

2
 ANALOG AND DIGITAL SIGNAL
 Analog system
 The physical quantities or signals may vary
continuously over a specified range.
 Digital system
 The physical quantities or signals can assume only
discrete values. X(t)
X(t)
 Greater accuracy

t t
Analog signal Digital signal 3
BINARY NUMBER SYSTEM
 Base = 2
2 digits { 0, 1 }, called binary digits or “bits”
 Weights 4 2 1 1/2 1/4
Position
 Weight = (Base) 1 0 1 0 1
 Magnitude 2 1 0 -1 -2
1 *22+0 *21+1 *20+0 *2-1+1 *2-2
 Sum of “Bit x Weight”
=(5.25)10
 Formal Notation
(101.01)2
 Groups of bits 4 bits = Nibble
1011
8 bits = Byte
11000101
4
DECIMAL NUMBER SYSTEM
 Base (also called radix) = 10
 10 digits { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }
 Digit Position 2 1 0 -1 -2

 Integer & fraction 5 1 2 7 4

 Digit Weight 100 10 1 0.1 0.01
Position
 Weight = (Base)
 Magnitude
500 10 2 0.7 0.04
 Sum of “Digit x Weight”
d2*B2+d1*B1+d0*B0+d-1*B-1+d-2*B-2
 Formal Notation
(512.74)10
5
OCTAL NUMBER SYSTEM
 Base = 8
8 digits { 0, 1, 2, 3, 4, 5, 6, 7 }
 Weights 64 8 1 1/8 1/64
Position
 Weight = (Base) 5 1 2 7 4
 Magnitude 2 1 0 -1 -2
5 *82+1 *81+2 *80+7 *8-1+4 *8-2
 Sum of “Digit x Weight”
=(330.9375)10
 Formal Notation
(512.74)8

6
HEXADECIMAL NUMBER SYSTEM
 Base = 16
 16 digits { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F }
 Weights 256 16 1 1/16 1/256

Position
 Weight = (Base) 1 E 5 7 A
 Magnitude 2 1 0 -1 -2
1 *162+14 *161+5 *160+7 *16-1+10 *16-2
 Sum of “Digit x Weight”
=(485.4765625)10
 Formal Notation
(1E5.7A)16

7
THE POWER OF 2
n 2n n 2n
0 20=1 8 28=256
1 21=2 9 29=512
2 22=4 10 210=1024 Kilo

3 23=8 11 211=2048
4 24=16 12 212=4096
5 25=32 20 220=1M Mega

6 26=64 30 230=1G Giga

7 27=128 40 240=1T Tera

8
ADDITION
 Decimal Addition
1 1 Carry
5 5
+ 5 5

1 1 0
= Ten ≥ Base
 Subtract a Base

9
BINARY ADDITION
 Column Addition

1 1 1 1 1 1
1 1 1 1 0 1 = 61
+ 1 0 1 1 1 = 23

1 0 1 0 1 0 0 = 84

≥ (2)10

10
BINARY SUBTRACTION
 Borrow a “Base” when needed
1 2 = (10)2
0 2 2 0 0 2
1 0 0 1 1 0 1 = 77
− 1 0 1 1 1 = 23

0 1 1 0 1 1 0 = 54

11
BINARY MULTIPLICATION
 Bit by bit
1 0 1 1 1
x 1 0 1 0
0 0 0 0 0
1 0 1 1 1
0 0 0 0 0
1 0 1 1 1

1 1 1 0 0 1 1 0

12
NUMBER BASE CONVERSIONS
Evaluate
Magnitude
Octal
(Base 8)

Evaluate
Magnitude
Decimal Binary
(Base 10) (Base 2)

Hexadecimal
(Base 16)
Evaluate
Magnitude 13
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 1 a0 = 1
6 /2= 3 0 a1 = 0
3 /2= 1 1 a2 = 1
1 /2= 0 1 a3 = 1
Answer: (13)10 = (a3 a2 a1 a0)2 = (1101)2

MSB LSB
14
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 = 1 . 25 a-1 = 1
0.25 * 2 = 0 . 5 a-2 = 0
0.5 *2= 1 . 0 a-3 = 1
Answer: (0.625)10 = (0.a-1 a-2 a-3)2 = (0.101)2

MSB LSB

15
DECIMAL TO OCTAL CONVERSION
Example: (175)10
Quotient Remainder Coefficient
175 / 8 = 21 7 a0 = 7
21 / 8 = 2 5 a1 = 5
2 /8= 0 2 a2 = 2
Answer: (175)10 = (a2 a1 a0)8 = (257)8

Example: (0.3125)10
Integer Fraction Coefficient
0.3125 * 8 = 2 . 5 a-1 = 2
0.5 *8= 4 . 0 a-2 = 4
Answer: (0.3125)10 = (0.a-1 a-2 a-3)8 = (0.24)8

16
BINARY − OCTAL CONVERSION
Octal Binary
 8= 23
0 000
 Each group of 3 bits
1 001
represents an octal digit 2 010
Assume Zeros
Example: 3 011

( 1 0 1 1 0 . 0 1 )2 4 100
5 101
6 110
( 2 6 . 2 )8 7 111

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

17
BINARY − HEXADECIMAL CONVERSION
Hex Binary
 16 = 24 0
1
0000
0001

 Each group of 4 bits

2 0010
3 0011
represents a hexadecimal 4
5
0100
0101
digit Assume Zeros 6 0110
7 0111
Example: 8 1000
( 1 0 1 1 0 . 0 1 )2 9 1001
A 1010
B 1011
C 1100
D 1101
(1 6 . 4 )16 E 1110
F 1111

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

18
OCTAL − HEXADECIMAL CONVERSION
 Convert to Binary as an intermediate step
Example:
( 2 6 . 2 )8

Assume Zeros Assume Zeros

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

(1 6 . 4 )16

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

19
DECIMAL, BINARY, OCTAL AND HEXADECIMAL
Decimal Binary Octal Hex
00 0000 00 0
01 0001 01 1
02 0010 02 2
03 0011 03 3
04 0100 04 4
05 0101 05 5
06 0110 06 6
07 0111 07 7
08 1000 10 8
09 1001 11 9
10 1010 12 A
11 1011 13 B
12 1100 14 C
13 1101 15 D
14 1110 16 E
15 1111 17 F

20
1.5 COMPLEMENTS
It is used to simplify subtraction operation , which leads to simpler and less expensive circuits.
There are two types of complements for each base-r system:
1. diminished radix complement (9th,1st )

2. the radix complement. (10th ,2nd )

 Diminished Radix Complement - (r-1)’s Complement

 Given a number N in base r having n digits, the (r–1)’s complement

of N is defined as:
(rn –1) – N
 Example for 6-digit decimal numbers:

 9’s complement is (rn – 1)–N = (106–1)–N = 999999–N

 9’s complement of 546700 is 999999–546700 = 453299
 Example for 7-digit binary numbers:

 1’s complement is (rn – 1) – N = (27–1)–N = 1111111–N

 1’s complement of 1011000 is 1111111–1011000 = 0100111 21
COMPLEMENTS
 1’s Complement (Diminished Radix
Complement)
 All ‘0’s become ‘1’s
 All ‘1’s become ‘0’s

Example (10110000)2
 (01001111)2
If you add a number and its 1’s complement …
10110000
+ 01001111
11111111
22
COMPLEMENTS

 Radix Complement (r’s Complement)

rn – N = [(rn  1) – N] + 1.
Ex(1)
The 10's complement of 012398
(106 -1)-012398+1
 Example: Base-10 =999999-012398+1=987601+1= 987602
Ex(2)
The 10's complement of 246700 is 753300
The 2's complement of 1101100 is 0010100
27-1101100=10000000-1101100=0010100
1111111-1101100+1=0010100
 Example: Base-2 The 2's complement of 0110111 is 1001001

23
COMPLEMENTS
 2’s Complement (Radix Complement)
 Take 1’s complement then add 1
OR
 Toggle all bits to the left of the first ‘1’ from the
right
Example: 1 0 1 1 0 0 0 0 10110000
Number:
01001111
1’s Comp.:
+ 1
01010000 01010000

24
COMPLEMENTS

 Subtraction with Complements

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

25
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.

26
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.

27
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.
28
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:

29
SIGNED BINARY NUMBERS

30
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:

-0000111 -00010011
-2’s complement -2’s complement
Discard the carry 31
1.7 BINARY CODES
 BCD Code
 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. 32
BINARY CODES

 Other Decimal Codes

33
BINARY CODES) 000 001

 Gray Code 010 011

101
 The advantage is that
100

only bit in the code

group changes in going 110 111

from one number to the

next.
 Error detection.
 Representation of analog
data.
 Low power design.

34
ASCII CHARACTER CODES

 American Standard Code for Information Interchange (Refer to

Table 1.7)
 A popular code used to represent information sent as character-
based data.
 It uses 7-bits to represent:
 94 Graphic printing characters.
 34 Non-printing characters.

35
BINARY CODES
 American Standard Code for Information Interchange (ASCII) Character Code

36
BINARY CODES

 Error-Detecting Code
 To detect errors in data communication and processing, an eighth bit is
sometimes added to the ASCII character to indicate its parity.
 A parity bit is an extra bit included with a message to make the total
number of 1's either even or odd.
 Example:
 Consider the following two characters and their even and odd parity:

37
BINARY LOGIC
 Truth Tables, Boolean Expressions, and Logic Gates

AND OR NOT
x y z x y z x z
0 0 0 0 0 0 0 1
0 1 0 0 1 1 1 0
1 0 0 1 0 1
1 1 1 1 1 1

z=x•y=xy z=x+y z = x = x’

x x x
y z y z z
SWITCHING CIRCUITS

AND OR

39
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 40

BINARY LOGIC

 Logic gates
 Graphic Symbols and Input-Output Signals for Logic gates:

Fig. 1.6 Gates with multiple inputs

41