DeMorgan’s Theorem

DeMorgan’s 1st Theorem

The complement of a product of variables is
equal to the sum of the complemented variables.
AB = A + B
Applying DeMorgan’s first theorem to gates:
A A
AB A+B Inputs Output
B B
A B AB A + B
NAND Negative-OR 0 0 1 1
0 1 1 1
1 0 1 1
1 1 0 0

1
DeMorgan’s Theorem

DeMorgan’s 2nd Theorem

The complement of a sum of variables is equal to
the product of the complemented variables.
A+B=A.B
Applying DeMorgan’s second theorem to gates:
A A Inputs Output
A+B AB
B B
A B A + B AB
NOR Negative-AND 0 0 1 1
0 1 0 0
1 0 0 0
1 1 0 0

2
DeMorgan’s Theorem

Apply DeMorgan’s theorem to remove the

overbar covering both terms from the
expression X = C + D.

To apply DeMorgan’s theorem to the expression,

you can break the overbar covering both terms and
change the sign between the terms. This results in
=
X = C . D. Deleting the double bar gives X = C . D.

3
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
D
Applying DeMorgan’s theorem and the distribution law:
X = C (A B) + D = A B C + D
4
 Applying DeMorgan’s Theorems

( AB  C )( A  BC )
 ( AB  C )  ( A  BC )
 ( AB )C  A( BC )
 ( A  B)C  A( B  C )
 AC  BC  A B

5
 Boolean Expression for a Logic Circuit

Constructing a Truth Table for a Logic Circuit

A(B + CD) = ] . I = I

B + CD = I + 0 = I
B + CD = 0 + I I
B + CD = 1 + I I

6
 Applying DeMorgan’s Theorems

A  BC  D ( E  F )

 ( A  BC )(D ( E  F ))

 ( A  BC )(D ( E  F ))

 ( A  BC )(D  ( E  F ))
 ( A  BC )(D  ( E  F ))
 A D  AE  A F  BC D  BC E  BC F

7
Simplification Using Boolean Algebra

AB+A(B+C)+B(B+C)
= AB+AB+AC+BB+BC
= AB+AC+B(1+C)
= AB+AC+B
= AC+B(A+1)
= AC+B

8
9

.
 Example

[ A B (C  BD )  A B ]C
 ( A BC  A BBD  A B )C
 ( A BC  A B )C
 A BC  A BC
 BC
10
 Example
ABC  A BC  ABC  ABC  ABC
 BC ( A  A)  AB (C  C )  ABC
 BC  AB  ABC
 BC  B( A  AC )
 BC  B( A  C )
 BC  B A  BC

11
 Example
AB  AC  ABC
 ( AB )( AC )  ABC
 ( A  B)( A  C )  ABC
 A  AC  B A  BC  ABC
 A(1  C )  AB(1  C )  BC
 A  A B  BC
 A  BC
12
 Standard Forms of Boolean
Expressions
SOP and POS forms

Boolean expressions can be written in the sum-of-products

form (SOP) or in the product-of-sums form (POS). These
forms can simplify the implementation of combinational
logic, particularly with PLDs. In both forms, an overbar
cannot extend over more than one variable.
An expression is in SOP form when two or more product terms are
summed as in the following examples:
ABC+AB ABC+CD CD+E
An expression is in POS form when two or more sum terms are
multiplied as in the following examples:
(A + B)(A + C) (A + B + C)(B + D) (A + B)C

13
Implementation of the SOP expression AB + BCD + AC.

14

.
 SOP Standard form
In SOP standard form, every variable in the domain must
appear in each term. This form is useful for constructing
truth tables or for implementing logic in PLDs.
You can expand a nonstandard term to standard form by multiplying the
term by a term consisting of the sum of the missing variable and its
complement.
Convert X = A B + A B C to standard form.
The first term does not include the variable C. Therefore,
multiply it by the (C + C), which = 1:
X = A B (C + C) + A B C
=ABC+ABC+ABC

ABC  AB  ABC D
 ABCD  ABC D  ABCD  ABC D  ABC D  ABC D  ABC D
