Lec 08

Lecture No.
8
Boolean Algebra and Logic Simplification
Digital Logic & Design
Dr. Waseem Ikram
Lecture08
Recap
 Operational Characteristics
 DC Supply Voltage
 Noise Margin
 Power Dissipation
 Frequency Response
 Fan Out
TTL Series
74 74S 74LS 74AS 74ALS 74F
Performance Rating
Propagation Delay (ns) 9 3 9.5 1.7 4 3
Power Dissipation (mW) 10 20 2 8 1.2 6
Speed-Power product 90 60 19 13.6 4.8 18

(pJ)
Max. Clock Rate (MHz) 35 125 45 200 70 100
Fan-out (same series) 10 20 20 40 20 33

CMOS Series
74HC 74AC 74AHC

Propagation Delay (ns) 18 5 3.7
Power Dissipation (mW) Static 0.00275 0.0055 0.00275
Power Dissipation (mW) at 100KHz 0.0625 0.08 0.0625
Speed-Power product (pJ) at 100KHz 1.125 0.4 0.23
Max. Clock Rate (MHz) 50 160 170
74LV 74LVC 74ALVC

Propagation Delay (ns) 9 4.3 3
Power Dissipation (mW) Static 0.0016 0.0008 0.0008
Max. Clock Rate (MHz) 90 100 150
Boolean Algebra
 Variable
 Complement
 Literal
ABC
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, Rules & Theorems of Boolean
Algebra
 Commutative Law
for addition and multiplication
 Associative Law
for addition and multiplication
 Distributive Law
 Rules of Boolean Algebra
 Demorgan’s Theorems
Commutative Law
 Commutative Law for Addition
A+B=B+A
A B
A+B A+B
B A
 Commutative Law for Multiplication

A.B = B.A
A B
A.B A.B
B A
Associative Law
 Associative Law for Addition
A + (B + C) = (A + B) + C
A A
A+(B+C)
A+B
B
B
(A+B)+C
B+C C
C
Associative Law
 Associative Law for Multiplication
A.(B.C) = (A.B).C
A A
A.(B.C)
A.B
B
B
(A.B).C
B.C C
C
Distributive Law
A.(B + C) = A.B + A.C
A A
A.(B+C)
A.B
B
B
A A.B+A.C
B+C
C A.C
C
Rules of Boolean Algebra
1. A+0=A 7. A.A = A
2. A+1=1 8. A. A = 0
3. A.0 = 0 9. =A
A
4. A.1 = A 10. A + A.B = A
5. A+A=A 11. A+ =A+B
6. A+ =1 12.
A.B
(A+B).(A+C)
A = A+B.C
Demorgan’s Theorems
 First Theorem
A.B  A  B
A A
A.B A B
B B
 Second Theorem
A  B  A.B
A A
A B A.B
B B
Demorgan’s Theorems
 Any number of variables
X.Y.Z  X  Y  Z
X  Y  Z  X.Y.Z
 Combination of variables
( 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
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
A
AB
B
AB  C
C C
( AB  C)D
D
 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
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
Simplification using Boolean
Algebra
Simplification using Boolean
Algebra
 AB + A(B+C) + B(B+C)
= AB + AB + AC + BB +BC
= AB + AC + B + BC
= AB + AC + B
= B + AC
Simplified Circuit
A
AB+A(B+C)+B(B+C)
B
C
B B+AC
A
C
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
A
D
B+AC+AD
B
A
C
Implementation of POS expression
A
B (A+B)(B+C+D)(A+C)
B
C
AD
C
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

Lec 08

Uploaded by

Copyright:

Available Formats

Lec 08

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lec 08

Uploaded by

Copyright:

Available Formats

Lecture No.

Dr. Waseem Ikram

74 74S 74LS 74AS 74ALS 74F

Propagation Delay (ns) 9 3 9.5 1.7 4 3

Power Dissipation (mW) 10 20 2 8 1.2 6

Speed-Power product 90 60 19 13.6 4.8 18

Fan-out (same series) 10 20 20 40 20 33

74HC 74AC 74AHC

74LV 74LVC 74ALVC

Boolean Addition & Multiplication

 Boolean Multiplication performed by AND gate

 Commutative Law for Multiplication

 From the expression, the output is a 1 if

Inputs Output Inputs Output

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

You might also like