Scribd
Upload
29 views30 pages

Lec 10

The document discusses Karnaugh maps and their use in simplifying Boolean logic expressions. It explains how to map standard and non-standard sum of products (SOP) expressions onto Karnaugh maps by marking cells for each minterm or product term. Groups of adjacent cells are identified to find simplified SOP expressions. Examples show mapping various logic expressions and simplifying them using Karnaugh maps. Don't care conditions are also discussed where certain input combinations do not occur.

Uploaded by

bivaye4887
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
29 views30 pages

Lec 10

The document discusses Karnaugh maps and their use in simplifying Boolean logic expressions. It explains how to map standard and non-standard sum of products (SOP) expressions onto Karnaugh maps by marking cells for each minterm or product term. Groups of adjacent cells are identified to find simplified SOP expressions. Examples show mapping various logic expressions and simplifying them using Karnaugh maps. Don't care conditions are also discussed where certain input combinations do not occur.

Uploaded by

bivaye4887
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/ 30

Digital Logic and Design

Dr.Waseem Ikram

Lecture No. 10
Recap
 Examples of Boolean Analysis of Logic
Circuits
 Examples of Simplification of Boolean
Expressions
 Standard form of SOP and POS
expressions
Recap
 Need for Standard SOP and POS
expressions
 Converting standard SOP-POS
 Minterms & Maxterms
 Converting SOP & POS to truth table
format
Karnaugh Map
 Simplification of Boolean Expressions
 Doesn’t guarantee simplest form of
expression
 Terms are not obvious
 Skills of applying rules and laws
 K-map provides a systematic method
 An array of cells
 Used for simplifying 2, 3, 4 and 5 variable
expressions
3-Variable K-map

AB\C 0 1
A\BC 00 01 11 10

00 0 1 0 0 1 3 2

1 4 5 7 6
01 2 3

11 6 7

10 4 5
4-Variable K-map

AB\CD 00 01 11 10

00 0 1 3 2

01 4 5 7 6

11 12 13 15 14

10 8 9 11 10
Grouping & Adjacent Cells
 K-map is considered to be wrapped
around
 All sides are adjacent to each other
 Groups of 2, 4, 8,16 and 32 adjacent cells
are formed
 Groups can be row, column, square or
rectangular.
 Groups of diagonal cells are not allowed
Mapping of Standard SOP
expression
 Selecting n-variable K-map
 1 marked in cell for each minterm
 Remaining cells marked with 0
Mapping of Standard SOP
expression
 SOP expression ABC  ABC  ABC

AB\C 0 1

00 0 0

A\BC 00 01 11 10
01 1 0

11 1 0 0 0 0 0 1

10 1 0 1 1 0 0 1
Mapping of Standard SOP
expression
 SOP expression
A.B.C.D  A.B.C.D  A.B.C.D  A.B.C.D  A.B.C.D  A.B.C.D  A.B.C.D

AB\CD 00 01 11 10

00 0 1 0 0

01 1 1 0 1

11 0 1 0 1

10 1 0 0 0
Mapping of Non-Standard SOP
expression
 Selecting n-variable K-map
 1 marked in all the cells where the non-
standard product term is present
 Remaining cells marked with 0
Mapping of Non-Standard SOP
expression
 SOP expression A  BC

AB\C 0 1

00

A\BC 00 01 11 10
01

11 1 1 0

10 1 1 1 1 1 1 1
Mapping of Non-Standard SOP
expression
 SOP expression A  BC

AB\C 0 1

00 0 0

A\BC 00 01 11 10
01 1 0

11 1 1 0 0 0 0 1

10 1 1 1 1 1 1 1
Mapping of Non-Standard SOP
expression
 SOP expression D  A C  BC

AB\CD 00 01 11 10

00 0 1 1 0

01 0 1 1 0

11 0 1 1 0

10 0 1 1 0
Mapping of Non-Standard SOP
expression
 SOP expression D  A C  BC

AB\CD 00 01 11 10

