Basic Postulates

Duality
Fundamental Theorems
Simplification technique (Boolean Algebra)
Standard Forms of Boolean Expressions
Conversion to NAND/NAND and NOR/NOR network

1
CHAPTER 4
BOOLEAN ALGEBRA
Background
2
Boolean algebra is the mathematics of digital systems.

Terms used in Boolean algebra
A variable is a symbol used to represent a logical quantity.
Any single variable can have the value of 1 or 0.
The complement is the inverse of a variable and is indicated
by a bar over the variable.
The complement of the variable . If , then .
Sometimes a prime symbol is used to denote a complement of
a variable, .
A literal is a variable or the complement of the variable.

Background
3
Boolean Addition is the equivalent to the OR operation.
A sum term is the sum of literals. In logic circuits, a sum
term is produced by an OR operation with no AND
operations involved.
Ex. A + B , A + B + C + D
A sum term is equal to 1 when one or more of the literals
in the term are 1.
A sum term is equal to 0 only if each of the literals is 0
Background
4
Boolean Multiplication is the equivalent to the AND
operation.
A product term is the product of literals. In logic
circuits, a product term is produced by an AND operation
with no OR operations involved.
Ex. AB , ABCD
A product term is equal to 1 only if each of the literals
in the term is 1.
A product term is equal to 0 when one or more of the
literals are 0.


Basic Postulates (Laws)
5
Postulate 1: Definition
A Boolean algebra is a closed algebraic system containing a set K of
two or more elements and the two operators . and +

Postulate 2: Existence of 1 and 0 elements
a) a + 0 = a
b) a . 1 = a

Postulate 3: Commutativity
a) a + b = b + a
b) a . b = b . a

Basic Postulates
6
Postulate 4: Associativity
a) a + ( b + c ) = ( a + b ) + c
b) a . ( b . c ) = ( a . b ) . c

Postulate 5: Distributivity
a) a + ( b . c ) = ( a + b ) . ( a + c )
b) a . ( b + c ) = ( a . b ) + ( a . c )

Postulate 6: Existence of the complement
a) a + a = 1
b) a . a = 0




Duality
7
The principle of duality states that , if an expression is
valid in Boolean algebra, the dual of the expression is
also valid.

The dual expression is found by replacing all + operators
with . , all . operators with +, all 1s with 0s, and all 0s
with 1s.
Fundamental Theorems (Rules)
8
There are 9 fundamental theorems of Boolean algebra,
each of which rooted from the basic postulates.

Theorem 1: Idempotency
a) a + a = a
b) a . a = a

Theorem 2: Null elements for + and . operators
a) a + 1 = 1
b) a . 0 = 0





9
Theorem 3
a) a'' = a

Theorem 4: Absorption
a) a + ab = a
b) a (a + b) = a

Theorem 5
a) a + ab = a + b
b) a (a + b) = ab

Fundamental Theorems
10
Theorem 6
a) ab + ab = a
b) (a+b)(a+b) = a

Theorem 7
a) ab + abc = ab + ac
b) (a+b)(a+b+c) = (a+b)(a+c)


Fundamental Theorems
11
Theorem 8: DeMorgans theorem
a) (a+b) = ab
b) (ab) = a + b

Theorem 9: Consensus
a) ab + ac +bc = ab + ac
b) (a+b)(a+c)(b+c) = (a+b)(a+c)

Fundamental Theorems
Simplification of Boolean Expression
12
13
Truth Table
A B C
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 0
14
Simplification of Boolean Expression
15
Simplification of Boolean Expression
16
Truth Table
A B C
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 0
C B A
Standard Forms of Boolean Expressions
17
We can express the algebraic function in the form of
algebraic expressions, truth tables, Venn diagrams,
SOP/POS form and also the standard forms (canonical
forms).

All Boolean expression, regardless of their form, can be
converted into either one of the two standard forms:
sum-of-products (SOP) form, or
product-of-sum (POS) form.

Standardization makes the evaluation, simplification, and
implementation of Boolean expressions more systematic.

Domain of a Boolean expression
18
The domain of a general Boolean expression is the set
of variables contained in the expression either in
complemented or uncomplemented form. Example, the
domain of the expression ABC + ACD +BD is the set
of variables A, B, C, D.

f ( A, B, C, D ) = ABC + ACD +BD
The Sum-of-Products (SOP) form
19
SOP : A function where each product term is formed by
adding a number of complemented or uncomplemented
variables (literal).

Ex: f(A, B, C, D) = ABC + BD + ACD

