Scribd
Upload
17 views15 pages

Boolean Operations Part C

This document discusses Boolean operations and simplifying combinational logic circuits using Boolean laws and Karnaugh maps. It introduces Karnaugh maps as a systematic method to simplify Boolean expressions or truth tables. Key aspects covered include looping pairs, quads, and octets of 1s in a K-map to eliminate variables. Examples are provided to simplify Boolean equations using K-maps. Exercises are included to minimize Boolean expressions using K-maps. References for further reading are also provided.

Uploaded by

Aiman Syazani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
17 views15 pages

Boolean Operations Part C

This document discusses Boolean operations and simplifying combinational logic circuits using Boolean laws and Karnaugh maps. It introduces Karnaugh maps as a systematic method to simplify Boolean expressions or truth tables. Key aspects covered include looping pairs, quads, and octets of 1s in a K-map to eliminate variables. Examples are provided to simplify Boolean equations using K-maps. Exercises are included to minimize Boolean expressions using K-maps. References for further reading are also provided.

Uploaded by

Aiman Syazani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 15

CHAPTER 2 :

BOOLEAN OPERATIONS
Part C
2.4 Simplify combinational Logic
Circuits using:
a. Boolean Laws
( Already Discuss in Part B notes)
b. Karnough Map
Review:Boolean Simplification
Question: Using Boolean Rules/Laws/De Morgan
Theorem, simplify the expression below:

a. Y = AC (A B D) + A B C D + A B C (5m)

b. Y = ABC (BD + CDE) + AC (5m)


KARNAUGH MAP
 Provides a systematic method for
simplifying a Boolean expression or a
truth table function
 The K-map is a table consisting of N = 2n
cells, where n is the number of input
variables.
 The table format is such that there is a
single variable change between any
adjacent cells
Two variables K-map with
assume A and B as variable

Three variable K-map with


assume A, B and C as variable
 Looping
1. Looping of PAIR/TWO
 Looping a PAIR of adjacent 1s in a K-map
eliminates the variable that appears in
complemented and uncomplemented form
2. Looping group of FOUR/QUAD
 Looping a QUAD of adjacent 1s eliminate the two
variables that appear in both complemented and
uncomplemented form
3. Looping group of EIGHT/OCTET
 Looping an OCTET of adjacent 1s eliminates the
three variables that appear in the both
complemented and uncomplemented form
 Examples
Simplify this Boolean equation by using K-maps
F = X Y Z+ X Y Z + X Y Z
 Examples
Find out the equation based on the given
 Solution
More Exercises in K-Map
Question:
Use a K-map to minimize the following SOP
Boolean Expression

a. A B C + A B C + A B C + A B C + A B C

b. A B C D + A B C D + A B C D + A B C D + A B C D +
ABCD+ABCD+ABCD+ABCD

c. C ( A B + B ) + A B C + A B
 Discuss the answer with your lecturer.
 Do exercises in Tutorials.

END OF CHAPTER 2
REFERENCES: ]

1. "Digital Systems Principles And Application"


Sixth Editon, Ronald J. Tocci.

2. "Digital Systems Fundamentals"


P.W Chandana Prasad, Lau Siong Hoe,
Dr. Ashutosh Kumar Singh, Muhammad Suryanata.

Download Tutorials Chapter 2: Boolean Operations


@ CIDOS
http://www.cidos.edu.my

You might also like