SlideShare une entreprise Scribd logo
1  sur  32
KARNAU
GH
MAP
CONTENTS
 Introduction.
 Advantages of Karnaugh Maps.
 SOP & POS.
 Properties.
 Simplification Process
 Different Types of K-maps
 Simplyfing logic expression by different types of K-Map
 Don’t care conditions
 Prime Implicants
 References.
 Also known as Veitch diagram or K-Map.
 Invented in 1953 by
Maurice Karnaugh.
 A graphical way of
minimizing Boolean
expressions.
 It consists tables of rows
and columns with entries
represent 1`s or 0`s.
Introduction
Advantages of Karnaugh Maps
 Data representation’s simplicity.
 Changes in neighboring variables are easily displayed
 Changes Easy and Convenient to implement.
 Reduces the cost and quantity of logical gates.
SOP & POS
 The SOP (Sum of Product) expression represents
1’s .
 SOP form such as (A.B)+(B.C).
 The POS (Product of Sum) expression represents the
low (0) values in the K-Map.
 POS form like (A+B).(C+D)
Properties
An n-variable K-map has 2n
cells with n-variable truth
table value.
Adjacent cells differ
in only one bit .
Each cell refers to a
minterm or maxterm.
For minterm mi ,
maxterm Mi and
don’t care of f we
place 1 , 0 , x .
Simplification Process
No diagonals.
Only 2^n cells in each group.
Groups should be as large as possible.
A group can be combined if all cells of the group have
same set of variable.
Overlapping allowed.
Fewest number of groups possible.
Different Types
of
K-maps
Two Variable K-map(continued)
The K-Map is just a different form of the truth table.
V
W X FWX
Minterm – 0 0 0 1
Minterm – 1 0 1 0
Minterm – 2 1 0 1
Minterm – 3 1 1 0
V
0 1
2 3
X
W
W
X
1 0
1 0
Two Variable K-map Grouping
V
0 0
0 0
B
A
A
Groups of One – 4
1
A B
B
Groups of Two – 2
Two Variable K-Map Groupings
Group of Four
V
0 0
0 0
B
A
A
B
1
B
1
V
1 1
1 1
B
A
A
1
B
Three Variable K-map (continued)
 K-map from truth table.
W X Y FWXY
Minterm – 0 0 0 0 1
Minterm – 1 0 0 1 0
Minterm – 2 0 1 0 0
Minterm – 3 0 1 1 0
Minterm – 4 1 0 0 0
Minterm – 5 1 0 1 1
Minterm – 6 1 1 0 1
Minterm – 7 1 1 1 0
V
0 1
2 3
6 7
4 5
Y
XW
Y
1
XW
XW
XW
0
0 0
0 1
1 0
Only one
variable changes
for every row
cnge
12
Three Variable K-Map Groupings
V
0 0
0 0
0 0
0 0
C C
BA
BA
BA
BA
BA
1 1
BA
1 1
BA
1 1
BA
1 1
1
CA
1
1
CA
1
1
CA
1
1
CB
1
1
CB
1
1
CA
11
CB
1
1
CB
1
Groups of One – 8 (not shown)
Groups of Two – 12
Three Variable K-Map Groupings
Groups of Four – 6 Group of Eight - 1
V
1 1
1 1
1 1
1 1
C C
BA
BA
BA
BA
1
V
0 0
0 0
0 0
0 0
C C
BA
BA
BA
BA
1
C
1
1
1
1
C
1
1
1
A
1 1
1 1
B
1 1
1 1
A
1 1
1 1
B
1 1
1 1
Truth Table to K-Map Mapping
Four Variable K-Map
W X Y Z FWXYZ
Minterm – 0 0 0 0 0 0
Minterm – 1 0 0 0 1 1
Minterm – 2 0 0 1 0 1
Minterm – 3 0 0 1 1 0
Minterm – 4 0 1 0 0 1
Minterm – 5 0 1 0 1 1
Minterm – 6 0 1 1 0 0
Minterm – 7 0 1 1 1 1
Minterm – 8 1 0 0 0 0
Minterm – 9 1 0 0 1 0
Minterm –
10
1 0 1 0 1
Minterm –
11
1 0 1 1 0
Minterm –
12
1 1 0 0 1
Minterm –
13
1 1 0 1 0
V
0 1 3 2
4 5 7 6
12 13 15 14
8 9 11 10
XW
XW
XW
XW
ZY ZY ZY ZY
1 01 1
1 10 1
0 10 0
0 11 0
FOUR VARIABLE K-MAP
GROUPINGS
V
0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0
BA
BA
BA
BA
DC DC DC DC
CB
1 1
1 1
DB
1 1
1 1
DA
1
1
1
1
CB
1 1
1 1
DB
1
1
1
1
DA
1
1
1
1 DB11
11
FOUR VARIABLE K-MAP
GROUPINGS
Groups of Eight – 8 (two shown)
V
0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0
BA
BA
BA
BA
DC DC DC DC
B
1 1 1 1
1 1 1 1
D
1
1
1
1
1
1
1
1
Group of Sixteen – 1
V
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
BA
BA
BA
BA
DC DC DC DC
1
Simplyfing Logic
Expression
by
Different types of K-Map
TWO VARIABLE K-MAP
 Differ in the value of y in
