Review of

Combinational
Logic

Dr DC Hendry

Boolean
Algebra
Review of Combinational Logic
Boolean
Operators
Laws of Boolean
Algebra

SOP and POS

Forms Dr DC Hendry
Truth Tables
and Minterms

Karnaugh
Maps

February 2006
 Review of
Combinational
Logic
1 Boolean Algebra
Dr DC Hendry

Boolean
Boolean Operators
Algebra
Boolean
Operators
Laws of Boolean
Laws of Boolean Algebra
Algebra

SOP and POS

Forms

Truth Tables
2 SOP and POS Forms
and Minterms

Karnaugh
Maps 3 Truth Tables and Minterms

4 Karnaugh Maps
 Boolean Algebra

Review of
Combinational
Logic

Dr DC Hendry

Boolean
Algebra Variables, usually denoted by f , g , x etc. in a Boolean
Boolean
Operators Algebra take the values 0 or 1, or the values false or
Laws of Boolean
Algebra true. In early texts the values low and high were also
SOP and POS
Forms
used.
Truth Tables
and Minterms

Karnaugh
Maps
 Boolean Algebra

Review of
Combinational
Logic

Dr DC Hendry

Boolean
Algebra Variables, usually denoted by f , g , x etc. in a Boolean
Boolean
Operators Algebra take the values 0 or 1, or the values false or
Laws of Boolean
Algebra true. In early texts the values low and high were also
SOP and POS
Forms
used.
Truth Tables Such variables may be combined with the operators NOT,
and Minterms
AND and OR.
Karnaugh
Maps
 Boolean Algebra

Review of
Combinational
Logic

Dr DC Hendry

Boolean
Algebra Variables, usually denoted by f , g , x etc. in a Boolean
Boolean
Operators Algebra take the values 0 or 1, or the values false or
Laws of Boolean
Algebra true. In early texts the values low and high were also
SOP and POS
Forms
used.
Truth Tables Such variables may be combined with the operators NOT,
and Minterms
AND and OR.
Karnaugh
Maps
Other common operators are NAND, NOR, XOR and XNOR.
 NOT

Review of
Combinational
Logic

Dr DC Hendry

Boolean
Algebra
The Boolean operator NOT is
Boolean
Operators
represented by a variety of
Laws of Boolean
Algebra
symbols:
SOP and POS
Forms
1 y =x
Truth Tables
and Minterms

Karnaugh
Maps
 NOT

Review of
Combinational
Logic

Dr DC Hendry

Boolean
Algebra
The Boolean operator NOT is
Boolean
Operators
represented by a variety of
Laws of Boolean
Algebra
symbols:
SOP and POS
Forms
1 y =x
Truth Tables 2 y = x0
and Minterms

Karnaugh
Maps
 NOT

Review of
Combinational
Logic

Dr DC Hendry

Boolean
Algebra
The Boolean operator NOT is
Boolean
Operators
represented by a variety of
Laws of Boolean
Algebra
symbols:
SOP and POS
Forms
1 y =x
Truth Tables 2 y = x0
and Minterms

Karnaugh
3 y = not x (VHDL)
Maps
 NOT

Review of
Combinational
Logic

Dr DC Hendry

Boolean
Algebra
The Boolean operator NOT is
Boolean
Operators
represented by a variety of
Laws of Boolean
Algebra
symbols:
SOP and POS
Forms
1 y =x
Truth Tables 2 y = x0
and Minterms

Karnaugh
3 y = not x (VHDL)
Maps
 NOT

Review of
Combinational
Logic

Dr DC Hendry The Truth Table for the NOT

operator is:
Boolean
Algebra
The Boolean operator NOT is
Boolean
Operators
represented by a variety of a a
Laws of Boolean
Algebra
symbols: 0 1
SOP and POS
Forms
1 y =x 1 0
Truth Tables 2 y = x0
and Minterms

Karnaugh
3 y = not x (VHDL)
Maps
 NOT

Review of
Combinational
Logic

