Scribd
Upload
360 views15 pages

Minterm, Maxterm & K-Map

The document discusses minterms, maxterms, Karnaugh maps, and Boolean algebra simplification methods. It defines minterms as AND terms with all variables in true or complemented form, with 2n minterms for n variables. Maxterms are defined as OR terms with all variables in true or complemented form, also with 2n terms for n variables. Karnaugh maps provide a graphical method to simplify Boolean functions by grouping adjacent minterms that differ in one variable. Boolean expressions can be simplified using algebraic identities or by rearranging the truth table into a Karnaugh map to find common variables between minterms.

Uploaded by

vishal
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
360 views15 pages

Minterm, Maxterm & K-Map

The document discusses minterms, maxterms, Karnaugh maps, and Boolean algebra simplification methods. It defines minterms as AND terms with all variables in true or complemented form, with 2n minterms for n variables. Maxterms are defined as OR terms with all variables in true or complemented form, also with 2n terms for n variables. Karnaugh maps provide a graphical method to simplify Boolean functions by grouping adjacent minterms that differ in one variable. Boolean expressions can be simplified using algebraic identities or by rearranging the truth table into a Karnaugh map to find common variables between minterms.

Uploaded by

vishal
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

Minterm,Maxterm & K-Map

Minterms

Minterms are AND terms with every variable present

in either true or complemented form.


Given that each binary variable may appear normal
(e.g., x) or complemented (e.g., ), there are
x 2n
minterms for n variables.
Example: Two variables (X and Y)produce
2 x 2 = 4 combinations:

XY(both normal)
XY(X normal, Y complemented)
XY(X complemented, Y normal)
XY(both complemented)

Thus there are four minterms of two variables.

Product
term in
SOP

Maxterms
Maxterms are OR terms with every

variable in true or complemented form.


Given that each binary variable may
appear normal (e.g., x) or complemented
(e.g., x), there are 2n maxterms for n
variables.
Example: Two variables (X and Y) produce
2 x 2 = 4 combinations:

X Y
X Y
X Y
X Y

(both normal)
(x normal, y complemented)
(x complemented, y normal)
(both complemented)

Sum term
in POS

Boolean expansion in SOP form


Example:

F A BC

There are three variables, A, B, and C which

we take to be the standard order.


Expanding the terms with missing variables:
F = A(B + B)(C + C) + (A + A) B C
= ABC + ABC + ABC + ABC + ABC + ABC
Collect terms (removing all but one of
duplicate terms):
= ABC + ABC + ABC + ABC + ABC
Express as SOp:
= m7 + m6 + m5 + m4 + m1
= m1 + m4 + m5 + m6 + m7

Boolean expansion in POS form


Any Boolean Function can be expressed as a

Product of Maxterms (POM).

For the function table, the maxterms used are the

terms corresponding to the 0's.


For an expression, expand all terms first to
explicitly list all maxterms. Do this by first
applying the second distributive law , ORing
terms missing variable v with a term equal to and
then applying the distributive law again.

v v

Example: Convert to product of maxterms:

f(x, y,z) x x y

Apply

A+BC = (A+B)(A+C)

the distributive law:

x x y (x x)(x y) 1 (x y) x y

Add missing variable z:

x y z z (x y z) x y z

Express as POM: f = M2 M3

Simplification of Boolean Functions:


Two Methods
The algebraic method by

using Identities
The graphical method by
using Karnaugh Map method
The K-map method is easy and straightforward.
A K-map for a function of n variables
consists of 2n cells, and,
in every row and column, two adjacent cells should differ in
the value of only one of the logic variables.

Examples of K-Maps:

Examples:
Cell numbers are written in the cells.

2-variable K-map

0 1
0 0 1
1 2 3

Re-arranging the truth table


A two-variable function has four possible minterms. We can re-arrange these

minterms into a Karnaugh map.


x

minterm

xy

xy

xy

xy

0
1

0
xy
xy

1
xy
xy

Now we can easily see which minterms contain common literals.


Minterms on the left and right sides contain y and y respectively.

Y and bottom rows contain x and x respectively.


Minterms in the top

0
1

0
xy
xy

1
xy
xy

X
X

Y
xy
xy

Y
xy
xy

Two Variable K-Maps


A=0

B= 0

B=1

m0 =

m1 =

AB

AB

A = 1 m2 =

AB

m3 =

AB

A 2-variable Karnaugh Map:


Similar to Gray Code
Adjacent minterms differ by one
variable

K-Map and Truth Tables


The K-Map is just a different form of the

truth table.
Example Two variable function:
We choose a,b,c and d from the set
K-Map
Function
{0,1} to implement a particular
Table
function,
F(x,y).
Function
Values
Value
B=0 B
(x,y)
F(x,y)

00
01
10
11

a
b
c
d

A=0 a
A=1 c

=1
b
d

You might also like