m0 and m1.
 Differ in the value of x in
m0 and m2.
y = 0 y = 1
x = 0
m 0 = m 1 =
x = 1 m 2 = m 3 =
yx yx
yx yx
Two Variable K-Map
Simplified sum-of-products (SOP) logic expression for the logic
function F1.
V
1 1
0 0
K
J
J
K
J
JF =1
J K F1
0 0 1
0 1 1
1 0 0
1 1 0
20
Three Variable Maps
 A three variable K-map :
yz=00 yz=01 yz=11 yz=10
x=0 m0
m1 m3 m2
x=1 m4 m5 m7 m6
 Where each minterm corresponds to the product terms:
yz=00 yz=01 yz=11 yz=10
x=0
x=1
zyx zyx zyx zyx
zyx zyx zyx zyx
Four Variable K-Map
Simplified sum-of-products (SOP) logic expression for the logic
function F3.
TSURUTSUSRF +++=3
R S T U F3
0 0 0 0 0
0 0 0 1 1
0 0 1 0 0
0 0 1 1 1
0 1 0 0 0
0 1 0 1 1
0 1 1 0 1
0 1 1 1 1
1 0 0 0 0
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 0
1 1 1 0 1
1 1 1 1 1
V
0 1 1 0
0 1 1 1
1 0 1 1
0 1 0 0
SR
SR
SR
SR
UT UT UT UT
UR
TS
USR
UTS
 Five variable K-map is formed using two connected 4-
variable maps:
Chapter 2 - Part 2 23
23
0
1 5
4
VWX
YZ
V
Z
000 001
00
13
12
011
9
8
010
X
3
2 6
7
14
15
10
11
01
11
10
Y
16
17 21
20
29
28
25
24
19
18 22
23
30
31
26
27
100 101 111 110
W W
X
Five Variable K-Map
Don’t-care condition
 Minterms that may produce either
0 or 1 for the function.
 Marked with an ‘x’
in the K-map.
 These don’t-care conditions can
be used to provide further simplification.
SOME YOU GROUP, SOME YOU
DON’T
V
X 0
1 0
0 0
X 0
C C
BA
BA
BA
BA
CA
This don’t care condition was treated as a
(1).
There was no advantage in treating
this don’t care condition as a (1),
thus it was treated as a (0) and not
grouped.
Don’t Care Conditions
Simplified sum-of-products (SOP) logic expression for the logic
function F4.
SRTRF +=4
R S T U F4
0 0 0 0 X
0 0 0 1 0
0 0 1 0 1
0 0 1 1 X
0 1 0 0 0
0 1 0 1 X
0 1 1 0 X
0 1 1 1 1
1 0 0 0 1
1 0 0 1 1
1 0 1 0 1
1 0 1 1 X
1 1 0 0 X
1 1 0 1 0
1 1 1 0 0
1 1 1 1 0
V
X 0 X 1
0 X 1 X
X 0 0 0
1 1 X 1
SR
SR
SR
SR
UT UT UT UT
TR
SR
Implicants
The group of 1s is called implicants.
Two types of Implicants:
Prime Implicants.
Essential Prime Implicants.
Prime and Essential Prime
Implicants
Chapter 2 - Part 2 28
DB
CB
1 1
1 1
1 1
B
D
A
1 1
1 1
1
ESSENTIAL Prime
ImplicantsC
BD
CD
BD
Minterms covered by single prime implicant
DB
1 1
1 1
1 1
B
C
D
A
1 1
1 1
1
AD
BA
Example with don’t Care
Chapter 2 - Part 2 29
x
x
1
1 1
1
1
B
D
A
C
1
1
1
x
x
1
1 1
1
1
B
D
A
C
1
1
EssentialSelected
Besides some disadvantages like usage of
limited variables K-Map is very efficient
to simplify logic expression.
Conclusion
References
 Wikipedia.com.
 Digital Design by Morris Mano