Dr DC Hendry The Truth Table for the NOT

operator is:
Boolean
Algebra
The Boolean operator NOT is
Boolean
Operators
represented by a variety of a a
Laws of Boolean
Algebra
symbols: 0 1
SOP and POS
Forms
1 y =x 1 0
Truth Tables 2 y = x0 and the schematic symbol is:
and Minterms

Karnaugh
3 y = not x (VHDL)
Maps
 OR

Review of
Combinational
Logic

Dr DC Hendry
The Boolean operator OR is
Boolean represented by:
Algebra
Boolean
Operators
1 f =x +y
Laws of Boolean
Algebra

SOP and POS

Forms

Truth Tables
and Minterms

Karnaugh
Maps
 OR

Review of
Combinational
Logic

Dr DC Hendry
The Boolean operator OR is
Boolean represented by:
Algebra
Boolean
Operators
1 f =x +y
Laws of Boolean
Algebra 2 f = x or y (VHDL)
SOP and POS
Forms

Truth Tables
and Minterms

Karnaugh
Maps
 OR

Review of
Combinational
Logic

Dr DC Hendry
The Boolean operator OR is
Boolean represented by:
Algebra
Boolean
Operators
1 f =x +y
Laws of Boolean
Algebra 2 f = x or y (VHDL)
SOP and POS
Forms

Truth Tables
and Minterms

Karnaugh
Maps
 OR

Review of
Combinational
Logic

Dr DC Hendry
The Boolean operator OR is
Boolean represented by:
Algebra
Boolean
Operators
1 f =x +y
Laws of Boolean
Algebra 2 f = x or y (VHDL)
SOP and POS
Forms and has schematic symbol:
Truth Tables
and Minterms

Karnaugh
Maps
 OR

Review of
Combinational
Logic

Dr DC Hendry
The Boolean operator OR is
Boolean represented by: and has truth table:
Algebra
Boolean
Operators
1 f =x +y a b a+b
Laws of Boolean
Algebra 2 f = x or y (VHDL) 0 0 0
SOP and POS
Forms and has schematic symbol: 0 1 1
Truth Tables 1 0 1
and Minterms
1 1 1
Karnaugh
Maps
 AND

Review of
Combinational
Logic

Dr DC Hendry The Boolean operator AND is

represented by either:
Boolean
Algebra
Boolean
1 f = x.y or
Operators
Laws of Boolean
Algebra

SOP and POS

Forms

Truth Tables
and Minterms

Karnaugh
Maps
 AND

Review of
Combinational
Logic

Dr DC Hendry The Boolean operator AND is

represented by either:
Boolean
Algebra
Boolean
1 f = x.y or
Operators
Laws of Boolean
Algebra
2 f = xy
SOP and POS
Forms

Truth Tables
and Minterms

Karnaugh
Maps
 AND

Review of
Combinational
Logic

Dr DC Hendry The Boolean operator AND is

represented by either:
Boolean
Algebra
Boolean
1 f = x.y or
Operators
Laws of Boolean
Algebra
2 f = xy
SOP and POS 3 f = x and y (VHDL)
Forms

Truth Tables
and Minterms

Karnaugh
Maps
 AND

Review of
Combinational
Logic

Dr DC Hendry The Boolean operator AND is

represented by either:
Boolean
Algebra
Boolean
1 f = x.y or
Operators
Laws of Boolean
Algebra
2 f = xy
SOP and POS 3 f = x and y (VHDL)
Forms

Truth Tables
and Minterms

Karnaugh
Maps
 AND

Review of
Combinational
Logic

Dr DC Hendry The Boolean operator AND is

represented by either:
Boolean
Algebra
Boolean
1 f = x.y or
Operators
Laws of Boolean
Algebra
2 f = xy
SOP and POS 3 f = x and y (VHDL)
Forms

Truth Tables
and schematic symbol:
and Minterms

Karnaugh
Maps
 AND

Review of
Combinational
Logic

