Introduction To Boolean Algebra

By
Prof. S. K. Dash
School Of Electronics Engineering
KIIT Deemed to be University
 Boolean Algebra
 Boolean algebra is a mathematical system for the manipulation of variables
that can have one of two values.
 In formal logic, these values are “true” and “false.”
 In digital systems, these values are “on” and “off,” 1 and 0, or “high”
and “low.”
 Variables and their complements are sometimes called literals
 Boolean expressions are created by performing operations on Boolean
variables.
 A Boolean operator can be completely described using a truth table.
 A Boolean algebra comprises...
 A set of elements ( A, X, etc)
 Binary operators {+ , •} Boolean sum and product
 A unary operation { ' } (or { }) example: A’ or A

KIIT Deemed to be University

 Boolean Algebra
Axioms & laws of Boolean Algebra

0.0 = 0 0+0=0 0’ = 1 A.0 =0 A+0=A

0.1=0 0 +1=1 1’ = 0 A.1 =A A+1 =1

1.0=0 1+0=1 A= 0=> A.A=A A+A=A

A’=1

1.1=1 1+1=1 A= 1=> A . A’ = 0 A + A’ = 1

A’=0

KIIT Deemed to be University

 Boolean Algebra
Duality
 All Boolean expressions have logical duals
 Any theorem that can be proved is also proved for its dual
 Replace: • with +, + with •, 0 with 1, and 1 with 0
 Leave the variables unchanged
 A + A’B + 0 = A + B Its dual will be A . (A’ + B) . 1 = A . B
De Morgan’s Theorem
 Procedure for complementing Boolean functions
 Replace: • with +, + with •, 0 with 1, and 1 with 0
 Replace all variables with their complements
 (A + B)’ = A’ . B’ (A . B)’ = A’ + B’
 F=(A + B) • ( A’ + C ),
 So F’ = (A’ • B’ ) + ( A • C’ )

KIIT Deemed to be University

 Boolean Algebra
Laws & theorems:
Identity: X + 0 = X Dual: X • 1 = X
Null: X+1=1 Dual: X • 0 = 0
Idempotent: X+X=X Dual: X • X = X
Involution: (X')' = X
Complementarity: X + X' = 1 Dual: X • X' = 0
Commutative: X+Y=Y+X Dual: X • Y = Y • X
Associative: (X+Y)+Z=X+(Y+Z) Dual: (X•Y)•Z=X•(Y•Z)
Distributive: X•(Y+Z)=(X•Y)+(X•Z)
Dual: X+(Y•Z)=(X+Y)•(X+Z)
Uniting: X•Y+X•Y'=X Dual: (X+Y)•(X+Y')=X

KIIT Deemed to be University

 Boolean Algebra
Absorption: X + X • Y = X Dual: X • ( X + Y ) = X

Redundant Literal: X + X’Y = X + Y Dual: X . (X’ + Y) = X . Y

Consensus: (X • Y ) + ( X'•Z ) + ( Y • Z ) = X • Y + X‘ • Z
Dual: (X+Y)•(Y+Z)•(X'+Z)=(X+Y)•(X'+Z)
Transposition: ( X + Y) • ( X‘ + Z ) = X • Z + X‘ • Y
Dual: X•Y+X'•Z=(X+Z)•(X'+Y)

KIIT Deemed to be University

 Logic Gates
 Logic gates are fundamental building block of any digital
system.
 It is called so because of its ability to make decisions.
 There are 3 type of basic gate.
1) And 2) Or 3) Not
 There are 2 type of universal gate.
1) Nand 2) Nor

KIIT Deemed to be University

 Logic Gates
Input & output of logic gates can occur in two level.
a) High or Low
b) True or False
c) On or Off
d) 1 or 0
 Positive logic System
Higher of two voltage levels treated as 1 & lower level is
treated as 0.
Eg: 5V  logic 1 0V logic 0
 Negative logic System
