DIGITAL LOGIC DESIGN

(DLD)

Lecture # 6

Boolean Analysis & Simplification

University of Management & Technology

DEMORGANS THEOREMS
DeMorgans 1st Theorem
The complement of a product of variables is
equal to the sum of the complemented variables.
AB = A + B
Applying DeMorgans first theorem to gates:
A

AB

B
NAND

A+B

B
Negative-OR

Inputs
A
0
0
1
1

B
0
1
0
1

Output
AB A + B
1
1
1
1
1
1
0
0

DEMORGANS THEOREMS
DeMorgans 2nd Theorem
The complement of a sum of variables is equal to
the product of the complemented variables.
A+B=A.B
Applying DeMorgans second theorem to gates:
A

A+B

B
NOR

A
B
Negative-AND

AB

Inputs
A
0
0
1
1

B
0
1
0
1

Output
A + B AB
1
1
0
0
0
0
0
0

NAND EQUALS NEGATIVE OR

NOR EQUALS NEGATIVE AND

ALTERNATIVE SYMBOLS FOR INVERTER,

NAND, AND NOR

BOOLEAN ANALYSIS OF LOGIC

CIRCUITS
Combinational logic circuits can be analyzed by writing the
expression for each gate and combining the expressions
according to the rules for Boolean Algebra.
Apply Boolean algebra to derive the expression for X.
Write the expression for each gate:
A

(A + B )

C (A + B )

B
C

X = C (A + B )+ D

Applying DeMorgans theorem and the distribution law:

X = C (A B) + D = A B C + D

UNIVERSAL GATES

NAND gates are sometimes called universal gates

because they can be used to produce the other basic
Boolean functions.

A
B

A
Inverter

AB
AND gate

A
A+B

A+B
B

B
OR gate

NOR gate
8

UNIVERSAL GATES

NOR gates are also universal gates and can form all of the
basic gates.

A
B

A
Inverter

A+ B
OR gate

A
AB

AB
B

B
AND gate

NAND gate

SIMPLIFYING NAND CIRCUITS

Recall that, according to Demorgans theorem, the following
two representations of a NAND gate are equivalent:

AB

B
NAND

Inputs

A+B

B
Negative-OR

A
0
0
1
1

B
0
1
0
1

Output
AB A + B
1
1
1
1
1
1
0
0

In many cases, this lets you redraw all-NAND circuits

in ways that are much easier to read. See example on
next slide.

10

 NOR Gate
NOT:
OR:
AND:

DeMorgans

11

 NAND Gate
NOT:
AND:
OR:

DeMorgans

12

NAND & NOR Implementation

Two-Level Implementation

13

NAND & NOR Implementation

Two-Level Implementation

14

NAND & NOR Implementation

Multilevel NAND Implementation

15

NAND & NOR Implementation

Multilevel NOR Implementation

16

Gate Shapes
AND
OR
NAND
NOR
17

SIMPLIFYING NAND CIRCUITS

For example, the following circuit uses the two equivalent
symbols for a NAND gate:

A
C

X= A C + AB

A
B

The logic is easy to read if you (mentally) cancel the two

connected bubbles on a line.

18

STANDARD FORMS OF
BOOLEAN EXPRESSIONS

All Boolean expressions, regardless of their form,

can be converted into either of two standard
forms:
The

sum-of-products (SOP) form

The product-of-sums (POS) form

Further, Standardization makes the evaluation,

simplification, and implementation of Boolean
expressions much more systematic and easier.
19

THE SUM-OF-PRODUCTS (SOP)

FORM
An

SOP expression when two or more

product terms are summed by Boolean
addition.
Examples:

AB ABC
ABC CDE B CD
A B A BC AC
Also:

A A B C BC D
20

THE SUM-OF-PRODUCTS (SOP)

FORM

In an SOP form, a single overbar cannot

extend over more than one variable;
however, more than one variable in a
term can have an overbar:

example:AB ABC
is OK!
But
AB ABC

Is not an SOP:
21

IMPLEMENTATION OF AN SOP
X=AB+BCD+AC

AND/OR implementation

A
B
B
C
D

A
C
22

GENERAL EXPRESSION SOP

Any

logic expression can be changed into SOP

form by applying Boolean algebra techniques.
examples:
A( B CD) AB ACD
AB B(CD EF ) AB BCD BEF
( A B)( B C D ) AB AC AD BB BC BD
( A B) C ( A B )C ( A B )C AC BC

23

THE PRODUCT-OF-SUMS (POS)

FORM

When two or more sum terms are multiplied, the

result expression is a product-of-sums (POS):
Examples:
( A B)( A B C )
( A B C )(C D E )( B C D )
( A B )( A B C )( A C )

Also:
A ( A B C )( B C D )
24

THE PRODUCT-OF-SUMS (POS) FORM

In a POS form, a single overbar cannot

extend over more than one variable;
however, more than one variable in a term
can have an overbar:
A B)( A B C )
(example:

is OK!
But
( A B )( A B C )
Is not an POS:
25

IMPLEMENTATION OF A POS
X=(A+B)(B+C+D)(A+C)

OR/AND implementation
A
B
B
C
D

A
C
26

SOP AND POS FORMS

Many Boolean expressions are in neither SOP form nor
POS form.
Example 1: A(B + C + BC) + (AB + AB)C
Example 2: AB + C(AD + BD)
But every expression can be converted to SOP form by
applying some or all of the following: DeMorgans
theorems, the distributive law, and the commutative law.

27

LOGIC CIRCUIT OPERATION

WITH PULSE

How can we deal with combinational logic

circuits with pulse waveform inputs?
The operation of each gate is the same for
pulse waveform inputs as for constant-level
inputs.
The output of a logic circuit at any given time
depends on the inputs at that particular time,
so the relationship of the time-varying inputs
is of primary importance.

28

LOGIC CIRCUIT OPERATION

WITH PULSE

Lets get to the basic with a given individual gate:

29

LOGIC CIRCUIT OPERATION

WITH PULSE

30

LOGIC CIRCUIT OPERATION

WITH PULSE

31