Dr DC Hendry The Boolean operator AND is

represented by either:
Boolean
and has truth table:
Algebra
Boolean
1 f = x.y or
Operators
Laws of Boolean 2 f = xy a b a.b
Algebra
0 0 0
SOP and POS 3 f = x and y (VHDL)
Forms 0 1 0
Truth Tables
and schematic symbol: 1 0 0
and Minterms

Karnaugh
1 1 1
Maps
 Review of
Combinational
Logic The following laws apply, where Boolean AND is denoted by
Dr DC Hendry ., and Boolean OR by +. These laws may be shown by
enumeration of all possible values of the operands.
Boolean
Algebra
Boolean
Operators
Laws of Boolean
1 a+0=a
Algebra

SOP and POS

Forms

Truth Tables
and Minterms

Karnaugh
Maps
 Review of
Combinational
Logic The following laws apply, where Boolean AND is denoted by
Dr DC Hendry ., and Boolean OR by +. These laws may be shown by
enumeration of all possible values of the operands.
Boolean
Algebra
Boolean
Operators
Laws of Boolean
1 a+0=a
Algebra

SOP and POS

2 a.1 = a
Forms

Truth Tables
and Minterms

Karnaugh
Maps
 Review of
Combinational
Logic The following laws apply, where Boolean AND is denoted by
Dr DC Hendry ., and Boolean OR by +. These laws may be shown by
enumeration of all possible values of the operands.
Boolean
Algebra
Boolean
Operators
Laws of Boolean
1 a+0=a
Algebra

SOP and POS

2 a.1 = a
Forms

Truth Tables
3 a+b =b+a
and Minterms

Karnaugh
Maps
 Review of
Combinational
Logic The following laws apply, where Boolean AND is denoted by
Dr DC Hendry ., and Boolean OR by +. These laws may be shown by
enumeration of all possible values of the operands.
Boolean
Algebra
Boolean
Operators
Laws of Boolean
1 a+0=a
Algebra

SOP and POS

2 a.1 = a
Forms

Truth Tables
3 a+b =b+a
and Minterms 4 a.b = b.a
Karnaugh
Maps
 Review of
Combinational
Logic The following laws apply, where Boolean AND is denoted by
Dr DC Hendry ., and Boolean OR by +. These laws may be shown by
enumeration of all possible values of the operands.
Boolean
Algebra
Boolean
Operators
Laws of Boolean
1 a+0=a
Algebra

SOP and POS

2 a.1 = a
Forms

Truth Tables
3 a+b =b+a
and Minterms 4 a.b = b.a
Karnaugh
Maps 5 a + (b.c) = (a + b).(a + c)
 Review of
Combinational
Logic The following laws apply, where Boolean AND is denoted by
Dr DC Hendry ., and Boolean OR by +. These laws may be shown by
enumeration of all possible values of the operands.
Boolean
Algebra
Boolean
Operators
Laws of Boolean
1 a+0=a
Algebra

SOP and POS

2 a.1 = a
Forms

Truth Tables
3 a+b =b+a
and Minterms 4 a.b = b.a
Karnaugh
Maps 5 a + (b.c) = (a + b).(a + c)
6 a.(b + c) = a.b + a.c
 Review of
Combinational
Logic The following laws apply, where Boolean AND is denoted by
Dr DC Hendry ., and Boolean OR by +. These laws may be shown by
enumeration of all possible values of the operands.
Boolean
Algebra
Boolean
Operators
Laws of Boolean
1 a+0=a
Algebra

SOP and POS

2 a.1 = a
Forms

Truth Tables
3 a+b =b+a
and Minterms 4 a.b = b.a
Karnaugh
Maps 5 a + (b.c) = (a + b).(a + c)
6 a.(b + c) = a.b + a.c
7 a+a=1
 Review of
Combinational
Logic The following laws apply, where Boolean AND is denoted by
Dr DC Hendry ., and Boolean OR by +. These laws may be shown by
enumeration of all possible values of the operands.
Boolean
Algebra
Boolean
Operators
Laws of Boolean
1 a+0=a
Algebra