Higher of two voltage levels treated as 0 & lower level is
treated as 1.
Eg: 5V  logic 0 0V logic 1
KIIT Deemed to be University
 Logic Gates
The three simplest gates are the AND, OR, and NOT gates.

They correspond directly to their respective Boolean

operations, as you can see by their truth tables.

KIIT Deemed to be University

 Logic Gates
NAND and NOR are two very important gates.

KIIT Deemed to be University

 Logic Gates
 NAND and NOR are known as universal gates because they are
inexpensive to manufacture and any Boolean function can be constructed
using only NAND or only NOR gates.
 XOR & XNOR using minimum number of NAND & NOR gates.

KIIT Deemed to be University

 Logic Gates
Another very useful gate is the exclusive OR (XOR) & XNOR.

The output of the XOR operation is true only when the values
of the inputs differ.
The output of the XNOR operation is true only when the
values of the inputs are same.
Problem : XOR & XNOR as buffer & inverter??

KIIT Deemed to be University

 Logic Gates
3 input Xor

A B C F

0 0 0 0

0 0 1 1

0 1 0 1

0 1 1 0

1 0 0 1

1 0 1 0

1 1 0 0

1 1 1 1

KIIT Deemed to be University

 Reduced Boolean Expression
Example:
Z = A'BC + AB'C' + AB'C + ABC' + ABC

= A'BC + AB'(C’ + C) + AB(C' + C)

= A'BC + AB’ + AB
= A'BC + A(B' + B)
= A'BC+ A
= BC + A

KIIT Deemed to be University

 Reduced Boolean Expression
Example:

F = (A + BC)(AB’ + ABC)
=(A’ . BC’’)(AB’ + ABC)
=A’BC.A.(B’+BC) = 0
Example:
Prove that F= ( A’B’ + B’C’ + A’D’ + CD) = B’C’ + A’D’ + CD
Sol: F= A’B’ + B’C’ + A’D’ + CD
=A’B’ + B’C’ + A’D’ + CD + B’D
= B’C’ + A’D’ + CD + B’D
= B’C’ + A’D’ + CD

KIIT Deemed to be University

 Boolean Function Representation
A function of n Boolean variable denoted by f(A,B ...)
is another variable & takes one of two possible values
0 or 1.
There are different ways to represent a given
function.
Truth table form

Sum of product(SOP)

Product of Sum(POS)

Standard SOP or Canonical SOP

Standard POS or Canonical POS

KIIT Deemed to be University

 Boolean Function Representation
Truth table form:
The function is specified by listing all possible input
combination.

KIIT Deemed to be University

 Boolean Function Representation
Sum of Product:
Example:
f(A, B, C) = AB + A’C + AB’C’
Product of sum:
f(A, B, C) = (A+B) (A’+C) (A+B’+C’)
Standard Sum of Product:
f(A, B, C) = ABC + A’B’C + AB’C’
Standard Product of sum:
f(A, B, C) = (A+B+C’) (A’+B+C) (A+B’+C’)

KIIT Deemed to be University

 Minterm & Maxterm
Minterm: a product term in which all the variables appear exactly
once, either complemented or uncomplemented
Maxterm: a sum term in which all the variables appear exactly once,
either complemented or uncomplemented

A B A’B’ A’B AB’ AB A+B A+B’ A’+B A’+B’

0 0 1 0 0 0 0 1 1 1
0 1 0 1 0 0 1 0 1 1
1 0 0 0 1 0 1 1 0 1
1 1 0 0 0 1 1 1 1 0

A’B’ = m0 AB’=m2 A + B = M0 A’ + B = M2
A’B = m1 AB = m3 A + B’ = M1 A’ + B’ = M3
KIIT Deemed to be University
Truth Table notation for Minterms and Maxterms

Minterm =Maxterm’

KIIT Deemed to be University

 Example