Thank
You

Contenu connexe

Tendances

The Karnaugh Map
The Karnaugh MapThe Karnaugh Map
The Karnaugh MapSoban Ahmad
 
boolean algebra and logic simplification
boolean algebra and logic simplificationboolean algebra and logic simplification
boolean algebra and logic simplificationUnsa Shakir
 
BOOLEAN ALGEBRA AND LOGIC GATE
BOOLEAN ALGEBRA AND LOGIC GATE BOOLEAN ALGEBRA AND LOGIC GATE
BOOLEAN ALGEBRA AND LOGIC GATE Tamim Tanvir
 
Karnaugh map
Karnaugh mapKarnaugh map
Karnaugh mapchandkec
 
Digital logic circuits important question and answers for 5 units
Digital logic circuits important question and answers for 5 unitsDigital logic circuits important question and answers for 5 units
Digital logic circuits important question and answers for 5 unitsLekashri Subramanian
 
Presentation on inverse matrix
Presentation on inverse matrixPresentation on inverse matrix
Presentation on inverse matrixSyed Ahmed Zaki
 
Decoders
DecodersDecoders
DecodersRe Man
 
BOOTH ALGO, DIVISION(RESTORING _ NON RESTORING) etc etc
BOOTH ALGO, DIVISION(RESTORING _ NON RESTORING) etc etcBOOTH ALGO, DIVISION(RESTORING _ NON RESTORING) etc etc
BOOTH ALGO, DIVISION(RESTORING _ NON RESTORING) etc etcAbhishek Rajpoot
 
Memory elements
Memory elementsMemory elements
Memory elementschandkec
 
Basic theorems and properties of boolean algebra
Basic theorems and properties of boolean algebraBasic theorems and properties of boolean algebra
Basic theorems and properties of boolean algebraHanu Kavi
 

Tendances (20)

Karnaugh map
Karnaugh mapKarnaugh map
Karnaugh map
 
K map
K mapK map
K map
 
The Karnaugh Map
The Karnaugh MapThe Karnaugh Map
The Karnaugh Map
 
Rules of Karnaugh Map
Rules of Karnaugh MapRules of Karnaugh Map
Rules of Karnaugh Map
 
K map
K mapK map
K map
 
boolean algebra and logic simplification
boolean algebra and logic simplificationboolean algebra and logic simplification
boolean algebra and logic simplification
 
Sop and pos
Sop and posSop and pos
Sop and pos
 
BOOLEAN ALGEBRA AND LOGIC GATE
BOOLEAN ALGEBRA AND LOGIC GATE BOOLEAN ALGEBRA AND LOGIC GATE
BOOLEAN ALGEBRA AND LOGIC GATE
 
KMAP
KMAPKMAP
KMAP
 
Karnaugh map
Karnaugh mapKarnaugh map
Karnaugh map
 
Digital logic circuits important question and answers for 5 units
Digital logic circuits important question and answers for 5 unitsDigital logic circuits important question and answers for 5 units
Digital logic circuits important question and answers for 5 units
 
Karnaugh Map
Karnaugh MapKarnaugh Map
Karnaugh Map
 
Encoder and decoder
Encoder and decoderEncoder and decoder
Encoder and decoder
 
Presentation on inverse matrix
Presentation on inverse matrixPresentation on inverse matrix
Presentation on inverse matrix
 
Decoders
DecodersDecoders
Decoders
 
BOOTH ALGO, DIVISION(RESTORING _ NON RESTORING) etc etc
BOOTH ALGO, DIVISION(RESTORING _ NON RESTORING) etc etcBOOTH ALGO, DIVISION(RESTORING _ NON RESTORING) etc etc
BOOTH ALGO, DIVISION(RESTORING _ NON RESTORING) etc etc
 
Multiplexers & Demultiplexers
Multiplexers & DemultiplexersMultiplexers & Demultiplexers
Multiplexers & Demultiplexers
 
Memory elements
Memory elementsMemory elements
Memory elements
 
Basic theorems and properties of boolean algebra
Basic theorems and properties of boolean algebraBasic theorems and properties of boolean algebra
Basic theorems and properties of boolean algebra
 
K-map method
K-map methodK-map method
K-map method
 

En vedette

Karnaugh Mapping Explained
Karnaugh Mapping ExplainedKarnaugh Mapping Explained
Karnaugh Mapping Explainedml4ml4
 