SOP and POS

2 a.1 = a
Forms

Truth Tables
3 a+b =b+a
and Minterms 4 a.b = b.a
Karnaugh
Maps 5 a + (b.c) = (a + b).(a + c)
6 a.(b + c) = a.b + a.c
7 a+a=1
8 a.a = 0
 Review of
Combinational
Logic
From these basic laws we may then derive the following. These
Dr DC Hendry
may be shown either by enumeration of all possible values, or
algebraicly using the laws above (the algebraic path can be
Boolean
Algebra
quite difficult):
Boolean
Operators
Laws of Boolean
Algebra 1 a+1=1
SOP and POS
Forms

Truth Tables
and Minterms

Karnaugh
Maps

The last two of these laws are referred as DeMorgan laws.

 Review of
Combinational
Logic
From these basic laws we may then derive the following. These
Dr DC Hendry
may be shown either by enumeration of all possible values, or
algebraicly using the laws above (the algebraic path can be
Boolean
Algebra
quite difficult):
Boolean
Operators
Laws of Boolean
Algebra 1 a+1=1
SOP and POS
Forms 2 a+a=a
Truth Tables
and Minterms

Karnaugh
Maps

The last two of these laws are referred as DeMorgan laws.

 Review of
Combinational
Logic
From these basic laws we may then derive the following. These
Dr DC Hendry
may be shown either by enumeration of all possible values, or
algebraicly using the laws above (the algebraic path can be
Boolean
Algebra
quite difficult):
Boolean
Operators
Laws of Boolean
Algebra 1 a+1=1
SOP and POS
Forms 2 a+a=a
Truth Tables
and Minterms
3 a.a = a
Karnaugh
Maps

The last two of these laws are referred as DeMorgan laws.

 Review of
Combinational
Logic
From these basic laws we may then derive the following. These
Dr DC Hendry
may be shown either by enumeration of all possible values, or
algebraicly using the laws above (the algebraic path can be
Boolean
Algebra
quite difficult):
Boolean
Operators
Laws of Boolean
Algebra 1 a+1=1
SOP and POS
Forms 2 a+a=a
Truth Tables
and Minterms
3 a.a = a
Karnaugh
Maps
4 a.b + a.b = a

The last two of these laws are referred as DeMorgan laws.

 Review of
Combinational
Logic
From these basic laws we may then derive the following. These
Dr DC Hendry
may be shown either by enumeration of all possible values, or
algebraicly using the laws above (the algebraic path can be
Boolean
Algebra
quite difficult):
Boolean
Operators
Laws of Boolean
Algebra 1 a+1=1
SOP and POS
Forms 2 a+a=a
Truth Tables
and Minterms
3 a.a = a
Karnaugh
Maps
4 a.b + a.b = a
5 a + b = a.b

The last two of these laws are referred as DeMorgan laws.

 Review of
Combinational
Logic
From these basic laws we may then derive the following. These
Dr DC Hendry
may be shown either by enumeration of all possible values, or
algebraicly using the laws above (the algebraic path can be
Boolean
Algebra
quite difficult):
Boolean
Operators
Laws of Boolean
Algebra 1 a+1=1
SOP and POS
Forms 2 a+a=a
Truth Tables
and Minterms
3 a.a = a
Karnaugh
Maps
4 a.b + a.b = a
5 a + b = a.b
6 a.b = a + b

The last two of these laws are referred as DeMorgan laws.

 Review of
Combinational
Logic

Dr DC Hendry A Boolean expression in SOP (Sum Of Products) form is

Boolean
constructed from a number of product terms connected by the
Algebra
Boolean
OR operator, for example:
Operators
Laws of Boolean
Algebra

SOP and POS

1 f = a.b + c.d
Forms

Truth Tables
and Minterms

Karnaugh
Maps

A product term consists of a number of literals ANDed

together. A literal is x or x.
 Review of