Truth table for f1(a,b,c) at right a b c f1
The canonical sum-of-
0 0 0 0
products form for f1 is
f1(a,b,c) = m1 + m2 + m4 + m6 0 0 1 1
= a’b’c + a’bc’ + ab’c’ + abc’
0 1 0 1
The canonical product-of-
0 1 1 0
sums form for f1 is
f1(a,b,c) = M0 • M3 • M5 • M7 1 0 0 1
=(a+b+c)(a+b’+c’)(a’+b+c’)
(a’+b’+c’). 1 0 1 0
f1(a,b,c) = ∑ m(1,2,4,6)
1 1 0 1
= ∏ M(0,3,5,7)
1 1 1 0
Observe that: mj = Mj’
KIIT Deemed to be University
 Conversion Between Canonical Forms
Replace ∑ with ∏ (or vice versa) and replace those j’s that
appeared in the original form with those that do not.
Example:
f1(a,b,c) = a’b’c + a’bc’ + ab’c’ + abc’
= m1 + m2 + m4 + m6
= ∑(1,2,4,6)
= ∏(0,3,5,7)
= (a+b+c)•(a+b’+c’)•(a’+b+c’)•(a’+b’+c’)

KIIT Deemed to be University

 Conversion of SOP to canonical form
Expand non-canonical terms by inserting equivalent
of 1 in each missing variable x:
(x + x’) = 1
Remove duplicate minterms
f1(a,b,c) = a’b’c + bc’ + ac’
= a’b’c + (a+a’)bc’ + a(b+b’)c’
= a’b’c + abc’ + a’bc’ + abc’ + ab’c’
= a’b’c + abc’ + a’bc’ + ab’c’

KIIT Deemed to be University

Conversion of POS to canonical form
Expand noncanonical terms by adding 0 in terms of
missing variables (e.g., xx’ = 0) and using the
distributive law
Remove duplicate maxterms
f1(a,b,c) = (a+b+c)•(b’+c’)•(a’+c’)
= (a+b+c)•(aa’+b’+c’)•(a’+bb’+c’)
= (a+b+c)•(a+b’+c’)•(a’+b’+c’)•
(a’+b+c’)•(a’+b’+c’)
=
(a+b+c)•(a+b’+c’)•(a’+b’+c’)•(a’+b+c’)

KIIT Deemed to be University

 Conversion Between Canonical Forms
• f(a,b,c,d) = a’(b’+d) + acd’ ?
= a’b’ +a’d + acd’
= a’b’(c+c’)(d+d’) + a’d(b+b’)(c+c’) + acd’(b+b’)
= a’b’c’d’ + a’b’c’d + a’b’cd’ +a’b’cd + a’bc’d + a’bcd

+ abcd’ +ab’cd’

= Σm(0,1,2,3,5,7,10,14)
What is the maxterm expansion for f?
f(a,b,c,d) = Σm(0,1,2,3,5,7,10,14)
= ∏ M(4,6,8,9,11,12,13,15) = ?????
KIIT Deemed to be University
 Conversion of AOI logic to
NAND/NOR logic
1. Draw the circuit in AOI logic.
2. If NAND is chosen, add a circle at o/p of each and gate
& at i/p to all or gate.
3. If NOR is chosen, add a circle at o/p of each or gate & at
i/p to all and gate.
4. Add an inverter on each line that received a circle in step
2 0r 3.
5. Replaced bubbled and gate by NOR gate & bubbled or
gate by NAND gate.
6. Eliminate any double inversion.

KIIT Deemed to be University

Conversion of AOI logic to NAND
logic

KIIT Deemed to be University

XOR & XNOR Using Minimum No. Of gate

KIIT Deemed to be University

 Example

KIIT Deemed to be University

Example

KIIT Deemed to be University

 Example
Express the function as sum of minterms & product of
max term?
F(A,B,C,D)= B’D + A’D + BD

KIIT Deemed to be University