Kmap Slideshare
Kmap SlideshareKmap Slideshare
Kmap Slidesharetech4us
 
Logic simplification sop and pos forms
Logic simplification sop and pos formsLogic simplification sop and pos forms
Logic simplification sop and pos formsManesh T
 
Chapter iii: Number System
Chapter iii: Number SystemChapter iii: Number System
Chapter iii: Number Systemkclove
 
Chapter 06 boolean algebra
Chapter 06 boolean algebraChapter 06 boolean algebra
Chapter 06 boolean algebraHareem Aslam
 
BOOLEAN ALGEBRA
BOOLEAN ALGEBRA BOOLEAN ALGEBRA
BOOLEAN ALGEBRA Shaik Aman
 
COMPUTER ORGANIZATION - Logic gates, Boolean Algebra, Combinational Circuits
COMPUTER ORGANIZATION - Logic gates, Boolean Algebra, Combinational CircuitsCOMPUTER ORGANIZATION - Logic gates, Boolean Algebra, Combinational Circuits
COMPUTER ORGANIZATION - Logic gates, Boolean Algebra, Combinational CircuitsVanitha Chandru
 
Ch4 Boolean Algebra And Logic Simplication1
Ch4 Boolean Algebra And Logic Simplication1Ch4 Boolean Algebra And Logic Simplication1
Ch4 Boolean Algebra And Logic Simplication1Qundeel
 
Boolean algebra
Boolean algebraBoolean algebra
Boolean algebraGagan Deep
 
Lec7 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Kar...
Lec7 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Kar...Lec7 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Kar...
Lec7 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Kar...Hsien-Hsin Sean Lee, Ph.D.
 
Seminar on polymorphism
Seminar on polymorphismSeminar on polymorphism
Seminar on polymorphism023henil
 
Explain Half Adder and Full Adder with Truth Table
Explain Half Adder and Full Adder with Truth TableExplain Half Adder and Full Adder with Truth Table
Explain Half Adder and Full Adder with Truth Tableelprocus
 

En vedette (19)

Karnaugh Mapping Explained
Karnaugh Mapping ExplainedKarnaugh Mapping Explained
Karnaugh Mapping Explained
 
Kmap Slideshare
Kmap SlideshareKmap Slideshare
Kmap Slideshare
 
Karnaugh Maps
Karnaugh MapsKarnaugh Maps
Karnaugh Maps
 
K map
K mapK map
K map
 
Logic simplification sop and pos forms
Logic simplification sop and pos formsLogic simplification sop and pos forms
Logic simplification sop and pos forms
 
Karnaugh map
Karnaugh mapKarnaugh map
Karnaugh map
 
Chapter iii: Number System
Chapter iii: Number SystemChapter iii: Number System
Chapter iii: Number System
 
Combinational circuit
Combinational circuitCombinational circuit
Combinational circuit
 
Chapter 06 boolean algebra
Chapter 06 boolean algebraChapter 06 boolean algebra
Chapter 06 boolean algebra
 
BOOLEAN ALGEBRA
BOOLEAN ALGEBRA BOOLEAN ALGEBRA
BOOLEAN ALGEBRA
 
COMPUTER ORGANIZATION - Logic gates, Boolean Algebra, Combinational Circuits
COMPUTER ORGANIZATION - Logic gates, Boolean Algebra, Combinational CircuitsCOMPUTER ORGANIZATION - Logic gates, Boolean Algebra, Combinational Circuits
COMPUTER ORGANIZATION - Logic gates, Boolean Algebra, Combinational Circuits
 
Ch4 Boolean Algebra And Logic Simplication1
Ch4 Boolean Algebra And Logic Simplication1Ch4 Boolean Algebra And Logic Simplication1
Ch4 Boolean Algebra And Logic Simplication1
 
Boolean algebra
Boolean algebraBoolean algebra
Boolean algebra
 
Lec7 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Kar...
Lec7 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Kar...Lec7 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Kar...
Lec7 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Kar...
 
Seminar on polymorphism
Seminar on polymorphismSeminar on polymorphism
Seminar on polymorphism
 
Explain Half Adder and Full Adder with Truth Table
Explain Half Adder and Full Adder with Truth TableExplain Half Adder and Full Adder with Truth Table
Explain Half Adder and Full Adder with Truth Table
 
Balanced Tree(AVL Tree,Red Black Tree)
Balanced Tree(AVL Tree,Red Black Tree)Balanced Tree(AVL Tree,Red Black Tree)
Balanced Tree(AVL Tree,Red Black Tree)
 