00 0 1 1 0

01 0 1 1 0

11 1 1 1 0

10 1 1 1 0
Mapping of Non-Standard SOP
expression
 SOP expression D  A C  BC

AB\CD 00 01 11 10

00 0 1 1 0

01 0 1 1 1

11 1 1 1 1

10 1 1 1 0
Simplification of SOP expressions
using K-map
 Mapping of expression
 Forming of Groups of 1s
 Each group represents product term
 3-variable K-map
 1 cell group yields a 3 variable product term
 2 cell group yields a 2 variable product term
 4 cell group yields a 1 variable product term
 8 cell group yields a value of 1 for function
Simplification of SOP expressions
using K-map
 4-variable K-map
 1 cell group yields a 4 variable product term
 2 cell group yields a 3 variable product term
 4 cell group yields a 2 variable product term
 8 cell group yields a 1 variable product term
 16 cell group yields a value of 1 for function
Simplification of SOP
expressions using K-map
B.C  A.C  B.C
AB\C 0 1

00 0 1 A\BC 00 01 11 10

01 1 0 0 0 1 1 1

1 1 0 0 0
11 1 1

10 0 1 A.B.C  A.C  A.B


Simplification of SOP
expressions using K-map
B  A.C

AB\C 0 1

A\BC 00 01 11 10
00 0 0
0 0 0 1 1
01 1 1
1 1 1 1 0
11 1 1

10 0 1 A.B  B.C  A.B


Simplification of SOP
expressions using K-map
A.C  B.D  B.C

AB\CD 00 01 11 10

00 0 1 1 0

01 0 0 1 1

11 1 1 1 1

10 1 1 1 0
Simplification of SOP
expressions using K-map
A.C.D  C.D  B.C

AB\CD 00 01 11 10

00 0 0 1 0

01 0 0 1 1

11 1 0 1 1

10 1 0 1 0
Simplification of SOP
expressions using K-map
B.D  B.C  A.B.D  A.C.D

AB\CD 00 01 11 10

00 1 0 1 1

01 0 0 0 1

11 0 1 1 0

10 1 0 1 1
Mapping Directly from Function
Table
 Function of a logic circuit defined by
function table
 Function can be directly mapped to K-map
Mapping Directly from Function
Table

Inputs Output Inputs Output


A B C D F A B C D F
0 0 0 0 0 1 0 0 0 0
0 0 0 1 1 1 0 0 1 0
0 0 1 0 0 1 0 1 0 0
0 0 1 1 1 1 0 1 1 1
0 1 0 0 0 1 1 0 0 0
0 1 0 1 1 1 1 0 1 1
0 1 1 0 0 1 1 1 0 0
0 1 1 1 1 1 1 1 1 0
Mapping Directly from Function
Table
A.D  B.C.D  B.C.D

AB\CD 00 01 11 10

00 0 1 1 0

01 0 1 1 0

11 0 1 0 0

10 0 0 1 0
Don’t care Conditions
 Some input combinations never occur
 Outputs are assumed to be don’t care
 Don’t care outputs used as 0 or 1 during
simplification.
 Results in simpler and shorter expressions
Don’t Care Conditions

Inputs Output Inputs Output


A B C D F A B C D F
0 0 0 0 0 1 0 0 0 0
0 0 0 1 1 1 0 0 1 0
0 0 1 0 0 1 0 1 0 X
0 0 1 1 1 1 0 1 1 X
0 1 0 0 0 1 1 0 0 X
0 1 0 1 1 1 1 0 1 X
0 1 1 0 0 1 1 1 0 X
0 1 1 1 1 1 1 1 1 X
Don’t Care Conditions

A.D

AB\CD 00 01 11 10

00 0 1 1 0

01 0 1 1 0

11 x x x x

10 0 0 x x
Don’t Care Conditions

AB\CD 00 01 11 10

00 0 1 1 0

01 0 1 1 0

11 x x x x

10 0 x x x

You might also like