Combinational
Logic

Dr DC Hendry A Boolean expression in SOP (Sum Of Products) form is

Boolean
constructed from a number of product terms connected by the
Algebra
Boolean
OR operator, for example:
Operators
Laws of Boolean
Algebra

SOP and POS

1 f = a.b + c.d
Forms

Truth Tables
2 g = a.b + a.c + c.b
and Minterms

Karnaugh
Maps

A product term consists of a number of literals ANDed

together. A literal is x or x.
 Review of
Combinational
Logic

Dr DC Hendry A Boolean expression in SOP (Sum Of Products) form is

Boolean
constructed from a number of product terms connected by the
Algebra
Boolean
OR operator, for example:
Operators
Laws of Boolean
Algebra

SOP and POS

1 f = a.b + c.d
Forms

Truth Tables
2 g = a.b + a.c + c.b
and Minterms 3 h = a.b.c + a.b.c + b.c
Karnaugh
Maps

A product term consists of a number of literals ANDed

together. A literal is x or x.
 Review of
Combinational
Logic

Dr DC Hendry

Boolean A Boolean expression in POS (Product of Sums) form is

Algebra
Boolean
constructed from a number of sum terms connected by the
Operators
Laws of Boolean AND operator, for example:
Algebra

SOP and POS

Forms
1 f = (x + y ).(w + z)
Truth Tables
and Minterms

Karnaugh
Maps
 Review of
Combinational
Logic

Dr DC Hendry

Boolean A Boolean expression in POS (Product of Sums) form is

Algebra
Boolean
constructed from a number of sum terms connected by the
Operators
Laws of Boolean AND operator, for example:
Algebra

SOP and POS

Forms
1 f = (x + y ).(w + z)
Truth Tables
and Minterms 2 g = (x + y + z).(y + z)
Karnaugh
Maps
 Review of
Combinational
Logic

Dr DC Hendry

Boolean A Boolean expression in POS (Product of Sums) form is

Algebra
Boolean
constructed from a number of sum terms connected by the
Operators
Laws of Boolean AND operator, for example:
Algebra

SOP and POS

Forms
1 f = (x + y ).(w + z)
Truth Tables
and Minterms 2 g = (x + y + z).(y + z)
Karnaugh
Maps 3 h = (x + y ).(x + z).(y + z)
 Truth Tables

Review of
Combinational
Logic
A truth table lists the all
Dr DC Hendry
possible values of the inputs
with the resultant values of the
Boolean
Algebra
outputs.
Boolean
Operators
A B C f m
Laws of Boolean
Algebra 0 0 0 0 m0
SOP and POS 0 0 1 0 m1
Forms

Truth Tables
0 1 0 0 m2
and Minterms 0 1 1 1 m3
Karnaugh
Maps
1 0 0 1 m4
1 0 1 1 m5
1 1 0 1 m6
1 1 1 1 m7
 Truth Tables

Review of
Combinational
Logic
A truth table lists the all
Dr DC Hendry
possible values of the inputs 1 Each line represents a
with the resultant values of the minterm.
Boolean
Algebra
outputs.
Boolean
Operators
A B C f m
Laws of Boolean
Algebra 0 0 0 0 m0
SOP and POS 0 0 1 0 m1
Forms

Truth Tables
0 1 0 0 m2
and Minterms 0 1 1 1 m3
Karnaugh
Maps
1 0 0 1 m4
1 0 1 1 m5
1 1 0 1 m6
1 1 1 1 m7
 Truth Tables

Review of
Combinational
Logic
A truth table lists the all
Dr DC Hendry
possible values of the inputs 1 Each line represents a
with the resultant values of the minterm.
Boolean
Algebra
outputs. 2 A minterm is a product of
Boolean A B C f m
Operators n literals where n is the
Laws of Boolean
Algebra 0 0 0 0 m0
number of inputs.
SOP and POS 0 0 1 0 m1
Forms

