MODULE II
Syllabus
Module 2: BOOLEAN ALGEBRA & LOGIC GATES (9 Hours)
Boolean Algebra - Postulates of Boolean algebra - Canonical and Standard Forms -Simplification
of Boolean Functions using Karnaugh Map - Product-of-Sums Simplification— Don’t-Care
Conditions – Quine –McClusky minimization technique – Basic Gates-Universal Gates.
Boolean Algebra
• A convenient and systematic way of expressing and analyzing the operations of logic
circuits
• Mathematics of digital systems
Terms used in Boolean algebra:
• Variable – Symbol used to represent a logical quantity with a value 1 or 0. (Uppercase
letter)
• Complement – Inverse of a variable
• Literal- Variable or its complement
AND
OR
NOT
Postulates of Boolean algebra
Complementation(NOT) Laws
AND Laws
OR Laws
Commutative laws
A+B = B+A
A.B=B.A
Truth Table for A+B = B+A (as proof)
A B A+B B+A
0 0 0 0
0 1 1 1
1 0 1 1
1 1 1 1
Truth Table for A.B=B.A (as proof)
A B A.B B.A
0 0 0 0
0 1 0 0
1 0 0 0
1 1 1 1
Associative Laws
A+(B+C)=(A+B)+C
A(BC) =(AB)C
Distributive Law
A(B+C) =A.B+A.C =AB+AC
Basic Rules of Boolean Algebra
Rule 10: A+AB=A
Proof:
DeMorgan’s Theorems
HW-1
Simplification of Boolean expressions:
= AB +AB+AC+BB+BC
= AB+AC+B+BC
= AB+AC+ (B+BC)
=AB+AC+B
=(AB+B)+AC =B+AC
HW-2
Consensus Theorem
Q1.Simplify the Boolean expression: [AB ̅ ̅̅̅
̅ (C+BD)+ A B] C
Q2. Simplify the Boolean expression:
̅ BC+AB
A ̅ C̅ + A
̅ B̅ C̅ + AB̅ C+ABC
BC+AB`+A`B`C` = BC+B`(A+A`C`)= BC+B`(A+C`)
Rule: A+A`B=A+B
Q3.Simplify the Boolean expression:(AB+AC)` +A`B`C
=(AB)`(AC)`+A`B`C
=(A`+B`) (A`+C`)+A`B`C
=A`A`+B`A`+B`C`+A`C`+A`B`C
=A`+(A`B`+A`B`C)+B`C`+A`C`
=A`+A`B`+B`C`+A`C`
=A`+B`C`+A`C` =A`+B`C`
Canonical and Standard Forms
Examples:
A`B`+AB+A`B →SOP
(A`+B`)(B+A`) →POS
Procedure to convert a boolean expression in SOP to Standard SOP form
Converting Boolean expression to Std. SOP form:
AB`C+A`B`+ABC`D
AB`C→ AB`C(D+D`) →AB`CD+AB`CD`
A`B`→A`B`(C+C`)→ A`B`C (D+D`)+A`B`C`(D+D`)
SOP form of AB`C+A`B`+ABC`D→
AB`CD+AB`CD`+A`B`CD+A`B`CD`+A`B`C`D+ A`B`C`D` +ABC`D
→AB`CD+AB`CD`+A`B`CD+A`B`CD`+A`B`C`D+A`B`
C`D`+ABC`D
An SOP expression is equal to 1 only if one or more of the
product terms in the expression is equal to 1
Convert the Boolean expression to standard SOP form
A+BC`+ABD`+ABCD
→ABCD+ABCD`+ABC`D+ABC`D`+AB`CD+AB`CD`+AB`C`D+AB`C`D`+A`B
C`D+A`BC`D`
4→0100→A`BC`D`
➔ m15+m14+ m13+ m12+ m11 +m10 +m9 +m8 +m5
+m4
=∑m(4,5,8,9,10,11,12,13,14,15) →SOP
ΠM(0,1,2,3,6,7) →POS maxterms
HW-1
Expand A(B`+A)B to minterms
Determine the standard SOP expression and POS expression from the Truth table:
X=A`BC+AB`C`+ABC`+ABC →SOP Expression
X=(A+B+C)(A+B+C`)(A+B`+C)(A`+B+C`) →POS Expression
Inputs in TT for which output is 0.
KARNAUGH MAP
2-Variable K-Map
Eg1:
SOP→ A`B`+AB`+AB --minimized expression→A+B`
AB
00
01
10
11
Eg2:
m1+m2=∑m(1,2) =AB`+A`B
3 Variable K-Map (SOP)
4-Variable K-Map (SOP)
Mapping a Standard SOP Expression:
Karnaugh Map Simplification of SOP Expression:
a) A`B`C`+BC+AB b) B`+A`C`+AC c) A`C`+A`B+AB`D d) D`+BC`+AB`C
Q1:
B`+A`C
Q2.
B`C`D`→(B`C`D`)(A+A`)→AB`C`D`+A`B`C`D`
Mapping K-Map from a Truth Table:
Don’t care conditions:
BASIC LOGIC GATES
• The term logic is applied to digital circuits used to implement logic functions.
• Several kinds of digital logic circuits are the basic elements that form the building blocks for
such complex digital systems as the computer.
• Three basic logic operations are NOT, AND and OR
• A circuit that performs a specified logic operation is called a logic gate
• Lines on the left of each symbol are inputs and lines on the right of each symbol are outputs.
• AND and OR gates can have any number of inputs
Timing diagram
Truth Table of a 2-input AND Gate
Timing Diagram
AND Gates with multiple inputs
Truth Table of a 2-input OR Gate
OR Gate with Multiple inputs
Timing Diagram
UNIVERSAL GATES
NAND GATE (NOT-AND) BUBBLED OR
TRUTH TABLE-
Eg: timing diagram
NOR GATE (NOT- OR ) (bubbled AND)
TRUTH TABLE
TIMING DIAGRAM EXAMPLE
EXCLUSIVE OR (XOR) GATE
TRUTH TABLE
X=A`B+AB`
EXCLUSIVE NOR GATE(XNOR)
X=A`B`+AB
Determine the standard SOP expression from the Truth table:
X=A`BC+AB`C`+ABC`+ABC
Mapping SOP expression on a K-map
Q1:
Step1: Expand the terms numerically
Step2: Map the above binary values by placing 1 in each of the corresponding cells
in the K-Map
Q2:
K-Map POS Minimization:
Eg:1
The expression can be written as:
Q2:
Q3:
Note: Expand first term to get standard POS expression
(A`+B+C+D) (A+B+C+D)
H.W Using K-map simplify following Boolean expression & give implementation of the same
using gates: F(A,B,C,D)=∑(2,4,8,15)+∑d(0,3,9,12)
QUINE McCLUSKY (TABULAR) METHOD
Prime Implicants table
