Logic Design I (17.341) Fall 2011 Lecture...
Transcript of Logic Design I (17.341) Fall 2011 Lecture...
![Page 1: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/1.jpg)
Logic Design I (17.341)
Fall 2011
Lecture Outline
lClass # 02
September 19, 2011
Dohn Bowden
1
![Page 2: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/2.jpg)
Today’s Lecture
• Administrative
• Main Logic Topic
• Homework
2
![Page 3: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/3.jpg)
CCoursed iAdmin
3
![Page 4: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/4.jpg)
Administrative
• Admin for tonight …
– Syllabus Review
– 17 341 Web Site17.341 Web Site
– Email List creation
4
![Page 5: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/5.jpg)
Syllabus
• Syllabus
– One update … remove some material for class #1
• Too much for the first class!!!
5
![Page 6: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/6.jpg)
Syllabus ReviewWeek Date Topics Chapter Lab Report Due
1 09/12/11 Introduction to digital systems and number systems 1
2 09/19/11 Binary Codes and Boolean Algebra 2
3 09/28/11 Boolean Algebra (continued) 3
4 10/03/11 Examination 1
X 10/10/11 No Class - Holiday
5 10/17/11 Application of Boolean Algebra. Lab lecture 4
6 10/24/11 K h M 56 10/24/11 Karnaugh Maps 5
7 10/31/11 Multi-Level Gate Circuits. NAND and NOR Gates 7 1
8 11/07/11 Examination 2
9 11/14/11 Combinational Circuit Design and Simulation Using 8 29 11/14/11 Combinational Circuit Design and Simulation Using Gates
8 2
10 11/23/11 Multiplexers, Decoders. Encoder, and PLD 9
11 11/28/11 Introduction to VHDL 10 3
12 12/05/11 Examination 3
13 12/12/11 Review 4
14 12/19/11 Final Exam
6
![Page 7: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/7.jpg)
Access to Computer Lab and/or Engineering Lab
• To gain access to the Computer Lab (BL-420) … and/OR … the Engineering Lab (EB-321) …Engineering Lab (EB 321) …
– You will need to have an access cards
– Access cards are given out at Access Services
• Arrangements are done through the Continuing Education Office
– Then I will need your UMS# (will be on your Access Card)
– I will then send your name and UMS# to the Room POC
7
I will then send your name and UMS# to the Room POC
![Page 8: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/8.jpg)
Email Distribution List
• Did you receive my test email????
– No … then see me and resend another email …
• Email me at:
8
![Page 9: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/9.jpg)
Questions?
9
![Page 10: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/10.jpg)
Ch t 2Chapter 2 …
Boolean Algebra
10
![Page 11: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/11.jpg)
Objectives
11
![Page 12: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/12.jpg)
Objectives
• Familiar with first 12 of 15 laws and theorems of Boolean algebra
• You should be able to …
1. Understand the basic operations and laws of Boolean algebra
2. Relate these operations and laws to … • Circuits composed of AND gates, OR gates, and INVERTERS• Circuits composed of switches
3. Prove any of these laws using a truth table
12
![Page 13: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/13.jpg)
Objectives
4. Apply these laws to the manipulation of algebraic expressions including …including …
a) Multiplying out an expression to obtain a sum of products (SOP)(SOP)
b) Factoring an expression to obtain a product of sums (POS)
c) Simplifying an expression by applying one of the laws
d) Finding the complement of an expression
13
![Page 14: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/14.jpg)
Introduction
14
![Page 15: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/15.jpg)
Introduction
• Boolean algebra …
– The basic mathematics needed for the study of the logic design of digital systems
• Switching circuits are essentially …
– Two-state devices …such as …
• A transistor with high or low output voltageA transistor with high or low output voltage
• We will study the special case of Boolean algebra in which all of the variables assume only one of two values Referred to as switchingvariables assume only one of two values … Referred to as switching algebra
15
![Page 16: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/16.jpg)
Introduction
• Boolean variable … such as X or Y …
– Represents the input or output of a switching circuit
• Assume these variables can take on only two different values
– Symbols “ 0” and “ 1”
• If X is a Boolean (switching) variable …then …
– Either X = 0 … or … X = 1
16
![Page 17: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/17.jpg)
Introduction
• Symbols “ 0” and “ 1” … do not …
– Have a numeric value
• They represent two different states
– In a logic gate circuit … “0” represents a range of low g g gvoltages … and …
– “1” represents a range of high voltages1 represents a range of high voltages
17
![Page 18: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/18.jpg)
Introduction
• For Switch circuits …
– “0” … represents an open switch … and … – “1” represents a closed circuit
• In general “0” and “1” can be used to represent …
– The two states in any binary-valued system
18
![Page 19: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/19.jpg)
Basic Operations
19
![Page 20: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/20.jpg)
Basic Operations
• Basic operations …
– AND
– OR
– Complement .. or … Inverse
20
![Page 21: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/21.jpg)
Complement
21
![Page 22: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/22.jpg)
Complement
• The complement of …
– 0 … is … 1
– 1 … is … 0
• Symbolically … where the prime (') denotes complementation
0' = 1
and
1' 01' = 0 22
![Page 23: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/23.jpg)
Complement
• X is a switching variable … therefore …
X' = 1 … if … X = 0
and
X' = 0 … if … X = 1
23
![Page 24: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/24.jpg)
Complement
• Complementation is inversion
• Electronic circuit which forms the inverse of X is …
– An inverter
24
![Page 25: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/25.jpg)
AND operation
25
![Page 26: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/26.jpg)
AND operation
• The AND operation … where “•” denotes AND …
0 • 0 = 0 0 • 1 = 0 1 • 0 = 0 1 • 1 = 1
• This is not binary multiplication …
– Because 0 and 1 are Boolean constants rather than binaryBecause 0 and 1 are Boolean constants rather than binary numbers
26
![Page 27: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/27.jpg)
AND operation
• Boolean expression …
C = A • B
• Given the values of A and B …
– C can be determine from the following table …g
• C = 1 … if and only if … A and B are both 1 27
![Page 28: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/28.jpg)
AND operation
• Logic gate that performs the AND operation …
• C = 1 … if and only if …
» A and B are both 1» A and B are both 1
28
![Page 29: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/29.jpg)
AND operation
• The dot symbol (•) is frequently omitted
• Write …
AB … instead of … A•B
• The AND operation is also referred to as logical (or Boolean) gmultiplication
29
![Page 30: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/30.jpg)
OR operation
30
![Page 31: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/31.jpg)
OR operation
• The OR operation can be defined as follows …
0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 1
• “+” denotes OR
31
![Page 32: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/32.jpg)
OR operation
• C = A + B … C can be determine from the following table …
• C = 1 if and only if A or B (or both) are 1
32
![Page 33: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/33.jpg)
OR operation
• Logic gate that performs the OR operation …
• C = 1 if and only if …
» A or B (or both) are 1» A or B (or both) are 1
• The OR operation is also referred to as logical (or Boolean) addition
33
![Page 34: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/34.jpg)
Switches
34
![Page 35: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/35.jpg)
Switches
• Applying switching algebra to circuits containing switches
• Each switch is labeled with a variable
– If switch X is open … the value of X is 0
– If switch X is closed … the value of X is 1
35
![Page 36: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/36.jpg)
Switches
• Two switches in series …
• Closed circuit between terminals 1 and 2 (T = 1) iff (if and only if) switch A is closed and switch B is closedswitch A is closed and switch B is closed
• Algebraically …
» T AB» T = AB
36
![Page 37: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/37.jpg)
Switches
• Two switches in parallel …
• Closed circuit … between terminals 1 and 2 … iff switch A is closed … or … switch B is closed
• Algebraically …
» T A + B» T = A + B
37
![Page 38: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/38.jpg)
Switches
• Therefore …
– Switches in a series perform the AND operation …
– Switches in parallel perform the OR operation
38
![Page 39: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/39.jpg)
Boolean ExpressionsBoolean Expressions and
Truth Tables
39
![Page 40: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/40.jpg)
Boolean Expressions
40
![Page 41: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/41.jpg)
Boolean Expressions
• Boolean expressions are formed by …
– Application of the basic operations to one or more variables or constants
• The simplest expressions consist of a …
– Single constant or variable …
• 00• X• Y’
41
![Page 42: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/42.jpg)
Boolean Expressions
• More complicated expressions are formed by …
– Combining two or more other expressions using …
» AND» OR» Or by complementing another expressiong
• Examples …
AB' + C
[A(C D)]' BE[A(C + D)]' + BE 42
![Page 43: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/43.jpg)
Boolean Expressions
• Order in which the operations are performed …
– Parentheses are added as needed to specify the order
– When parentheses are omitted … the order is …
» Complementation
» AND
» OR
43
![Page 44: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/44.jpg)
Boolean Expressions
• Example … the order in which the operations are performed for …
AB' + C
– B' … is formed first … then …
– AB' … and finally …
– AB' + C is performed
44
![Page 45: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/45.jpg)
Boolean Expressions
• Circuit of logic gates for the expression … AB' + C
F = AB' + C
45
![Page 46: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/46.jpg)
Boolean Expressions
• Circuit of logic gates for the expression … [A(C + D)]' + BE
F = [A(C + D)]' + BE
46
![Page 47: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/47.jpg)
Literal
• Literal …
– Each appearance of a variable or its complement in an expression
• Example … ab'c + a’b + a’bc' +b’c'
» three variables
» 10 literals10 literals
47
![Page 48: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/48.jpg)
Truth Table
48
![Page 49: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/49.jpg)
Truth Table
• Truth table …
– Specifies the values of a Boolean expression for every possible combination of values of the variables in the expression
– Specify the output values for a circuit of logic gates in terms of the values of the input variables
49
![Page 50: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/50.jpg)
Truth Table
• Example … F = A’ + B
50
![Page 51: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/51.jpg)
Truth Table
• Example … F = AB’ + C
A B C B’ AB’ AB’+C A+C B’+C (A+C)(B’+C)0 0 0 1 0 0 0 1 00 0 0 1 0 0 0 1 00 0 1 1 0 1 1 1 1 0 1 0 0 0 0 0 0 0 0 1 1 0 0 1 1 1 1 1 0 0 1 1 1 1 1 11 0 0 1 1 1 1 1 11 0 1 1 1 1 1 1 1 1 1 0 0 0 0 1 0 0 1 1 1 0 0 1 1 1 1
51
![Page 52: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/52.jpg)
Truth Table
• Two expressions are equal … if …
– They have the same value for every possible combination of the variables
• For example … lets prove … using the truth table …
AB’ + C = (A + C)(B’ + C)
52
![Page 53: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/53.jpg)
Truth Table
• Prove … AB’ + C = (A + C)(B’ + C) … using the truth table …
A B C B’ AB’ AB’+C A+C B’+C (A+C)(B’+C)0 0 0 1 0 0 0 1 00 0 0 1 0 0 0 1 00 0 1 1 0 1 1 1 1 0 1 0 0 0 0 0 0 0 0 1 1 0 0 1 1 1 1 1 0 0 1 1 1 1 1 11 0 0 1 1 1 1 1 11 0 1 1 1 1 1 1 1 1 1 0 0 0 0 1 0 0 1 1 1 0 0 1 1 1 1
53
![Page 54: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/54.jpg)
Truth Table
• Prove … AB’ + C = (A + C)(B’ + C) … using the truth table …
Values for all 8 combinations are equal
A B C B’ AB’ AB’+C A+C B’+C (A+C)(B’+C)0 0 0 1 0 0 0 1 00 0 0 1 0 0 0 1 00 0 1 1 0 1 1 1 1 0 1 0 0 0 0 0 0 0 0 1 1 0 0 1 1 1 1 1 0 0 1 1 1 1 1 11 0 0 1 1 1 1 1 11 0 1 1 1 1 1 1 1 1 1 0 0 0 0 1 0 0 1 1 1 0 0 1 1 1 1
54
![Page 55: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/55.jpg)
Truth Table
• If an expression has …
– n variables … and … each variable can have the value 0 or 1
– Then …
• The number of different combinations of values of the variables is …
2 x 2 x 2 x . . . = 2n
i
• Therefore … a truth table for an n-variable expression will have 2n
rows
n times
rows
55
![Page 56: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/56.jpg)
Truth Table
• For … AB’ + C
– We have 3 variables … A, B’, and C … therefore …
3n = 3 … # of rows in truth table is 2n = 23 = 8–
A B C B’ AB’ AB’+C A+C B’+C (A+C)(B’+C)0 0 0 1 0 0 0 1 00 0 0 1 0 0 0 1 00 0 1 1 0 1 1 1 1 0 1 0 0 0 0 0 0 0 0 1 1 0 0 1 1 1 1 1 0 0 1 1 1 1 1 11 0 0 1 1 1 1 1 11 0 1 1 1 1 1 1 1 1 1 0 0 0 0 1 0 0 1 1 1 0 0 1 1 1 1
56
![Page 57: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/57.jpg)
Basic Theorems
57
![Page 58: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/58.jpg)
Operations with 0 and 1Operations with 0 and 1
Theorem 2-4
58
![Page 59: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/59.jpg)
Single Variable --- Operations with 0 and 1
• Single Variable --- Operations with 0 and 1
X + 0 = X (Theorem 2-4)
59
![Page 60: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/60.jpg)
Single Variable --- Operations with 0 and 1
• Lets think about (2-4) …
X + 0 = X
0 + 0 = 00 + 1 = 1 1 + 0 = 11 + 1 = 1
X + 0 = XX + 0 = X
• As you see … whatever the value of X is … is also the equivalent valuevalue
60
![Page 61: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/61.jpg)
Dual
61
![Page 62: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/62.jpg)
Dual
• Dual …
– Is formed by replacing …
» AND with OR» OR with AND» 0 with 1» 1 with 0
– Variables and complements are left unchangedVariables and complements are left unchanged
62
![Page 63: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/63.jpg)
Duality
• Most theorems have duals
• Theorem duals are formed by replacing …
» AND with OR» OR with AND» 0 with 1» 1 with 0
63
![Page 64: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/64.jpg)
Operations with 0 and 1Operations with 0 and 1
Theorem 2-4D
64
![Page 65: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/65.jpg)
Single Variable --- Operations with 0 and 1
• Single Variable --- Operations with 0 and 1
X + 0 = X (2-4)
X • 1 = X (2-4D)
65
![Page 66: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/66.jpg)
Single Variable --- Operations with 0 and 1
• Lets think about (2-4D) …
X • 1 = X
0 • 0 = 0 0 • 1 = 01 • 0 = 0 1 • 1 = 1
X • 1 = XX • 1 = X
• As you see … whatever the value of X is … is also the equivalent valuevalue
66
![Page 67: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/67.jpg)
Operations with 0 and 1Operations with 0 and 1
Theorem 2-5
67
![Page 68: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/68.jpg)
Single Variable --- Operations with 0 and 1
• Single Variable --- Operations with 0 and 1
X + 1 = 1 (2-5)
68
![Page 69: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/69.jpg)
Operations with 0 and 1Operations with 0 and 1
Theorem 2-5D
69
![Page 70: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/70.jpg)
Single Variable --- Operations with 0 and 1
• Single Variable --- Operations with 0 and 1
X + 1 = 1 (2-5)
X • 0 = 0 (2-5D)
70
![Page 71: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/71.jpg)
Idempotent LawsIdempotent Laws
Theorem 2-6
71
![Page 72: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/72.jpg)
Idempotent Law
• Idempotent Law
X + X = X (2-6)
72
![Page 73: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/73.jpg)
Idempotent LawsIdempotent Laws
Theorem 2-6D
73
![Page 74: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/74.jpg)
Idempotent Law
• Idempotent Law
X + X = X (2-6)
X • X = X (2-6D)
74
![Page 75: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/75.jpg)
Involution LawInvolution Law
Theorem 2-7
75
![Page 76: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/76.jpg)
Involution Law
• Involution Law
(X’)’ = X (2-7)
• There is NO DUAL for 2-7
76
![Page 77: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/77.jpg)
Laws of ComplementarityLaws of Complementarity
Theorem 2-8
77
![Page 78: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/78.jpg)
Laws of Complementarity
• Laws of Complementarity
X + X’ = 1 (2-8)
78
![Page 79: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/79.jpg)
Laws of ComplementarityLaws of Complementarity
Theorem 2-8D
79
![Page 80: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/80.jpg)
Laws of Complementarity
• Laws of Complementarity
X + X’ = 1 (2-8)
X • X’ = 0 (2-8D)
80
![Page 81: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/81.jpg)
General Theorem
InformationInformation
81
![Page 82: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/82.jpg)
Proving Theorems
• Theorems can easily be proved by …
– Showing that it is valid for both of the possible values of X
• Example … To prove X + X′ = 1 … we observe that if …
82
![Page 83: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/83.jpg)
Use of Theorems
• Any expression can be substituted for …
– The variable X in the theorems
• Example … (AB' + D)E + 1 … would equal 1 … by …
• Using Theorem (2- 5) … X + 1 = 1g
(AB' + D)E + 1
Would equal … 1
83
![Page 84: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/84.jpg)
Use of Theorems
• Example … (AB' + D)(AB' + D)’ … would equal 0 … by …
• Using Theorem (2- 8D) … X + X’ = 1
(AB' + D)(AB' + D)’
Would equal … 0
84
![Page 85: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/85.jpg)
Switches
85
![Page 86: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/86.jpg)
Switches
• If two switches are both labeled with the variable A …
– This means that both switches are open when A = 0 … and …– Both are closed when A = 1
• Then the following circuits are equivalent … (Idempotent law)
86
![Page 87: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/87.jpg)
Switches
• Idempotent law
87
![Page 88: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/88.jpg)
Switches
• Operations with 0
88
![Page 89: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/89.jpg)
Switches
• Operations with 1
89
![Page 90: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/90.jpg)
Switches
• A in parallel with A’ can be replaced with a closed circuit because …
– One or the other of the two switches is always closed … Law of Complementarity
90
![Page 91: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/91.jpg)
Switches
• Switch A in series with A’ can be replaced with an open circuit because …because …
– One or the other of the two switches is always open … Law of ComplementarityComplementarity
91
![Page 92: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/92.jpg)
CommutativeCommutative,Associative, and
Distributive Laws
92
![Page 93: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/93.jpg)
Commutative, Associative, and Distributive Laws
• Many of the laws of ordinary algebra …such as …
– The commutative and associative laws …
• Also apply to Boolean algebra
93
![Page 94: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/94.jpg)
Commutative LawsCommutative Laws
94
![Page 95: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/95.jpg)
Commutative Law
• The commutative laws for AND and OR …
– Which follow directly from the definitions of the AND and OR operations … are …
XY = YX (2-9)
X + Y = Y + X (2-9D)
• This means that … the order in which the variables are written …This means that … the order in which the variables are written …
– Will not affect the result of applying the AND and OR operations
95
![Page 96: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/96.jpg)
Associative LawsAssociative Laws
96
![Page 97: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/97.jpg)
Associative Laws
• The associate laws also apply to AND and OR …
(XY)Z = X(YZ) = XYZ (2-10)
(X + Y) + Z + X + (Y + Z) = X + Y + Z (2-10D)
97
![Page 98: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/98.jpg)
Associative Laws
• Prove the associative law (2-10) using a truth table …
(XY)Z = X(YZ) = XYZ
– List all combinations of values of the variables X, Y, and Z
98
![Page 99: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/99.jpg)
Associative Laws
• Prove the associative law (2-10) using a truth table …
(XY)Z = X(YZ) = XYZ
– Compute XY and YZ for each combination of values of X, Y, Z
99
![Page 100: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/100.jpg)
Associative Laws
• Prove the associative law (2-10) using a truth table …
(XY)Z = X(YZ) = XYZ
– Compute (XY)Z and X(YZ)
100
![Page 101: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/101.jpg)
Associative Laws
• Prove the associative law (2-10) using a truth table …
(XY)Z = X(YZ) = XYZ
– Because (XY)Z and X(YZ) are equal for all combinations … Equation (2-10) is valid
101
![Page 102: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/102.jpg)
Associative Laws
• Two … 2-input AND gates … can be replaced with ….
– A single … 3-input AND gate
102
![Page 103: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/103.jpg)
Associative Laws
• Two … 2-input OR gates … can be replaced with …
– A single … 3-input OR gate
103
![Page 104: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/104.jpg)
Associative Laws
• When two or more variables are ANDed together …
– The value of the result will be 1 …
• iff … all of the variables have the value 1
– If any of the variables have the value 0 … then
• The result of the AND operation will be 0
104
![Page 105: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/105.jpg)
Associative Laws
• When two or more variables are ORed together …
– The value of the result will be 1 if …
• Any of the variables have the value 1
– The result of the OR operation will be 0 …
• iff all of the variables have the value 0
105
![Page 106: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/106.jpg)
Distributive LawsDistributive Laws
106
![Page 107: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/107.jpg)
Distributive Law
• Ordinary (algebra) distributive law …
X(Y + Z) = XY + XZ
– The ordinary distributive law states that …
• The AND operation distributes over OR
107
![Page 108: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/108.jpg)
Distributive Law
• Second distributive law valid for Boolean algebra ONLY …
X + YZ = (X + Y)(X + Z)
– The second distributive law states that OR distributes over AND
• This law is very useful in manipulating Boolean expressionsg
• Example … A + BC … cannot be factored in ordinary algebra
– Is easily factored using the second distributive law …
A BC (A B)(A C)A + BC = (A +B)(A + C)108
![Page 109: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/109.jpg)
Simplification Theorems
109
![Page 110: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/110.jpg)
Simplification Theorems
• The following theorems are useful in simplifying Boolean expressions …expressions …
XY + XY’ = X (2-12) (X + Y)(X + Y’) = X (2-12D)
X + XY = X (2-13) X(X + Y) = X (2-13D)
(X + Y’)Y = XY (2-14) XY’ + Y = X + Y (2-14D)(X Y )Y XY (2 14) XY Y X Y (2 14D)
110
![Page 111: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/111.jpg)
Illustration of Theorem (2-14D) … XY’ + Y = X + Y
• T = Y + XY' because there is a closed circuit between the terminals if switch Y is closed or switch X is closed and switch Y' is closedif switch Y is closed or switch X is closed and switch Y is closed
• The second circuit is equivalent because … if Y is closed (Y =1) both circuits have a transmission of 1; if Y is open (Y' = 1) both circuitscircuits have a transmission of 1; if Y is open (Y = 1) both circuits have a transmission of X
111
![Page 112: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/112.jpg)
Simplification of Logic Gates
• Simplify the logic gates for … F = A(A’ + B)
• By Theorem (2-14) … (X + Y’) = XY …
F = A(AB) = A • A • B = AB (using 2-3D)
=
112
![Page 113: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/113.jpg)
Simplification ExamplesSimplification Examples …
113
![Page 114: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/114.jpg)
Example 1
• Simplify Z = A′BC + A′ … rearranging … Z = A’ + A’BC
Using 2-13 … X + XY = X
Let X = A′ and Y = BC …
The expression simplifies to …
Z = A’ + A’BC = X + XY = X = A′
114
![Page 115: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/115.jpg)
Example 2
• Simplify Z = [A + B’C + D + EF][A + B’C + (D + EF)’] …
Using 2-12D … (X + Y)(X + Y’) = X
115
![Page 116: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/116.jpg)
Example 3
• Simplify Z = (AB + C)(B’D + C’E’) + (AB + C)’ …
Using 2-14D … XY’ + Y = X + Y
Let Y = (AB + C)′ rather than (AB + C) … To match form of (2-14D)
116
![Page 117: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/117.jpg)
Multiplying Out
and
FactoringFactoring
117
![Page 118: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/118.jpg)
Sum-Of-Products (SOP)Sum Of Products (SOP) …
118
![Page 119: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/119.jpg)
Sum-Of-Products (SOP)
• The two distributive laws are used to multiply out an expression to obtain a sum-of-products (SOP) formobtain a sum of products (SOP) form
• An expression is said to be in sum-of-products (SOP) form when …
– All products are the products of single variables
• This form is the end result when an expression is fully multiplied out
• It is usually easy to recognize a sum-of-products expression because it consists of a sum … of product terms
119
![Page 120: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/120.jpg)
Sum-Of-Products (SOP)
• Sum-of-products examples …
AB’ + CD’E + AC’E’
’ ’A + B’ + C + D’E “degenerated” example
• Examples that are NOT sum-of-products
(A + B)CD + EF (A + B) is not a single variable
120
![Page 121: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/121.jpg)
Sum-Of-Products (SOP)
• A sum-of-products expression can always be realized directly by …
– One or more AND gates feeding a single OR gate at the circuit output
121
![Page 122: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/122.jpg)
Sum-Of-Products (SOP)
• The circuits below are referred to as two-level circuits …
– They have a maximum of two gates in series between an input and the circuit output
122
![Page 123: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/123.jpg)
Product-Of-Sums (POS)Product Of Sums (POS) …
123
![Page 124: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/124.jpg)
Product-Of-Sums (POS)
• Both distributive laws can be used to factor an expression to obtain a product-of-sums forma product of sums form
• An expression is in product-of-sums (POS) form when …
– All sums are the sums of single variables
• It is usually easy to recognize a product-of-sums expression since it consists of a product … of sum terms
124
![Page 125: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/125.jpg)
Product-Of-Sums (POS)
• Product-of-sums examples …
(A + B’)(C + D’ + E)(A + C’ + E’)
• Some “degenerated” examples …
(A + B)(C + D + E)F F is a single variable
AB’C(D’ + E)
• NOT a Product-of-sums
(A B)(C D) EF(A + B)(C + D) + EF125
![Page 126: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/126.jpg)
Product-Of-Sums (POS)
• An expression is fully factored … iff …
– It is in product-of-sums form
• Any expression not in this form can be factored further!
• When multiplying out an expression …g
– Apply the second distributive law first … when possible
126
![Page 127: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/127.jpg)
Product-Of-Sums (POS)
• Example … Multiplying out (A + BC)(A + D + E) …
Let … X = A Y = BC Z = D + E
Then …
(A + BC)(A + D + E) = (X + Y)(X + Z) = X + YZ =
= A + BC(D + E) = A + BCD + BCE
• The same result could be obtained the hard way by multiplying out the original expression completely … then eliminating redundant termsterms
127
![Page 128: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/128.jpg)
Product-Of-Sums (POS)
• EXAMPLE … Factor … A + B'CD
A + B'CD … is of the form X + YZ (second distributive law)
where X = A Y = B‘ Z = CD … therefore …
A + B'CD = X + YZ = (X + Y)(X + Z) = (A + B')(A + CD)
A + CD can be factored … use … second distributive law
A + CD = (A + C)(A + D) … therefore …
A B'CD (A B')(A C)(A D)A + B'CD = (A + B')(A + C)(A + D)128
![Page 129: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/129.jpg)
Product-Of-Sums (POS)
• EXAMPLE … Factor … AB' + C'D
X = AB′ Y = C’ Z = D second distributive law
AB′ + C’D = X + YZ = (X + Y)(X + Z) =
= (AB′ + C′)(AB′ + D) factor each term using second distributive law
(AB′ + C′) ... Let X = C′ Y = A Z = B′(AB′ + C′) = X + YZ = (X + Y)(X + Z) = (A + C′)(B′ + C′)(AB + C ) = X + YZ = (X + Y)(X + Z) = (A + C )(B + C )
Same for (AB′ + D) = (A + D)(B′ + D) ... Which gives us ...
AB' C'D (A C′)(B′ C′)(A D)(B′ D)AB' + C'D = (A + C′)(B′ + C′)(A + D)(B′ + D)129
![Page 130: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/130.jpg)
Product-Of-Sums (POS)
• Example … Factor … C'D + C'E' + G'H
First … apply ordinary distribution law … X(Y + Z) = XY + XZ
C'D + C'E' + G'H = C′(D + E′) + G′H
Next … apply the second distribution law … X + YZ = (X + Y)(X + Z)
Let X = G′H Y = C′ Z = (D + E′)
(X + Y)(X + Z) = (C′ + G′H)(D + E′ + G′H)Y X Z X
C i dContinued ....130
![Page 131: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/131.jpg)
Product-Of-Sums (POS)
• Example … continued … Factor … C'D + C'E' + G'H
(C′ + G′H)(D + E′ + G′H) ... Factor each separately------------(C′ + G′H) ... Let X = C′ Y = G’ Z = H
X + YZ = (X + Y)(X + Z) = (C′ + G′)(C′ + H)------------(D + E′ + G′H) ... Let X = D + E′ Y = G’ Z = H
second distributive law
X + YZ = (X + Y)(X + Z) = (D + E′ + G′)(D + E′ + H)------------S C'D C'E' G'H (C′ G′)(C′ H)(D E′ G′)(D E′ H)So ... C'D + C'E' + G'H = (C′ + G′)(C′ + H)(D + E′ + G′)(D + E′ + H)
131
![Page 132: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/132.jpg)
Product-Of-Sums (POS)
• A product-of-sums expression can always be realized directly by …
– One or more OR gates feeding a single AND gate at the circuit output
• The circuits below are referred to as two- level circuits because they have a maximum of two gates in series between an input and the circuit outputcircuit output
132
![Page 133: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/133.jpg)
Product-Of-Sums (POS)
• Again … The circuits below are referred to as two-level circuits …
– They have a maximum of two gates in series between an input and the circuit output
133
![Page 134: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/134.jpg)
DeMorgan’s LawsDeMorgan s Laws
134
![Page 135: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/135.jpg)
DeMorgan’s Laws
• DeMorgan’s laws …
– The inverse or complement of any Boolean expression can easily be found by successively applying the following theorems …
(X + Y)' = X' Y' (2-21)
(XY)' = X' + Y' (2-22)
• DeMorgan’s laws are easily generalized to n variables …DeMorgan s laws are easily generalized to n variables …
(2-23)(2 24)(2-24)
135
![Page 136: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/136.jpg)
DeMorgan’s Laws
• Referring to the …
– OR operation as the logical sum … and …
– The AND operation as logical product …
• DeMorgan’s laws can be stated as …g
– The complement of the product is the sum of the complements– The complement of the sum is the product of the complementsThe complement of the sum is the product of the complements
• To form the complement of an expression containing both OR and AND operations DeMorgan’s laws are applied alternatelyAND operations … DeMorgan s laws are applied alternately
136
![Page 137: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/137.jpg)
DeMorgan’s Laws
• Example … Find the complement of … (A’ + B)C’
First … apply (2-22) … (XY)' = X' + Y'
[(A’ + B)C’]’ = (A’ + B)’ + (C’)’
Now apply (2-21) … (X + Y)' = X' Y'
(A’ + B)’ + (C’)’ = (A’)’B’ + (C’)’ = AB’ + C
137
![Page 138: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/138.jpg)
DeMorgan’s Laws
• Example … Find the complement of … (AB’ + C)D’ + E
First … apply (2-21) … (X + Y)' = X' Y'
[(AB’ + C)D’ + E]’ = [(AB’ + C)D’]’E’
Now apply (2-22) … (XY)' = X' + Y'
[(AB’ + C)D’]’E’ = [(AB’ + C)’ + (D’)’]E’ = [(AB’ + C)’ + D]E’
Now apply (2-21) … (X + Y)' = X' Y'
[(AB’ C)’ D]E’ [(AB’)’C’ D]E’ i d[(AB’ + C)’ + D]E’ = [(AB’)’C’ + D]E’ … continued …138
![Page 139: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/139.jpg)
DeMorgan’s Laws
• Example … continued … Find the complement of … (AB’ + C)D’ + E
Now apply (2-22) … (XY)' = X' + Y'
[(AB’)’C’ + D]E’ = [(A’ + B)C’ + D]E’
139
![Page 140: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/140.jpg)
DualityDuality
140
![Page 141: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/141.jpg)
Duality
• Duals are formed by replacing …
» AND with OR» OR with AND» 0 with 1» 1 with 0
• The dual of an expression may be found by complementing the entire expression and then complementing each individual variables
• For example …
141
![Page 142: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/142.jpg)
LAWS AND THEOREMS
Page 55
142
![Page 143: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/143.jpg)
LAWS AND THEOREMS
• Compilation of all the Laws and Theorems are listed on page 55 of the textthe text
143
![Page 144: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/144.jpg)
144
![Page 145: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/145.jpg)
LabLab
145
![Page 146: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/146.jpg)
Lab
• No topics this week
146
![Page 147: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/147.jpg)
Next Week …
147
![Page 148: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/148.jpg)
Next Week Topics
• Boolean Algebra continued …
– Chapter 3 … Boolean Algebra (Continued)
• Pages 56 - 78
148
![Page 149: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/149.jpg)
Home Work
149
![Page 150: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/150.jpg)
Homework
1. Read …
• Chapter 3 … pages 56 -78
2 Solve the following Chapter 2 problems2. Solve the following Chapter 2 problems …
• See next slide
150
![Page 151: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/151.jpg)
Homework
2. (continued) … Solve the following Chapter 2 problems …
• 2.1 … (d)• 2.2 … (b)• 2.3 … (a), (b), (c), and (f)• 2.4 … (a)• 2.5 … (a)• 2.6 … (a), (c), and (e)• 2.7 … (a)• 2 8 (a) and (b)• 2.8 … (a) and (b)• 2.9 … (a)• 2.15 … (a)
2 16 ( )151
• 2.16 … (a)
![Page 152: Logic Design I (17.341) Fall 2011 Lecture Outlinefaculty.uml.edu/dbowden/classpages/2011_fall_kcs/17-341/Ref_Docu… · 1 09/12/11 Introduction to digital systems and number systems](https://reader031.fdocuments.in/reader031/viewer/2022011902/5f0b62717e708231d430416a/html5/thumbnails/152.jpg)
References
1. None
152