Truth Tables
0 1 0 0 m2
and Minterms 0 1 1 1 m3
Karnaugh
Maps
1 0 0 1 m4
1 0 1 1 m5
1 1 0 1 m6
1 1 1 1 m7
 Truth Tables

Review of
Combinational
Logic
A truth table lists the all
Dr DC Hendry
possible values of the inputs 1 Each line represents a
with the resultant values of the minterm.
Boolean
Algebra
outputs. 2 A minterm is a product of
Boolean A B C f m
Operators n literals where n is the
Laws of Boolean
Algebra 0 0 0 0 m0
number of inputs.
SOP and POS 0 0 1 0 m1
Forms
0 1 0 0 m2
3 The first line represents
Truth Tables
and Minterms 0 1 1 1 m3 A B C.
Karnaugh
Maps
1 0 0 1 m4
1 0 1 1 m5
1 1 0 1 m6
1 1 1 1 m7
 Truth Tables

Review of
Combinational
Logic
A truth table lists the all
Dr DC Hendry
possible values of the inputs 1 Each line represents a
with the resultant values of the minterm.
Boolean
Algebra
outputs. 2 A minterm is a product of
Boolean A B C f m
Operators n literals where n is the
Laws of Boolean
Algebra 0 0 0 0 m0
number of inputs.
SOP and POS 0 0 1 0 m1
Forms
0 1 0 0 m2
3 The first line represents
Truth Tables
and Minterms 0 1 1 1 m3 A B C.
Karnaugh 1 0 0 1 m4 4 Denoted by m0 .
Maps
1 0 1 1 m5
1 1 0 1 m6
1 1 1 1 m7
 Truth Tables

Review of
Combinational
Logic
A truth table lists the all
Dr DC Hendry
possible values of the inputs 1 Each line represents a
with the resultant values of the minterm.
Boolean
Algebra
outputs. 2 A minterm is a product of
Boolean A B C f m
Operators n literals where n is the
Laws of Boolean
Algebra 0 0 0 0 m0
number of inputs.
SOP and POS 0 0 1 0 m1
Forms
0 1 0 0 m2
3 The first line represents
Truth Tables
and Minterms 0 1 1 1 m3 A B C.
Karnaugh 1 0 0 1 m4 4 Denoted by m0 .
Maps
1 0 1 1 m5 5 Subscript of m is binary
1 1 0 1 m6 number made by input
1 1 1 1 m7 columns.
 Minterm Specifications

Review of
Combinational
Logic This is often used as a shorthand for a truth table, rather than
Dr DC Hendry list the entire truth table as above, simple list the minterms for
which the output is a logic 1. Thus the truth table above is
Boolean
Algebra often represented as
Boolean
Operators
Laws of Boolean
Algebra

SOP and POS

Forms
f = m3 + m4 + m5 + m6 + m7
Truth Tables
and Minterms

Karnaugh
Maps
 Minterm Specifications

Review of
Combinational
Logic This is often used as a shorthand for a truth table, rather than
Dr DC Hendry list the entire truth table as above, simple list the minterms for
which the output is a logic 1. Thus the truth table above is
Boolean
Algebra often represented as
Boolean
Operators
Laws of Boolean
Algebra

SOP and POS

Forms
f = m3 + m4 + m5 + m6 + m7
Truth Tables
and Minterms
or
Karnaugh
Maps

X
f = m(3, 4, 5, 6, 7)

This notation may be used in examinations!

 Logic Minimisation

Review of
Combinational
Logic

Dr DC Hendry 1 Logic minimisation is the process of manipulating a

Boolean expression to reduce its complexity.
Boolean
Algebra
Boolean
Operators
Laws of Boolean
Algebra

SOP and POS

Forms

Truth Tables
and Minterms

Karnaugh
Maps
 Logic Minimisation

Review of
Combinational
Logic

Dr DC Hendry 1 Logic minimisation is the process of manipulating a

Boolean expression to reduce its complexity.
Boolean
Algebra
Boolean
2 The number of operators (AND, OR, NOT) and literals is
Operators
Laws of Boolean reduced.
Algebra

