DIGITAL LOGIC

DESIGN (DLD)
EE-208412
CHAPTER:02
Boolean Algebra and Logic Gates
ALGEBRA
 What is an algebra?
 Mathematical system consisting of
 Set of elements
 Set of operators
 Axioms or postulates
BOOLEAN ALGEBRA
 An algebra that deals with Binary Variables
and Logical Operations.
GEORGE BOOLE
 Father of Boolean algebra
 Define algebra for binary values
 Developed by George Boole in 1854
 Three most basic operations of which are AND,
OR and NOT. It was these three functions that
formed the basis of his premise.
BOOLEAN ALGEBRA
 Variable
 Complement
 Literal
 BOOLEAN ADDITION &
MULTIPLICATION
 Boolean Addition performed by OR gate
 Sum Term describes Boolean Addition

 Boolean Multiplication performed by AND gate

 Product Term describes Boolean Multiplication
BOOLEAN ADDITION
 Sum of literals
A B A B A BC
 Sum term = 1 if any literal = 1
 Sum term = 0 if all literals = 0
BOOLEAN MULTIPLICATION
 Product of literals
A.B A.B A.B.C
 Product term = 1 if all literals = 1
 Product term = 0 if any one literal = 0
LAWS, IDENTITIES & THEOREMS
OF BOOLEAN ALGEBRA
 3 Laws
 12 Identities of Boolean Algebra
 DeMorgan’s Theorems
LAWS OF BOOLEAN ALGEBRA
 Commutative Law
for addition and multiplication
 Associative Law
for addition and multiplication
 Distributive Law
for multiplication over addition
for addition over multiplication
COMMUTATIVE LAW
 Commutative Law for Addition
A+B=B+A

 Commutative Law for Multiplication

A.B = B.A
ASSOCIATIVE LAW
 Associative Law for Addition
A + (B + C) = (A + B) + C
ASSOCIATIVE LAW
 Associative Law for Multiplication
A.(B.C) = (A.B).C
DISTRIBUTIVE LAW
 Distributive Law for Multiplication over
Addition
A.(B + C) = A.B + A.C
DISTRIBUTIVE LAW
 Distributive Law for Addition over
Multiplication
A + B.C = (A + B) . (A + C)
IDENTITIES OF BOOLEAN
ALGEBRA
1.
7. A.A
A + =0 A=A
2. A.
8. A + 1= =0 1 A
3. A.0
9. = =A 0 A
4. A
10. A.1
+ A.B
= A= A
5. A
11. A ++ A = =A A + B A.B
6. A.
12. A +(A+B)
A = 1= A
DEMORGAN’S THEOREMS
 First Theorem

A.B  A  B

 Second Theorem

A  B  A.B
DEMORGAN’S THEOREMS
 Any number of variables

X.Y.Z  X  Y  Z
 Combination of variables
X  Y  Z  X.Y.Z

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

 A.(B.C)  ( A.C).B  A.(B  C)  ( A  C).B
 A.B  A.C  A.B  B.C
 A.B  A.C  B.C
CONSENSUS THEOREM
1. xy + x’z + yz = xy + x’z
2. (x+y)•(x’+z)•(y+z) = (x+y)•(x’+z)
 Proof:
xy + x’z + yz = xy + x’z + (x+x’)yz
= xy + x’z + xyz + x’yz
= (xy + xyz) + (x’z + x’zy)
= xy + x’z
DUALITY PRINCIPLE
 The principle of duality says that if an
expression is valid in Boolean algebra, the
dual of that expression is also valid.
(Page#39 of Text Book)
(Example:2.3)
ALGEBRAIC MANIPULATION
 To minimize Boolean expressions
 Literal: a primed or unprimed variable (an input
to a gate)
 Term: an implementation with a gate
 The minimization of the number of literals and
the number of terms → a circuit with less
equipment
 It is a hard problem (no specific rules to follow)
 Example 2.1
1.x(x'+y) = xx' + xy = 0+xy = xy
2.x+x'y = (x+x')(x+y) = 1 (x+y) = x+y
3.(x+y)(x+y') = x+xy+xy'+yy' = x(1+y+y') = x
COMPLEMENT OF A FUNCTION
 Example 2.2

F1' = (x'yz' + x'y'z)'

COMPLEMENT OF A FUNCTION
 Solution

F1' = (x'yz' + x'y'z)' = (x'yz')' (x'y'z)'

= (x+y'+z) (x+y+z')
COMPLEMENT OF A FUNCTION
 Example 2.2

F2' = [x(y'z'+yz)]'
COMPLEMENT OF A FUNCTION
 Solution

F2' = [x(y'z'+yz)]' = x' + (y'z'+yz)'

= x' + (y'z')' (yz)'
= x' + (y+z) (y'+z')
= x' + yz' +y'z
SIMPLIFICATION USING
BOOLEAN IDENTITIES

Example:
AB + A(B+C) + B(B+C)
SIMPLIFICATION USING
BOOLEAN IDENTITIES
 AB + A(B+C) + B(B+C)
= AB + AB + AC + BB +BC
= AB + AC + B + BC
= AB + AC + B
= B + AC
SIMPLIFIED CIRCUIT
BOOLEAN ANALYSIS OF LOGIC
CIRCUITS
 Boolean Algebra provides concise way to
represent operation of a logic circuit
 Complete function of a logic circuit can be
determined by evaluating the Boolean
expression using different input combinations
BOOLEAN ANALYSIS OF LOGIC
CIRCUITS
A few Boolean Expressions:
 F = A + B.C
 F = (A.B) + (C.D)
 F = A.(B+C) + (D+A).B
 F = (A+B) . (C+D)A
BOOLEAN ANALYSIS OF LOGIC
CIRCUITS
Procedural steps:
 Identify the number of inputs
 Identify all possible combinations of inputs
 Draw Truth Table for the expression
 Implement the circuit using Gates
BOOLEAN ANALYSIS OF LOGIC
CIRCUITS

 From the expression, the output is a 1 if variable D

= 1 and ( AB  C) = 1
 ( AB  C)=1 if AB=1 or C=0
BOOLEAN ANALYSIS OF LOGIC
CIRCUITS
 No. of inputs = 4
 No. of possible combinations = 24 =16
 Truth Table with all required intermediate results.
 BOOLEAN ANALYSIS OF LOGIC
CIRCUITS
Inputs Output Inputs Output
A B C D F A B C D F
0 0 0 0 0 1 0 0 0 0
0 0 0 1 1 1 0 0 1 1
0 0 1 0 0 1 0 1 0 0
0 0 1 1 0 1 0 1 1 0
0 1 0 0 0 1 1 0 0 0
0 1 0 1 1 1 1 0 1 1
0 1 1 0 0 1 1 1 0 0
0 1 1 1 0 1 1 1 1 1
STANDARD FORMS OF
BOOLEAN EXPRESSIONS
 Sum-of-Products form
 Product-of-Sums form
STANDARD FORMS OF BOOLEAN
EXPRESSIONS
 Sum-of-Products form
AB + ABC
ABC + CDE + BCD
AB  ABC  AC
 Product-of-Sums form

( A  B)( A  B  C)
( A  B  C)(C  D  E)(B  C  D)
( A  B)( A  B  C)( A  C)
IMPLEMENTATION OF SOP
EXPRESSION
IMPLEMENTATION OF POS
EXPRESSION
CONVERSION OF GENERAL
EXPRESSION TO SOP FORM

AB  B(CD  EF)  AB  BCD  BEF

( A  B)(B  C  D)  AB  AC  AD  B  BC  BD

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