Bermuda Triangle
Bermuda TriangleBermuda Triangle
Bermuda Triangle
 
Academic Pressure Too Much To Handle
Academic Pressure Too Much To HandleAcademic Pressure Too Much To Handle
Academic Pressure Too Much To Handle
 

Similaire à Karnaugh Graph or K-Map

Similaire à Karnaugh Graph or K-Map (20)

Kmaps By Ms Nita Arora
Kmaps By Ms Nita AroraKmaps By Ms Nita Arora
Kmaps By Ms Nita Arora
 
Kmap Slideshare
Kmap SlideshareKmap Slideshare
Kmap Slideshare
 
kmap.pptx
kmap.pptxkmap.pptx
kmap.pptx
 
1سلمي 2
1سلمي 21سلمي 2
1سلمي 2
 
Karnaugh maps z 88
Karnaugh maps   z  88Karnaugh maps   z  88
Karnaugh maps z 88
 
3,EEng k-map.pdf
3,EEng k-map.pdf3,EEng k-map.pdf
3,EEng k-map.pdf
 
Chapter-3.pdf
Chapter-3.pdfChapter-3.pdf
Chapter-3.pdf
 
Chapter-3.pdf
Chapter-3.pdfChapter-3.pdf
Chapter-3.pdf
 
Learning Kmap
Learning KmapLearning Kmap
Learning Kmap
 
ECE 3rd_Unit No. 1_K-Map_DSD.ppt
ECE 3rd_Unit No. 1_K-Map_DSD.pptECE 3rd_Unit No. 1_K-Map_DSD.ppt
ECE 3rd_Unit No. 1_K-Map_DSD.ppt
 
pos and do not care ppt.pptx
pos and do not care ppt.pptxpos and do not care ppt.pptx
pos and do not care ppt.pptx
 
Algebra booleana y fcc, fcd
Algebra booleana y fcc, fcdAlgebra booleana y fcc, fcd
Algebra booleana y fcc, fcd
 
Engineering electronics and electrical 3 K-Maps.pptx
Engineering electronics and electrical 3 K-Maps.pptxEngineering electronics and electrical 3 K-Maps.pptx
Engineering electronics and electrical 3 K-Maps.pptx
 
UNIT-II -DIGITAL SYSTEM DESIGN
UNIT-II -DIGITAL SYSTEM DESIGNUNIT-II -DIGITAL SYSTEM DESIGN
UNIT-II -DIGITAL SYSTEM DESIGN
 
UNIT-II : SEQUENTIAL CIRCUIT DESIGN
UNIT-II  : SEQUENTIAL CIRCUIT DESIGN UNIT-II  : SEQUENTIAL CIRCUIT DESIGN
UNIT-II : SEQUENTIAL CIRCUIT DESIGN
 
Chapter-3.ppt
Chapter-3.pptChapter-3.ppt
Chapter-3.ppt
 
Lecture 12
Lecture 12Lecture 12
Lecture 12
 
D0372027037
D0372027037D0372027037
D0372027037
 
Lec9
Lec9Lec9
Lec9
 
STLD- Switching functions
STLD- Switching functions STLD- Switching functions
STLD- Switching functions
 

Plus de B.Sc in CSE, United International University - UIU, Dhaka (6)

Electronics project
Electronics projectElectronics project
Electronics project
 
Leisure Life E-Commerce Bookstore
Leisure Life E-Commerce BookstoreLeisure Life E-Commerce Bookstore
Leisure Life E-Commerce Bookstore
 
Project Management Tool & Technique of Online Bookstore
Project Management Tool & Technique of Online BookstoreProject Management Tool & Technique of Online Bookstore
Project Management Tool & Technique of Online Bookstore
 
Red Black Tree
Red Black TreeRed Black Tree
Red Black Tree
 
Sudoku
SudokuSudoku
Sudoku
 
Tree of Data Structure
Tree of Data StructureTree of Data Structure
Tree of Data Structure
 

Dernier

Wellbeing inclusion and digital dystopias.pptx
Wellbeing inclusion and digital dystopias.pptxWellbeing inclusion and digital dystopias.pptx
Wellbeing inclusion and digital dystopias.pptxJisc
 
Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)Jisc
 
Understanding Accommodations and Modifications
Understanding  Accommodations and ModificationsUnderstanding  Accommodations and Modifications
Understanding Accommodations and ModificationsMJDuyan
 
Salient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functionsSalient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functionsKarakKing
 
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...Nguyen Thanh Tu Collection
 