SOP and POS

Forms

Truth Tables
and Minterms

Karnaugh
Maps
 Logic Minimisation

Review of
Combinational
Logic

Dr DC Hendry 1 Logic minimisation is the process of manipulating a

Boolean expression to reduce its complexity.
Boolean
Algebra
Boolean
2 The number of operators (AND, OR, NOT) and literals is
Operators
Laws of Boolean reduced.
Algebra

SOP and POS

3 Minimisation may be carried out algebraically or
Forms
graphically (Karnaugh Maps).
Truth Tables
and Minterms

Karnaugh
Maps
 Logic Minimisation

Review of
Combinational
Logic

Dr DC Hendry 1 Logic minimisation is the process of manipulating a

Boolean expression to reduce its complexity.
Boolean
Algebra
Boolean
2 The number of operators (AND, OR, NOT) and literals is
Operators
Laws of Boolean reduced.
Algebra

SOP and POS

3 Minimisation may be carried out algebraically or
Forms
graphically (Karnaugh Maps).
Truth Tables
and Minterms 4 Karnaugh maps normally applied for manual reduction of
Karnaugh
Maps
expressions with 2, 3, or 4 inputs. Can be used with up to
6 inputs.
 Logic Minimisation

Review of
Combinational
Logic

Dr DC Hendry 1 Logic minimisation is the process of manipulating a

Boolean expression to reduce its complexity.
Boolean
Algebra
Boolean
2 The number of operators (AND, OR, NOT) and literals is
Operators
Laws of Boolean reduced.
Algebra

SOP and POS

3 Minimisation may be carried out algebraically or
Forms
graphically (Karnaugh Maps).
Truth Tables
and Minterms 4 Karnaugh maps normally applied for manual reduction of
Karnaugh
Maps
expressions with 2, 3, or 4 inputs. Can be used with up to
6 inputs.
5 Computer programs also used, such code always part of
synthesis tools.
 Karnaugh Maps (K-Maps)

Review of
Combinational
Logic

Dr DC Hendry
1 Underlying law is a.b + a.b = a

Boolean
Algebra
Boolean
Operators
Laws of Boolean
Algebra

SOP and POS

Forms

Truth Tables
and Minterms

Karnaugh
Maps
 Karnaugh Maps (K-Maps)

Review of
Combinational
Logic

Dr DC Hendry
1 Underlying law is a.b + a.b = a
2 K-Map arranged so that only one variable changes value in
Boolean
Algebra going to a vertical or horizontal nearest neighbour.
Boolean
Operators
Laws of Boolean
Algebra

SOP and POS

Forms

Truth Tables
and Minterms

Karnaugh
Maps
 Karnaugh Maps (K-Maps)

Review of
Combinational
Logic

Dr DC Hendry
1 Underlying law is a.b + a.b = a
2 K-Map arranged so that only one variable changes value in
Boolean
Algebra going to a vertical or horizontal nearest neighbour.
Boolean
Operators
Laws of Boolean
3 For three inputs:
Algebra

SOP and POS

Forms
f AB
Truth Tables 00 01 11 10
and Minterms

Karnaugh 0
Maps C
1
 Karnaugh Maps (K-Maps)

Review of
Combinational
Logic

Dr DC Hendry
1 Underlying law is a.b + a.b = a
2 K-Map arranged so that only one variable changes value in
Boolean
Algebra going to a vertical or horizontal nearest neighbour.
Boolean
Operators
Laws of Boolean
3 For three inputs:
Algebra

SOP and POS

Forms
f AB
Truth Tables 00 01 11 10
and Minterms

Karnaugh 0
Maps C
1
4 Left and right edge, also top and bottom adjacent in this
sense.
 Example K-Map

Review of
Combinational
Logic

Dr DC Hendry
Taking the example of the truth table from the previous
Boolean section, a K-Map for that function would be:
Algebra
Boolean
Operators
Laws of Boolean
Algebra

