[go: up one dir, main page]
Scribd
Upload
112 views5 pages

K Map

The document provides an overview of Karnaugh maps (K-Maps) for simplifying logic circuit problems without using Boolean algebra. It includes methods for converting truth tables to K-Maps, grouping techniques (pairs, quads, octets), and simplification methods (Sum-of-Products and Products-of-Sum). Additionally, it discusses applications of K-Maps in solving logic problems, designing voting machines, and detecting race conditions.

Uploaded by

2021ee2so
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
112 views5 pages

K Map

The document provides an overview of Karnaugh maps (K-Maps) for simplifying logic circuit problems without using Boolean algebra. It includes methods for converting truth tables to K-Maps, grouping techniques (pairs, quads, octets), and simplification methods (Sum-of-Products and Products-of-Sum). Additionally, it discusses applications of K-Maps in solving logic problems, designing voting machines, and detecting race conditions.

Uploaded by

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

K-Map

Content:
1. Truth table to Karnaugh map,
2. Pair quads and Octets,
3. Sum-of-Products method,
4. Products-of-Sum method.

K-Map :- It is the systematic procedure to solve the logic circuit problems without understanding the concepts of

Boolean algebra.
Truth table to Karnaugh map, and 2,3,4 Variables CD
00 01 11 10
AB
BC
B
0 1 00 01 11 10 00 A’B’C’D’ A’B’C’D A’B’CD A’B’CD’
A A
0 A’ B’ A’ B 0 A’ B’ C’ A’ B’ C A’ B C A’ B C’ 01 A’BC’D’ A’BC’D A’BCD A’BCD’
A B’ A BAB
1 1 A B’ C’ A B’ C ABC A B C’ 11 ABC’D’ ABC’D ABCD ABCD’

Cell 10 AB’C’D’ AB’C’D AB’CD AB’CD’

Pairs, quads, and octets


Number of cells = 2^n, where n is number of variables.

00 01 11 10
00 0 1 3 2

01
4 5 7 6

11
12 13 15 14

10 8 9 11 10
Rules for grouping.
1. 1’s and 0’s are not grouped.
2. 1’s are not grouped diagonally.
3. Maximum number of 1’s are taken at a time.
3. For pair two 1’s are present adjacently or even at end of the matrix.
4. For quads four 1’s should be present adjacently.
5. For octet eight 1’s should be present adjacently.

Sum-of-Product simplification (SOP)


C
For this 1’s taken in consideration.
AB 0 1
1 1
00
A’ B’ C’ + A’ B’ C + A B C’ + A B’ C’
01
1
11

1
10
*0 = A’
*1 = A
Product-of-Sum simplification
C
(POS)
For this 0’s taken in consideration. 0 1
AB
0
00
( A + B + C )( A + B’ + C )( A’ + B’ + C )( A’ + B + C’ ) 0
01
0
11
0
10
*0 = A
*1 = A’
Applications.
1. It simplify to solve logic circuit problems.
2. It used to design VOTING MACHINE.
3. Karnaugh maps are useful for detecting and eliminating race conditions.

References
1. My notes,
2. Nptel sources materials,
3. Electronic Circuits( Discrete And Integrated) by Donald L. Schilling Charles Belove.

Thankyou.
Sourabh Sahu
0901EE211118.

You might also like