In an SOP expression, a single overbar cannot extend
more than one variable, although more than one variable
in a term can have an overbar. For example, an SOP
expression can have the term but not .

The Sum-of-Products (SOP) form
20
Any logic expression can be changed into SOP form by
applying Boolean algebra techniques.

Ex.


Canonical SOP
21
Also known as the Standard Sum-of-Products form
A standard SOP expression is one in which all the
variables in the domain appear in each product term in
the expression. Any nonstandard SOP can be converted
to the standard SOP form using Boolean algebra.
Ex. Represent the following Boolean function in the
canonical SOP form:


Canonical SOP
22

=

=

Now look at each product terms and find for missing domain,

AB (missing C & D). Thus, add these domains into the term

AB = AB (C+C)(D+D)
= (A B C + A B C)(D + D)
= ABCD + ABCD + ABCD + ABCD
Canonical SOP
23
CD (missing A & B).

CD = CD (A+A)(B+B)
= (ACD + ACD)(B+B)
= ABCD + ABCD + ABCD + ABCD

Next, combine all these product terms,

Canonical SOP
24
AB + ABCD + CD
= ABCD + ABCD + ABCD + ABCD + ABCD + ABCD +
ABCD + ABCD + ABCD
= ABCD + ABCD + ABCD + ABCD + ABCD + ABCD +
ABCD

Canonical SOP
25
For a switching function with n variables, if a product
term contains each of the n variables exactly one time in
complemented or uncomplemented form, the product
term is called a minterm.

Minterm function is called as canonical sum-of-products
form (canonical SOP) or the standard sum-of-products.
Ex1: f(A,B,C) = ABC + ABC +ABC +ABC

An SOP expression is equal to 1 only if one or more of
the product terms in the expression is equal to 1.

The Product-of-Sums (POS) form
26
A function by taking the product of ORing (sum terms)
where each sum term is formed by ORing a number of
complemented or uncomplemented variables.

Ex: f(A, B, C, D) = (A+B+C)(B+C+ D)(A+ C+ D)

In a POS expression, a single overbar cannot extend
more than one variable, although more than one variable
in a term can have an overbar. For example, a POS
expression can have the term but not
.

Canonical POS
27
Also known as Standard Product-of-Sums form

A standard POS expression is one in which all the
variables in the domain appear in each sum term in the
expression. Any nonstandard SOP can be converted to
the standard SOP form using Boolean algebra.

Ex2. Express the function (A + B)(B + C) into canonical
POS form


Canonical POS
28
The terms are already in pos form. So inspect for missing
domain from each sum terms and add the domain.

(A + B) is missing domain C ;
A + B = A + B + C C
= (A + B + C)(A + B + C)
( B + C) is missing domain A ;
B + C = AA + B + C
= (A + B + C)(A + B + C)

Therefore, (A+B)(B+C) in standard POS form is



For a switching function with n variables, if a sum term
contains each of the n variables exactly one time in
complemented or uncomplemented form, the sum term is
called a maxterm.

Thus, maxterm function is called as canonical product-of-
sums form (canonical POS) or the standard product-of-sums.
Ex: f(A,B,C)= (A+B+C)(A+B+C)(A+B+C)(A+B+C)

Canonical POS
29
Canonical Forms
30
A POS expression is equal to 0 only if one or more
of the sum terms in the expression is equal to 0.

An SOP expression is equal to 1 only if one or more
of the product terms in the expression is equal to 1.

31
Decimal
A B C
f
(A,B,C)
Minterms Maxterms
0 0 0 0 0 ABC m0 A+B+C M0
1 0 0 1 0 ABC m1 A+B+C M1
2 0 1 0 1 ABC m2 A+B+C M2
3 0 1 1 1 ABC m3 A+B+C M3
4 1 0 0 0 ABC m4 A + B+C M4
5 1 0 1 0 ABC m5 A+B+C M5
6 1 1 0 1 ABC m6 A+B+C M6
7 1 1 1 1 ABC m7 A+B+C M7
Ex3: Truth table for a function of 3 variables,
From the truth table, determining standard SOP form
for the function f :
Compact form: f(A,B,C) = m
2
+ m
3
+ m
6
+ m
7


Minterm list form: f(A,B,C) =

Standard SOP form: f(A,B,C) =

32
) 7 , 6 , 3 , 2 ( m

C B A C B A C B A C B A
Determining standard POS form for the function f :
Compact form: f(A,B,C) = M
0
M
1
M
4
M
5


Maxterm list form: f(A,B,C) =

Standard POS form: f(A,B,C) =

) 5 , 4 , 1 , 0 ( M

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