15
POS Standard form
In POS standard form, every variable in the domain must
appear in each sum term of the expression.
You can expand a nonstandard POS expression to standard form by
adding the product of the missing variable and its complement and
applying rule 12, which states that (A + B)(A + C) = A + BC.

Convert X = (A + B)(A + B + C) to standard form.

The first sum term does not include the variable C.
Therefore, add C C and expand the result by rule 12.
X = (A + B + C C)(A + B + C)
= (A +B + C )(A + B + C)(A + B + C)
( A  B  C )(B  C  D)( A  B  C  D)
 ( A  B  C  D)( A  B  C  D)( A  B  C  D)( A  B  C  D)

16
 Converting SOP–POS

ABC  ABC  ABC  ABC  ABC

 ( A  B  C )( A  B  C )( A  B  C )

17
 Boolean Expressions and Truth Tables—
SOP Form

X  ABC  ABC  ABC

A B C X
0 0 0 0
0 0 1 1 ABC
0 1 0 0
0 1 1 0
1 0 0 1 A BC
EX . 1 0 1 0
1 1 0 0
X  ABC  A BC
1 1 1 1 ABC
18
 Boolean Expressions and Truth Tables—
POS Form

X  ( A  B  C)( A  B  C)( A  B  C)( A  B  C)( A  B  C)

A B C X
0 0 0 0 ( A  B  C)
0 0 1 1
0 1 0 0 ( A  B  C)
0 1 1 0 ( A  B  C)
1 0 0 1

EX . 1 0 1 0 ( A  B  C)
( A  B  C )( A  B  C )( A  B  C ) 1 1 0 0 ( A  B  C)
1 1 1 1

19
Combinational Logic Circuits

An example of an SOP implementation is shown. The SOP expression is

an AND-OR combination of the input variables and the appropriate
complements.

A
B ABC
C X = ABC + DE SOP

D
DE
E

20
Combinational Logic Circuits

When the output of a SOP form is inverted, the circuit is called an AND-
OR-Invert circuit. The AOI configuration lends itself to product-of-sums
(POS) implementation.

An example of an AOI implementation is shown. The output expression

can be changed to a POS expression by applying DeMorgan’s theorem
twice.

A
B ABC
C X = ABC + DE X = ABC + DE AOI

D X = (ABC)(DE) DeMorgan
E DE X = (A + B + C)(D + E) POS

21
Exclusive-OR Logic

Inputs Output
The truth table for an exclusive-OR gate is
A B X
Notice that the output is HIGH whenever A and B 0 0 0
disagree. 0 1 1
1 0 1
1 1 0
The Boolean expression is X = AB + AB

The circuit can be drawn as

A Symbols:

X =1

Distinctive shape Rectangular

B outline

22
Exclusive-NOR Logic
Inputs Output
The truth table for an exclusive-NOR gate is A B X
Notice that the output is HIGH whenever A and B 0 0 1
0 1 0
agree. 1 0 0
1 1 1
The Boolean expression is X = AB + AB

The circuit can be drawn as

A Symbols:
X
B
=1

Distinctive shape Rectangular

outline

23
NAND Logic

Convert the circuit in the previous example to one that

uses only NAND gates.

Recall from Boolean algebra that double inversion cancels. By adding

inverting bubbles to above circuit, it is easily converted to NAND gates:

A
C X= AC + AB
A
B

24
Universal Gates

NAND gates are sometimes called universal gates because they

can be used to produce the other basic Boolean functions.

A A A AB
B
Inverter AND gate

A A
A+B A+B
B B

OR gate NOR gate

25
NAND Logic

Recall from DeMorgan’s theorem that AB = A + B. By using

equivalent symbols, it is simpler to read the logic of SOP forms. The
earlier example shows the idea:

A
C X= AC + AB
A
B

The logic is easy to read if you (mentally) cancel the two connected
bubbles on a line.

26
NOR Logic

Alternatively, DeMorgan’s theorem can be written as A + B = A B.

By using equivalent symbols, it is simpler to read the logic of POS
forms. For example,

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

Again, the logic is easy to read if you cancel the two connected
bubbles on a line.

27