SOP and POS

Forms
f AB
Truth Tables 00 01 11 10
and Minterms

Karnaugh 0 0 0 1 1
Maps C
1 0 1 1 1
 Location of Minterms

Review of
Combinational
Logic

Dr DC Hendry
The individual lines of the truth table are copied to the K-Map
Boolean according to:
Algebra
Boolean
Operators
Laws of Boolean
Algebra

SOP and POS

Forms
f AB
Truth Tables 00 01 11 10
and Minterms

Karnaugh 0 m0 m2 m6 m4
Maps C
1 m1 m3 m7 m5
 Circling Implicants

Review of
Combinational
Logic

Dr DC Hendry

f AB
Boolean
Algebra 00 01 11 10
Boolean
Operators
Laws of Boolean
Algebra
0 0 0 1 1
SOP and POS
C
Forms 1 0 1 1 1
Truth Tables
and Minterms

Karnaugh
Maps
 Circling Implicants

Review of
Combinational
Logic

Dr DC Hendry

f AB
Boolean
Algebra 00 01 11 10
Boolean
Operators

Laws of Boolean
Algebra
0 0 0 1 1
SOP and POS
C
Forms 1 0 1 
1 1 
Truth Tables
and Minterms

Karnaugh
Maps
1 a = abc + abc + abc + abc
 Circling Implicants

Review of
Combinational
Logic

Dr DC Hendry

f AB
Boolean
Algebra 00 01 11 10
Boolean
Operators
Laws of Boolean 0 0 0 1 1
Algebra
C  
SOP and POS
Forms 1 0

1 1 1
Truth Tables
and Minterms

Karnaugh
Maps
1 a = abc + abc + abc + abc
2 bc = bca + bca
 Circling Implicants

Review of
Combinational
Logic

Dr DC Hendry

f AB
Boolean
Algebra 00 01 11 10
Boolean
Operators

Laws of Boolean 0 0 0 1 1
Algebra
C  
SOP and POS
Forms 1 0

1 
1 1 
Truth Tables
and Minterms

Karnaugh
Maps
1 a = abc + abc + abc + abc
2 bc = bca + bca
3 f = a + bc
 A Second Example

Review of
Combinational
Logic

Dr DC Hendry
X
f = m(1, 2, 4, 5, 6)
Boolean
Algebra
Boolean
Operators
Laws of Boolean
Algebra
f AB
SOP and POS 00 01 11 10
Forms   
0 0
1 1 1


Truth Tables
and Minterms C 
Karnaugh 1 1 0 0

1
Maps

f = bc + ac + bc
 A Second Example

Review of
Combinational
Logic

Dr DC Hendry
X
f = m(1, 2, 4, 5, 6)
Boolean
Algebra
Boolean
Operators
Laws of Boolean
Algebra
f AB f AB
SOP and POS 00 01 11 10 00 01 11 10
Forms     

0 0
1 1 1 0 0
1 1 1


Truth Tables
and Minterms C  C  
Karnaugh 1 1 0 0

1 1 1 0 0
1
Maps

f = bc + ac + bc f = bc + ab + bc
 Four Input K-Map

Review of A B C D m
Combinational
Logic 0 0 0 0 m0 f AB
Dr DC Hendry 0 0 0 1 m1 00 01 11 10

Boolean
0 0 1 0 m2 00 m0 m4 m12 m8
Algebra 0 0 1 1 m3
Boolean
Operators
0 1 0 0 m4 01 m1 m5 m13 m9
Laws of Boolean CD
Algebra
0 1 0 1 m5 11 m3 m7 m15 m11
SOP and POS
Forms 0 1 1 0 m6
10 m2 m6 m14 m10
Truth Tables 0 1 1 1 m7
and Minterms

Karnaugh
1 0 0 0 m8
Maps 1 0 0 1 m9
1 0 1 0 m10
1 0 1 1 m11
1 1 0 0 m12
1 1 0 1 m13
1 1 1 0 m14