Micro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdfMicro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdfPoh-Sun Goh
 
SKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptx
SKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptxSKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptx
SKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptxAmanpreet Kaur
 
Jamworks pilot and AI at Jisc (20/03/2024)
Jamworks pilot and AI at Jisc (20/03/2024)Jamworks pilot and AI at Jisc (20/03/2024)
Jamworks pilot and AI at Jisc (20/03/2024)Jisc
 
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...Nguyen Thanh Tu Collection
 
Key note speaker Neum_Admir Softic_ENG.pdf
Key note speaker Neum_Admir Softic_ENG.pdfKey note speaker Neum_Admir Softic_ENG.pdf
Key note speaker Neum_Admir Softic_ENG.pdfAdmir Softic
 
This PowerPoint helps students to consider the concept of infinity.
This PowerPoint helps students to consider the concept of infinity.This PowerPoint helps students to consider the concept of infinity.
This PowerPoint helps students to consider the concept of infinity.christianmathematics
 
HMCS Max Bernays Pre-Deployment Brief (May 2024).pptx
HMCS Max Bernays Pre-Deployment Brief (May 2024).pptxHMCS Max Bernays Pre-Deployment Brief (May 2024).pptx
HMCS Max Bernays Pre-Deployment Brief (May 2024).pptxEsquimalt MFRC
 
How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17Celine George
 
REMIFENTANIL: An Ultra short acting opioid.pptx
REMIFENTANIL: An Ultra short acting opioid.pptxREMIFENTANIL: An Ultra short acting opioid.pptx
REMIFENTANIL: An Ultra short acting opioid.pptxDr. Ravikiran H M Gowda
 
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdfUGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdfNirmal Dwivedi
 
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docxPython Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docxRamakrishna Reddy Bijjam
 
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...ZurliaSoop
 
Interdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptxInterdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptxPooja Bhuva
 
How to setup Pycharm environment for Odoo 17.pptx
How to setup Pycharm environment for Odoo 17.pptxHow to setup Pycharm environment for Odoo 17.pptx
How to setup Pycharm environment for Odoo 17.pptxCeline George
 

Dernier (20)

Wellbeing inclusion and digital dystopias.pptx
Wellbeing inclusion and digital dystopias.pptxWellbeing inclusion and digital dystopias.pptx
Wellbeing inclusion and digital dystopias.pptx
 
Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)
 
Understanding Accommodations and Modifications
Understanding  Accommodations and ModificationsUnderstanding  Accommodations and Modifications
Understanding Accommodations and Modifications
 
Salient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functionsSalient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functions
 
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
 
Micro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdfMicro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdf
 
Mehran University Newsletter Vol-X, Issue-I, 2024
Mehran University Newsletter Vol-X, Issue-I, 2024Mehran University Newsletter Vol-X, Issue-I, 2024
Mehran University Newsletter Vol-X, Issue-I, 2024
 
SKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptx
SKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptxSKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptx
SKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptx
 
Jamworks pilot and AI at Jisc (20/03/2024)
Jamworks pilot and AI at Jisc (20/03/2024)Jamworks pilot and AI at Jisc (20/03/2024)
Jamworks pilot and AI at Jisc (20/03/2024)
 
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
 
Key note speaker Neum_Admir Softic_ENG.pdf
Key note speaker Neum_Admir Softic_ENG.pdfKey note speaker Neum_Admir Softic_ENG.pdf
Key note speaker Neum_Admir Softic_ENG.pdf
 
This PowerPoint helps students to consider the concept of infinity.
This PowerPoint helps students to consider the concept of infinity.This PowerPoint helps students to consider the concept of infinity.
This PowerPoint helps students to consider the concept of infinity.
 
HMCS Max Bernays Pre-Deployment Brief (May 2024).pptx
HMCS Max Bernays Pre-Deployment Brief (May 2024).pptxHMCS Max Bernays Pre-Deployment Brief (May 2024).pptx
HMCS Max Bernays Pre-Deployment Brief (May 2024).pptx
 
How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17
 
REMIFENTANIL: An Ultra short acting opioid.pptx
REMIFENTANIL: An Ultra short acting opioid.pptxREMIFENTANIL: An Ultra short acting opioid.pptx
REMIFENTANIL: An Ultra short acting opioid.pptx
 
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdfUGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
 
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docxPython Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docx
 
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
 
Interdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptxInterdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptx
 
