Scribd
Upload
13 views

Lecture # 4C - Boolean Algebra and Logic Simplification Final Version

Uploaded by

Hasnain Nisar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

Lecture # 4C - Boolean Algebra and Logic Simplification Final Version

Uploaded by

Hasnain Nisar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 21

DEPARTMENT OF COMPUTER SCIENCE &

INFORMATION TECHNOLOGY

Logic Design & Switching Theory

Course Code: CS-251


Semester: Spring 2020
Teacher Name: Talha Akhtar
Course Contents
Introduction of Subject
1. Digital fundamentals and Analog Quantities
2. Basic Logic Function & Boolean Algebra
3. Numbers Systems, Operations and Codes
4. Logic Gates
5. Fundamental Theorems of Boolean Algebra
6. Minimization of Boolean Functions
7. Karnaugh map
8. Simplification of Boolean Functions, POS
9. Function of Combinational Logic
10.Latshes, Flip-Flops, and Timmer
Boolean Algebra
Boolean algebra is a convenient and systematic way of expressing
and analyzing the operation of logic circuits.

Boolean algebra is the mathematics of digital logic.

A variable is a italic uppercase letter or word used to represent


action.
Any single variable can have only a 1 or 0.
The complement of the variable A is 𝐴 if A = 0 then 𝐴 = 1
A literal is a variable or the complement of a variable.
The Karnaugh Map
A Karnaugh map provides a systematic method for simplifying
Boolean expression and, if properly used, will produce the simplest
SOP or POS expression possible, known as the minimum
expression.
It is similar to the truth table because it present all possible values
of input variables and resulting output for each value.
It is an array of cell in which cell is binary value of input variable.

N = 3 -> number of cell is 8


N = 4 -> number of cell is 16
The Karnaugh Map
The 3-Variable Karnaugh Map
C
AB 0 1
00
01
11
10
C
AB 0 1
00 𝐴𝐵𝐶 𝐴𝐵C
01 𝐴B𝐶 𝐴BC
11 AB𝐶 ABC
10 A𝐵𝐶 A𝐵C
The Karnaugh Map
The 4-Variable Karnaugh Map

CD

AB 00 01 11 10
00 0 1 3 2
01 4 5 7 6
11 12 13 15 14
10 8 9 11 10

N=6
Cell = 16
The Karnaugh Map
Karnaugh Map SOP Minimization
C
AB 0 1
00 1 1
01
11 1
10 1

𝐴𝐵𝐶 + 𝐴𝐵C + AB𝐶 + A𝐵𝐶

000 001 110 100


The Karnaugh Map
Karnaugh Map SOP Minimization

𝐴𝐵C + 𝐴B𝐶 + AB𝐶 + ABC


001 010 110 111
C
AB 0 1
00 1
01 1
11 1 1
10
The Karnaugh Map
Karnaugh Map POS Minimization
C
AB 0 1
00 0
01 0
11 0
10 0

(A + B + C) (A + 𝐵 + C) (𝐴 + 𝐵 + C) (𝐴 + B +𝐶)
000 010 110 101
The Karnaugh Map
Karnaugh Map POS Minimization
Map the following standard POS expression on a Karnaugh map:

(𝐴 + 𝐵 + C + D)(𝐴 + B + 𝐶 + 𝐷) (A + B + 𝐶 + D) (𝐴 + 𝐵 + 𝐶 + 𝐷) (A + B + 𝐶 + 𝐷)
Solution
(𝐴 + 𝐵 + C + D)(𝐴 + B + 𝐶 + 𝐷) (A + B + 𝐶 + D) (𝐴 + 𝐵 + 𝐶 + 𝐷) (A + B + 𝐶 + 𝐷)
1100 1011 0010 1111 0011
CD
AB 00 01 11 10
00 0 0
01
11 0 0
10 0
The Karnaugh Map
Karnaugh Grouping 1’s
1. 𝐴𝐶+AC
2. 𝐵𝐶
3. 𝐵
4. 𝐴
5. B
6. 𝐵C
The Karnaugh Map

Karnaugh Grouping 1’s


W𝑌+W𝑋Z+𝑋Y𝑍
The Karnaugh Map

Karnaugh Grouping 1’s


X= 𝐶 𝐸 + C E
The Karnaugh Map
Karnaugh Grouping 0’s
(Y + Z)(𝑋 + 𝑌)
The Karnaugh Map
Karnaugh Grouping 0’s

(A + B + C)(A + 𝐵 + C)(𝐵 + 𝐶)
The Karnaugh Map
Karnaugh Grouping 0’s

(A+ B+𝐶)(A + 𝐵 + 𝐷)(𝐴 + 𝐶 + D)(𝐴 + 𝐵 + C)


The Karnaugh Map
Karnaugh MAP SOP Minimization

Solve by K- Map 𝐴 𝐵 𝐶 + 𝐴 𝐵 C + A 𝐵 C
The Karnaugh Map
Karnaugh MAP POS Minimization

(A + B + C)(𝐴 + 𝐵 + 𝐶)(A+ 𝐵 + C)
The Karnaugh Map
Apply Karnaugh MAP SOP Minimization

Sum(2,3, 5,7,9,12,13,15)
The Karnaugh Map
Apply Karnaugh MAP SOP and POS Minimization of desired table.

A B C Y
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 0
END

Q/A

You might also like