Digital Logic Design

ELCT201
Spring 2023

Tutorial #1
Revision
1- Numbering representation
2- Basic Logic Gates
3- Boolean Algebra
 Outline

• Introduction to Digital Logic Design

• Basic Logic Gates
• Binary System
• Boolean Algebra
• Sheet 1

2
 Course Outline

Assessment Weight
Assignments 10%
Project 10%
Quizzes 10%
Midterm 25%
Final 45%

3
 Introduction

Digital Logic Design

Digital Circuits Logic Design

• Computers • Language => Binary system

• Smart phones • Building Block => Logic Gates
• Smart watches • Rules => Boolean Algebra
• Smart cars

4
 Digital Circuits

• Produce or respond to two distinct positive or negative voltage levels

representing either a logic level “1” or a logic level “0”

5
 Binary System

• Digital systems understand only two values 0 or 1

• Binary system  Base 2 or Radix 2
• Each digit is assigned a weight of powers of 2 Decimal Binary (4 Bits)
0 0000
2 1 0
1 0001
• Example: 101 => 22 *1+ 21 *0+ 20*1 = 5
22 2 1 2 0
2 0010
3 0011
4 0100

# of bits = 5 0101
6 0110
7 0111
8 1000
9 1001

6
 Binary Representation

Binary Numbers

Signed Numbers Unsigned Numbers

• Numbers can be positive or negative • Numbers can only be positive

How to Represent Signed Binary Numbers ? • Range : [0 - ]

1. Sign and Magnitude
• Example : n = 3
2. One’s Complement
3. Two’s Complement Range is [0 – 7]
Range : [- , ]

Eng. Heba Elhosary

7
 Problem I

Convert the following decimal numbers to binary:

• 27

• 43

8
 Problem II

Convert the following 2’s complement binary numbers to

decimal:
• 111101102

• 001010012

9
 Logic Design

• Logic Gates A 0110 1010

B 1010 1001
– AND function

A B Q
0 0 0
0 1 0
1 0 0
1 1 1
10
 Logic Design

• Logic Gates A 0110 1010

B 1010 1001
– OR function

A B Q
0 0 0
0 1 1
1 0 1
1 1 1
11
 Logic Design

• Logic Gates
– NOT function

A Q

0 1

1 0

12
 Logic Design

• Logic Gates A 0110 1010

B 1010 1001
– NAND function

A B Q
0 0 1
0 1 1
1 0 1
1 1 0

13
 Logic Design

• Logic Gates A 0110 1010

B 1010 1001
– NOR function

A B Q

0 0 1

0 1 0

1 0 0

1 1 0

14
 Logic Design

• Logic Gates A 0110 1010

B 1010 1001
– Exclusive-OR

A B Q

0 0 0

0 1 1

1 0 1

1 1 0

Q = AB’ + A’B
Q = 1, Only If there is an odd number of ones in the input combinations
15
 Logic Design

• Logic Gates A 0110 1010

B 1010 1001
– Exclusive-NOR

A B Q

0 0 1

0 1 0

1 0 0

1 1 1

Q = AB + A’B’

Q = 1, Only If there is an even number of ones in the input combinations

16
 Boolean Algebra

• Commutative Law
– A+B = B+A
– A.B = B.A
• Associative Law
– A + (B + C) = (A + B) + C = A + B + C (OR Associate Law)
– A(B.C) = (A.B)C = A . B . C (AND Associate Law)
• Distributive Law
– A(B + C) = A.B + A.C (OR Distributive Law)
– A + (B.C) = (A + B).(A + C) (AND Distributive Law)
• DE Morgan's Law
– (Nor = Not-And)
– (NAND = Not-OR)

17
Boolean Algebra

18
Boolean Algebra

19
 Sheet 1

• Problem III:
Simplify the following Boolean expressions to a minimum number of
literals
a) A’BC + ABC’ + ABC + A’BC’
b) XZ + X’Y + YZ
c) (X’Y’ + Z’)’ +Z + XY + WZ
d) A’B (D’ + C’D) + B (A + A’CD)

20
 Sheet 1

• Problem V:
– Find the complement of the following expressions
a) XY’ + X’Y
b) (a + c) (a + b’) (a’ + b + c’)

21
 Sheet 1

• Problem VI:
– List the truth table of the function:
a) F = XY + XY’ + Y’Z (Sum of Products)
b) F = (B + C).( A’ + C’) (Product Of Sums)
F
0
1
2
3
4
5
6
7

22
 Sheet 1

• Problem VIII:
– Write Boolean expressions and construct the truth tables describing the
outputs of the circuits shown in the logic diagrams in Fig. 1.

23
Thank
You

24