How to setup Pycharm environment for Odoo 17.pptx
How to setup Pycharm environment for Odoo 17.pptxHow to setup Pycharm environment for Odoo 17.pptx
How to setup Pycharm environment for Odoo 17.pptx
 

Karnaugh Graph or K-Map

  • 2. CONTENTS  Introduction.  Advantages of Karnaugh Maps.  SOP & POS.  Properties.  Simplification Process  Different Types of K-maps  Simplyfing logic expression by different types of K-Map  Don’t care conditions  Prime Implicants  References.
  • 3.  Also known as Veitch diagram or K-Map.  Invented in 1953 by Maurice Karnaugh.  A graphical way of minimizing Boolean expressions.  It consists tables of rows and columns with entries represent 1`s or 0`s. Introduction
  • 4. Advantages of Karnaugh Maps  Data representation’s simplicity.  Changes in neighboring variables are easily displayed  Changes Easy and Convenient to implement.  Reduces the cost and quantity of logical gates.
  • 5. SOP & POS  The SOP (Sum of Product) expression represents 1’s .  SOP form such as (A.B)+(B.C).  The POS (Product of Sum) expression represents the low (0) values in the K-Map.  POS form like (A+B).(C+D)
  • 6. Properties An n-variable K-map has 2n cells with n-variable truth table value. Adjacent cells differ in only one bit . Each cell refers to a minterm or maxterm. For minterm mi , maxterm Mi and don’t care of f we place 1 , 0 , x .
  • 7. Simplification Process No diagonals. Only 2^n cells in each group. Groups should be as large as possible. A group can be combined if all cells of the group have same set of variable. Overlapping allowed. Fewest number of groups possible.
  • 9. Two Variable K-map(continued) The K-Map is just a different form of the truth table. V W X FWX Minterm – 0 0 0 1 Minterm – 1 0 1 0 Minterm – 2 1 0 1 Minterm – 3 1 1 0 V 0 1 2 3 X W W X 1 0 1 0
  • 10. Two Variable K-map Grouping V 0 0 0 0 B A A Groups of One – 4 1 A B B
  • 11. Groups of Two – 2 Two Variable K-Map Groupings Group of Four V 0 0 0 0 B A A B 1 B 1 V 1 1 1 1 B A A 1 B
  • 12. Three Variable K-map (continued)  K-map from truth table. W X Y FWXY Minterm – 0 0 0 0 1 Minterm – 1 0 0 1 0 Minterm – 2 0 1 0 0 Minterm – 3 0 1 1 0 Minterm – 4 1 0 0 0 Minterm – 5 1 0 1 1 Minterm – 6 1 1 0 1 Minterm – 7 1 1 1 0 V 0 1 2 3 6 7 4 5 Y XW Y 1 XW XW XW 0 0 0 0 1 1 0 Only one variable changes for every row cnge 12
  • 13. Three Variable K-Map Groupings V 0 0 0 0 0 0 0 0 C C BA BA BA BA BA 1 1 BA 1 1 BA 1 1 BA 1 1 1 CA 1 1 CA 1 1 CA 1 1 CB 1 1 CB 1 1 CA 11 CB 1 1 CB 1 Groups of One – 8 (not shown) Groups of Two – 12
  • 14. Three Variable K-Map Groupings Groups of Four – 6 Group of Eight - 1 V 1 1 1 1 1 1 1 1 C C BA BA BA BA 1 V 0 0 0 0 0 0 0 0 C C BA BA BA BA 1 C 1 1 1 1 C 1 1 1 A 1 1 1 1 B 1 1 1 1 A 1 1 1 1 B 1 1 1 1
  • 15. Truth Table to K-Map Mapping Four Variable K-Map W X Y Z FWXYZ Minterm – 0 0 0 0 0 0 Minterm – 1 0 0 0 1 1 Minterm – 2 0 0 1 0 1 Minterm – 3 0 0 1 1 0 Minterm – 4 0 1 0 0 1 Minterm – 5 0 1 0 1 1 Minterm – 6 0 1 1 0 0 Minterm – 7 0 1 1 1 1 Minterm – 8 1 0 0 0 0 Minterm – 9 1 0 0 1 0 Minterm – 10 1 0 1 0 1 Minterm – 11 1 0 1 1 0 Minterm – 12 1 1 0 0 1 Minterm – 13 1 1 0 1 0 V 0 1 3 2 4 5 7 6 12 13 15 14 8 9 11 10 XW XW XW XW ZY ZY ZY ZY 1 01 1 1 10 1 0 10 0 0 11 0
  • 16. FOUR VARIABLE K-MAP GROUPINGS V 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 BA BA BA BA DC DC DC DC CB 1 1 1 1 DB 1 1 1 1 DA 1 1 1 1 CB 1 1 1 1 DB 1 1 1 1 DA 1 1 1 1 DB11 11
  • 17. FOUR VARIABLE K-MAP GROUPINGS Groups of Eight – 8 (two shown) V 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 BA BA BA BA DC DC DC DC B 1 1 1 1 1 1 1 1 D 1 1 1 1 1 1 1 1 Group of Sixteen – 1 V 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 BA BA BA BA DC DC DC DC 1
  • 19. TWO VARIABLE K-MAP  Differ in the value of y in m0 and m1.  Differ in the value of x in m0 and m2. y = 0 y = 1 x = 0 m 0 = m 1 = x = 1 m 2 = m 3 = yx yx yx yx
  • 20. Two Variable K-Map Simplified sum-of-products (SOP) logic expression for the logic function F1. V 1 1 0 0 K J J K J JF =1 J K F1 0 0 1 0 1 1 1 0 0 1 1 0 20
  • 21. Three Variable Maps  A three variable K-map : yz=00 yz=01 yz=11 yz=10 x=0 m0 m1 m3 m2 x=1 m4 m5 m7 m6  Where each minterm corresponds to the product terms: yz=00 yz=01 yz=11 yz=10 x=0 x=1 zyx zyx zyx zyx zyx zyx zyx zyx
  • 22. Four Variable K-Map Simplified sum-of-products (SOP) logic expression for the logic function F3. TSURUTSUSRF +++=3 R S T U F3 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 1 1 1 0 1 0 0 0 0 1 0 1 1 0 1 1 0 1 0 1 1 1 1 1 0 0 0 0 1 0 0 1 1 1 0 1 0 0 1 0 1 1 0 1 1 0 0 1 1 1 0 1 0 1 1 1 0 1 1 1 1 1 1 V 0 1 1 0 0 1 1 1 1 0 1 1 0 1 0 0 SR SR SR SR UT UT UT UT UR TS USR UTS
  • 23.  Five variable K-map is formed using two connected 4- variable maps: Chapter 2 - Part 2 23 23 0 1 5 4 VWX YZ V Z 000 001 00 13 12 011 9 8 010 X 3 2 6 7 14 15 10 11 01 11 10 Y 16 17 21 20 29 28 25 24 19 18 22 23 30 31 26 27 100 101 111 110 W W X Five Variable K-Map
  • 24. Don’t-care condition  Minterms that may produce either 0 or 1 for the function.  Marked with an ‘x’ in the K-map.  These don’t-care conditions can be used to provide further simplification.
  • 25. SOME YOU GROUP, SOME YOU DON’T V X 0 1 0 0 0 X 0 C C BA BA BA BA CA This don’t care condition was treated as a (1). There was no advantage in treating this don’t care condition as a (1), thus it was treated as a (0) and not grouped.
  • 26. Don’t Care Conditions Simplified sum-of-products (SOP) logic expression for the logic function F4. SRTRF +=4 R S T U F4 0 0 0 0 X 0 0 0 1 0 0 0 1 0 1 0 0 1 1 X 0 1 0 0 0 0 1 0 1 X 0 1 1 0 X 0 1 1 1 1 1 0 0 0 1 1 0 0 1 1 1 0 1 0 1 1 0 1 1 X 1 1 0 0 X 1 1 0 1 0 1 1 1 0 0 1 1 1 1 0 V X 0 X 1 0 X 1 X X 0 0 0 1 1 X 1 SR SR SR SR UT UT UT UT TR SR
  • 27. Implicants The group of 1s is called implicants. Two types of Implicants: Prime Implicants. Essential Prime Implicants.
  • 28. Prime and Essential Prime Implicants Chapter 2 - Part 2 28 DB CB 1 1 1 1 1 1 B D A 1 1 1 1 1 ESSENTIAL Prime ImplicantsC BD CD BD Minterms covered by single prime implicant DB 1 1 1 1 1 1 B C D A 1 1 1 1 1 AD BA
  • 29. Example with don’t Care Chapter 2 - Part 2 29 x x 1 1 1 1 1 B D A C 1 1 1 x x 1 1 1 1 1 B D A C 1 1 EssentialSelected
  • 30. Besides some disadvantages like usage of limited variables K-Map is very efficient to simplify logic expression. Conclusion
  • 31. References  Wikipedia.com.  Digital Design by Morris Mano