Logic Gates and Boolean Algebra

Logic Gates
Inverter, OR, AND, Buffer, NOR, NAND, XOR, XNOR

Boolean Theorem
Commutative, Associative, Distributive Laws Basic Rules

DeMorgans Theorem Universal Gates

NAND and NOR

Canonical/Standard Forms of Logic

Sum of Product (SOP) Product of Sum (POS) Minterm and Maxterm
2/18/2012 A.A.H Ab-Rahman, Z.Md-Yusof 1

SOP and POS

All boolean expressions can be converted to two standard forms:
SOP: Sum of Product POS: Product of Sum

Standardization of boolean expression makes evaluation, simplification, and implementation of boolean expressions more systematic and easier
2/18/2012 A.A.H Ab-Rahman, Z.Md-Yusof 2

Sum of Product (SOP)

Boolean expressions are expressed as the sum of product, example:
minterm

ABC CDE BC D

literal

Each variable or their complements is called literals Each product term is called minterm

2/18/2012

A.A.H Ab-Rahman, Z.Md-Yusof

SOP (cont.)
In SOP, a single overbar cannot extend over more than one variable, example:
AB ABC
Not SOP because BC

Standard SOP forms must contain all of the variables in the domain of the expression for each product term, example:
ABC ABC ABC
2/18/2012 A.A.H Ab-Rahman, Z.Md-Yusof 4

SOP (cont.)
In the following SOP form,
ABC AB ABCD
How many minterms are there? => 3 How many literals in the second product term? => 2 Is it in a standard SOP form? => No How do we convert the boolean expression to standard SOP form?
2/18/2012 A.A.H Ab-Rahman, Z.Md-Yusof 5

SOP (cont.)
To convert SOP to its standard form, we use the boolean rules
A+A=1 A(B + C) = AB + AC

We have
ABC AB ABCD

The first product term is missing the variable D, and the second product term is missing C and D
2/18/2012 A.A.H Ab-Rahman, Z.Md-Yusof 6

SOP (cont.)
ABC AB ABCD
Apply D + D = 1 and C + C = 1

ABC ( D D) AB(C C )( D D) ABCD

Apply the distributive law

ABCD ABC D ( ABC ABC )( D D) ABCD

ABCD ABC D ABCD ABCD ABC D ABC D ABCD
2/18/2012

Standard SOP form

A.A.H Ab-Rahman, Z.Md-Yusof 7

Product of Sum (POS)

Boolean expressions are expressed as the product of sum, example:
( A B)( A B C )
maxterm literal

2/18/2012

A.A.H Ab-Rahman, Z.Md-Yusof

POS (cont.)
In POS, a single overbar cannot extend over more than one variable, example:
( A B)( A B C )
Not SOP because B+C

Standard POS forms must contain all of the variables in the domain of the expression for each sum term, example:
( A B C )( A B C )( A B C )
2/18/2012 A.A.H Ab-Rahman, Z.Md-Yusof 9

POS (cont.)
In the following POS form,
( A B C )( B C D)( A B C D)
Is it in a standard POS form? => No How do we convert the boolean expression to standard POS form?

2/18/2012

A.A.H Ab-Rahman, Z.Md-Yusof

10

POS (cont.)
To convert POS to its standard form, we use the boolean rules
A.A=0 A + BC = (A + B)(A + C)

We have
( A B C )( B C D)( A B C D)

The first sum term is missing the variable D, and the second sum term is missing A
2/18/2012 A.A.H Ab-Rahman, Z.Md-Yusof 11

POS (cont.)
( A B C )( B C D)( A B C D)
Apply D.D = 0 and A.A = 0 to first and second terms

( A B C D.D)( A. A B C D)( A B C D)
Expand first and second terms

( A B C D)( A B C D)( A B C D)( A B C D) ( A B C D)

Standard POS form

2/18/2012

A.A.H Ab-Rahman, Z.Md-Yusof

12

Minterm and Maxterm

Minterm: Product terms in SOP Maxterm: Sum terms in POS Standard forms of SOP and POS can be derived from truth tables
A 0 0 B 0 0 C 0 1 Z 0 1 For SOP form,

A B C
ABC

Z ABC ABC ABC ABC

m(1,5,6,7)
For POS form,

0
0 1 1 1 1
2/18/2012

1
1 0 0 1 1

0
1 0 1 0 1

0
0 0 1 1 1

A B C A B C A B C ABC ABC ABC

A.A.H Ab-Rahman, Z.Md-Yusof

Z ( A B C )( A B C ) ( A B C )( A B C )
M (0,2,3,4)
13

Minterm and Maxterm

How to design minterms AND-OR logic
Z ABC ABC ABC ABC
A B C
A B C Z A B C A B C
2/18/2012 A.A.H Ab-Rahman, Z.Md-Yusof 14

Also known as 2 level logic

Minterm and Maxterm

How to design minterms NAND-NAND Logic
Z ABC ABC ABC ABC
A B C
A B C A B C A B C
2/18/2012

Q Z R

Z PQ R S
Using DeMorgans Theorem

A.A.H Ab-Rahman, Z.Md-Yusof

Z P Q R S

15

Minterm and Maxterm

How to design maxterms OR-AND Logic
Z ( A B C )( A B C )( A B C )( A B C )
A B C
A B C Z A B C A B C
2/18/2012 A.A.H Ab-Rahman, Z.Md-Yusof 16

Minterm and Maxterm

How to design maxterms NOR-NOR Logic
Z ( A B C )( A B C )( A B C )( A B C )
A B C
A B C A B C A B C
2/18/2012

Q Z R

Z P Q R S
Using DeMorgans Theorem

A.A.H Ab-Rahman, Z.Md-Yusof

Z PQ R S

17

Minterm and Maxterm

Can the minterm and maxterm logic be optimized?
Yes, using Boolean algebra explore yourself Yes, using Karnaugh maps next lecture

A.A.H Ab-Rahman 2/18/2012

August 2008 A.A.H Ab-Rahman, Z.Md-Yusof

18