Scribd
Upload
41 views38 pages

K-Map and Simplification

The document discusses digital logic design and standard forms of Boolean functions. It explains how to express Boolean functions algebraically using minterms and maxterms in sum of products or product of sums canonical forms. Methods for simplifying Boolean functions using maps and minimizing gate-level implementations are also covered.

Uploaded by

Mohammad Akter Hossain
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
41 views38 pages

K-Map and Simplification

The document discusses digital logic design and standard forms of Boolean functions. It explains how to express Boolean functions algebraically using minterms and maxterms in sum of products or product of sums canonical forms. Methods for simplifying Boolean functions using maps and minimizing gate-level implementations are also covered.

Uploaded by

Mohammad Akter Hossain
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/ 38

Digital Logic Design

Md. Shafqat Talukder Rakin


Lecturer, Department of CSE,
United International University
Email id : [email protected]
Canonical & Standard Forms
Consider two binary variables x, y and the AND operation
• four combinations are possible: x.y, x’.y, x.y’, x’.y’
• each AND term is called a minterm or standard
products
• for n variables we may have 2n minterms

Consider two binary variables x, y and the OR operation


• four combinations are possible: x+y, x’+y, x+y’, x’+y’
• each OR term is called a maxterm or standard sums
• for n variables we have 2n maxterms

Canonical Forms:
• Boolean functions are expressed as a sum of minterms 2
or product of maxterms.
Minterms
x y z Terms
Designation
0 0 0 x’.y’.z’ m0
0 0 1 x’.y’.z m1
0 1 0 x’.y.z’ m2
0 1 1 x’.y.z m3
1 0 0 x.y’.z’ m4
1 0 1 x.y’.z m5
1 1 0 x.y.z’ m6
1 1 1 x.y.z m7
3
Maxterms
x y z Designation Terms
0 0 0 M0 x+y+z
0 0 1 M1 x+y+z’
0 1 0 M2 x+y’+z
0 1 1 M3 x+y’+z’
1 0 0 M4 x’+y+z
1 0 1 M5 x’+y+z’
1 1 0 M6 x’+y’+z
1 1 1 M7 x’+y’+z’

4
Boolean Function: How to express
algebraically? (Using Minterm)
Question: How do we find the function using the truth table?

Truth table example:


x y z F1 F2
0 0 0 0 0
0 0 1 1 1
0 1 0 0 0
0 1 1 0 1
1 0 0 1 1
1 0 1 1 1
1 1 0 1 0
1 1 1 1 0
5
Boolean Function: How to express
algebraically ??
1. Form a minterm for each combination forming a 1
2. OR all of those terms

Truth table example:


x y z F1 minterm
0 0 0 0
0 0 1 1 x’.y’.z m1
0 1 0 0
0 1 1 0
1 0 0 1 x.y’.z’ m4
1 0 1 0
1 1 0 0
1 1 1 1 x.y.z m7

F1=m1+m4+m7= x’.y’.z+x.y’.z’+x.y.z = Σ(1,4,7)


6
Boolean Function: How to express
algebraically ??
Truth table example:
x y z F2 minterm
0 0 0 0 m0
0 0 1 0 m1
0 1 0 0 m2
0 1 1 1 m3
1 0 0 0 m4
1 0 1 1 m5
1 1 0 1 m6
1 1 1 1 m7

F2=m3+m5+m6+m7 = x’.y.z+x.y’.z+x.y.z’+x.y.z = Σ(3,5,6,7)


7
Boolean Function: How to express
algebraically (Using Maxterm)
1. Form a maxterm for each combination forming a 0
2. AND all of those terms

Truth table example:


x y z F1 maxterm
0 0 0 0 x+y+z M0
0 0 1 1
0 1 0 0 x+y’+z M2
0 1 1 0 x+y’+z’ M3
1 0 0 1
1 0 1 0 x’+y+z’ M5
1 1 0 0 x’+y’+z M6
1 1 1 1

F1=M0.M2.M3.M5.M6 = л(0,2,3,5,6)
8
Boolean Function: How to express
algebraically
Truth table example:
x y z F2 maxterm
0 0 0 0 x+y+z M0
0 0 1 0 x+y+z’ M1
0 1 0 0 x+y’+z M2
0 1 1 1
1 0 0 0 x’+y+z M4
1 0 1 1
1 1 0 1
1 1 1 1

F=M0.M1.M2.M4=л(0,1,2,4)=(x+y+z).(x+y+z’).(x+y’+z).(x’+y+z)

9
Maxterms & Minterms: Intuitions
Minterms:
• If a function is expressed as SUM of PRODUCTS, then if a
single product is 1 the function would be 1.

Maxterms:
• If a function is expressed as PRODUCT of SUMS, then if a
single product is 0 the function would be 0.

Canonical Forms:
• Boolean functions expressed as a sum of minterms or
product of maxterms.
10
Standard Forms

Standard From: Sum of Product or Product of Sum

11
Nonstandard Forms

Nonstandard From: Neither a Sum of Product nor Product of Sum

12
Implementations

Three-level implementation vs. two-level implementation

Two-level implementation normally preferred due to delay importance.

13
Extension to Multiple Inputs
• All gates -except for the inverter and
buffer- can be extended to have more
than two inputs

• A gate can be extended to multiple inputs if the


operation represented is commutative &
associative
• x+y=y+x
• (x+y)+z=x+(y+z)
14
Extension to Multiple Inputs

We define multiple input NAND and NOR as:

15
Extension to Multiple Inputs

What about multiple input XOR?


ODD function: 1 if the number of 1’s in the input is odd

16
Positive and Negative Logic

Two values of binary signals

17
Gate-Level Minimization
• The Map Method:
• A simple method for minimizing Boolean
functions

• Map: diagram made up of squares


• Each square represents a minterm

18
Two-Variable Map

19
Two-Variable Map

Maps representing x.y and x+y

20
Three-Variable Map

21
Three-Variable Map-example 1

22
Three-Variable Map

Minterms are not arranged in a binary sequence


Minterms arranged in gray code:
Only one bit changes from one column to the next

23
Three-Variable Map

Each variable is 1 in 4 squares, 0 in 4 squares


Variable appears unprimed in squares equal to 1
Variable appears primed in squares equal to 0

24
28
29
30
Three-Variable Map-example 1

Sum of two adjacent minterms can be simplified


to a single AND term consisting of two literals

31
Three-Variable Map-example 2

32
Three-Variable Map-example 3

33
Three-Variable Map-example 4

34
Four-Variable Map

35
Four-Variable Map-example 1

36
Four-Variable Map-example 2

37
Thank You

38

You might also like