chapter 2. boolean algebra -...
TRANSCRIPT
![Page 1: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/1.jpg)
Chapter 2. Boolean Algebra
![Page 2: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/2.jpg)
2 - 2
Boolean Algebra
◈Basic mathematics for the study of logic design is Boolean Algebra
◈Basic laws of Boolean Algebra will be implemented as switching devices called logic gates.
◈Networks of Logic gates allow us to manipulate digital signals
Can perform numerical operations on digital signals such as addition, multiplication
Can perform translations from one binary code to another.
2.1 Introduction
![Page 3: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/3.jpg)
2 - 3
◈A boolean variable can take on two values
Will use the values 0 and 1
Could just as easily use T , F or H, L or ON, OFF
◈ Boolean operations transform Boolean Variables.Basic operations are NOT, AND, OR
◈We can make more complicated Boolean Functions
from the basic boolean operations
2.2 Basic Operation
Boolean Variables, Functions
![Page 4: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/4.jpg)
2 - 4
NOT Operation
Truth Table
The NOT operation (or inverse, or complement operation) replaces a boolean value with its complement:
0’ = 1 1’ = 0
A’ is read as NOT A or Complement A
A A’Inverter symbol
F(A) = A’ boolean representation
1
0
0
1
YA
2.2 Basic Operation
![Page 5: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/5.jpg)
2 - 5
The AND operation is a function of two variables (A, B)
F(A , B) = A • B boolean function representation
When both A and B are 1 , then F is 1.
0 • 0 = 0 0 • 1 = 0 1 • 0 = 0 1 • 1 = 1
Truth Table
AND
A
B
Y = A • B
AND Operation
0
0
0
1
0 0
0 1
1 0
1 1
YA B
2.2 Basic Operation
![Page 6: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/6.jpg)
2 - 6
Will usually drop the ‘• ‘ in the equation and just write the equation as:
F(A , B) = AB boolean function representation
Can also view AND operation as two switches in series:
Switch Open (0)
Switch Closed (1)
A BA = 1 Switch A closed
B = 1 Switch B closed
T = AB = 1 circuit closed
AND Operation (Cont’d)
2.2 Basic Operation
![Page 7: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/7.jpg)
2 - 7
OR Operation
The OR operation is a function of two variables (A, B)
F(A,B) = A + B boolean function representation
When either A or B are ‘1’, then F is ‘1’.
0 + 0 = 0, 0 + 1 = 1, 1 + 0 = 1, 1 + 1 = 1
Truth TableOR
Y = A + BA
B
0
1
1
1
0 0
0 1
1 0
1 1
YA B
2.2 Basic Operation
![Page 8: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/8.jpg)
2 - 8
OR Operation (Cont’d)
Can view OR operation as two switches in parallel:
Switch B closed (1), so circuit is closed (1)
A
BNeither switch A or switch B is closed, so circuit is open (0)
B
A
Switch A closed (1), so circuit is closed (1)B
A
Switch A or Switch B is closed, circuit is closed (1)B
A
2.2 Basic Operation
![Page 9: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/9.jpg)
2 - 9
Boolean Functions (1)
More complex boolean functions can be created by combining basic operations
AA’
BF(A,B) = A’ + B
… more about truthtables later
1
1
0
1
1
1
0
0
0 0
0 1
1 0
1 1
F=A’+BA’A B
2.3 Boolean Expressions and Truth Tables
![Page 10: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/10.jpg)
2 - 10
Boolean Functions (2)
BEDCA ++ )]'([Logic Expression :
Circuit of logic gates :
2.3 Boolean Expressions and Truth Tables
![Page 11: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/11.jpg)
2 - 11
Boolean Functions (3)
0000)]'1(1[01)]01(1[)]'([ =+=+=⋅++=++ BEDCA
'''''' cbbcabacab +++
BEDCA ++ )]'([Logic Expression :
Circuit of logic gates :
Logic Evaluation : A=B=C=1, D=E=0
Literal : a variable or its complement in a logic expression
10 literals
2.3 Boolean Expressions and Truth Tables
![Page 12: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/12.jpg)
2 - 12
X + 0 = XX + 1 = 1
X • 1 = XX • 0 = 0
Dual
X + X = X X • X = X
(X’) ’ = X (X ’) ’ = X
X + X’ = 1 X • X’ = 0
Expression
Idempotent laws
Involution laws
Laws of Complementarity
Operations with ‘0’ and ‘1’
Basic Theorems
2.4 Basic Theorems
![Page 13: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/13.jpg)
2 - 13
Basic Theorems with Switching Circuits (1)
2.4 Basic Theorems
![Page 14: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/14.jpg)
2 - 14
Basic Theorems with Switching Circuits (2)
2.4 Basic Theorems
![Page 15: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/15.jpg)
2 - 15
Duality
◈A dual of a boolean expression is formed by replacing: AND’s OR’s, OR’s AND’s, 1’s 0’s, and 0’s 1’s. Variables and their complements are left alone.
◈If two boolean expressions are equal, then their dualsare equal!
◈Example: (X+Y’)Y = XY XY’ + Y = X + Y
◈Helpful in remembering boolean laws. Only need to remember one set, can generate the 2nd set by taking the dual!
2.4 Basic Theorems
![Page 16: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/16.jpg)
2 - 16
Proving a Theorem
How do we prove X + 0 = X is correct?
One way is to replace all boolean variables with values of 0 , 1and use basic operations:
For X = 0, 0 + 0 = 0 For X = 1, 1 + 0 = 1 0 = 0 1 = 1
So, X + 0 = X is valid.
Prove X + X’ = 1
For X = 0, 0 + (0) ’ = 1 For X = 1, 1 + (1) ’ = 1 0 + 1 = 1 1 + 0 = 1
1 = 1 1 = 1
So, X + X’ = 1 is valid.
2.4 Basic Theorems
![Page 17: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/17.jpg)
2 - 17
X + Y = Y + XX Y = Y X
Dual Laws
(X + Y) + Z = X + (Y + Z)
Commutative
Associative
(XY) Z = X(YZ)
Associative
If + is viewed as addition, and • as multiplication, then the Commutative, Associative laws are the same in boolean algebra as in ordinary algebra.
Commutative
Commutative, Associative Laws
2.5 Commutative, Associative, and Distributive Laws
![Page 18: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/18.jpg)
2 - 18
Three Input AND Function
AB
F = ABC = (AB) C = A (BC)
C
Truth Table for 3-inputAND
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
1
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
F=ABCABA B C
2.5 Commutative, Associative, and Distributive Laws
![Page 19: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/19.jpg)
2 - 19
A (B + C) = AB + AC (valid in ordinary algebra)
Dual:
A + BC = (A + B) (A + C) (only valid in Boolean algebra!)
Note that the 2nd form is NOT valid in normal algebra. This tends to make one forget about it. Remember the first form, then take the DUAL of it to get the second form.
Distributive Law
2.5 Commutative, Associative, and Distributive Laws
![Page 20: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/20.jpg)
2 - 20
Use Truth Table method for both sides
Results are same
Prove A + BC = (A + B) (A + C)
0
0
0
1
1
1
1
1
0
1
0
1
1
1
1
1
0
0
1
1
1
1
1
1
0
0
0
1
1
1
1
1
0
0
0
1
0
0
0
1
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
(A+B)(A+C)A+CA+BA+BCBCA B C
2.5 Commutative, Associative, and Distributive Laws
![Page 21: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/21.jpg)
2 - 21
XY + XY ’ = X (X +Y) (X+Y ’) = X
Duals
X + XY = X
(X + Y ’) Y = XY
X (X + Y) = X
XY ’ + Y = X + Y
Prove XY + XY ’ = X via algebraic manipulation
XY + XY ’ = X (Y + Y ’) = X (1) = X
Note that any expressions can be substituted for the X and Y in the theorems.
Other Simplification Laws
2.6 Simplification Theorems
![Page 22: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/22.jpg)
2 - 22
Simplification
◈Simplification tries to reduce the number of terms in a boolean equation via use of basic theorems
◈A simpler equation will mean:
Less gates will be needed to implement the equation
could possibly mean a faster gate-level implementation
◈Will use algebraic techniques at first for simplification
Later, will use a graphical method called K-maps
Computer methods for simplification are widely used in industry.
2.6 Simplification Theorems
![Page 23: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/23.jpg)
2 - 23
A boolean expression is in SUM OF PRODUCTS form when all products are the products of single variables only.
Sum Of Products (SOP) Form
F = AB’ + CD’E + AC’E ’ (SOP Form)
G = ABC’ + DEFG + H (SOP Form)
Y = A + B’ + C + D (SOP Form)
Z = (A+B)CD + EF Not SOP Form
= ACD + BCD + EF (SOP Form)
2.7 Multiplying Out and Factoring
![Page 24: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/24.jpg)
2 - 24
Problem : Put into SOP form the following equation and simplify:
(A + BC) (A + D + E)Try just straightforward multiplication of terms:
AA + AD + AE + ABC + BCD + BCE
Simplify (AA = A):A + AD + AE + ABC + BCD + BCE
Look for simplification via factoring:A(1 + D + E + BC) + BCD + BCE
A (1) + BCD + BCE
A+ BCD + BCE (Final SOP form)
Use Distributive Law for Multiplying
2.7 Multiplying Out and Factoring
![Page 25: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/25.jpg)
2 - 25
Using 2ND Distributive Law
Recall 2nd Distributive Law:(X + Y) (X + Z) = X + YZ
Lets try and use this law -- may make things easier:
(A + BC) (A + D + E)(A + (BC)) ( A + (D + E) )
Apply 2nd Distributive Law:
A + BC (D + E)
Multiply Out:
A + BCD + BCE (Final SOP form)
Finished.
(same problem)Let X = A, Y = BC, Z=D+E
2.7 Multiplying Out and Factoring
![Page 26: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/26.jpg)
2 - 26
A + BCD + BCE as Logic Gates
BCD
BCE
A
SOP can be implemented in two levels of logic assuming that both a variable (A) and its complement (A’) are available (Dual Rail Inputs). SOP is a TWO-LEVEL form (AND-OR)
AND-OR form
2.7 Multiplying Out and Factoring
![Page 27: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/27.jpg)
2 - 27
Product Of Sums (POS) Form
A boolean expression is in PRODUCT OF SUMS form when all sums are the sums of single variables.
F = (A + B’)(C + D’ + E)(A + C’ + E’) (POS Form)
G = A (B + E)(C + D) (POS Form)
Y = AB + AC Not POS Form= A (B + C) POS Form
2.7 Multiplying Out and Factoring
![Page 28: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/28.jpg)
2 - 28
Factoring
Use factoring to get to Product of Sums form.
Use basic theorem:
X + YZ = (X + Y) (X + Z) (2ND distributive law)
Problem: Put A + B’CD into POS Form:
A + B’CD = (A + B’) (A + CD )
= (A + B’) (A + C) (A + D)
(A + B’) (A + C) (A + D) is final POS form
2.7 Multiplying Out and Factoring
![Page 29: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/29.jpg)
2 - 29
(A+B’)(A+C)(A+D) as Logic Gates
A
B’
A
C
A
D
POS can be implemented in two levels of logic assuming that both a variable (A) and its complement (A’) are available (Dual Rail Inputs). POS is a TWO-LEVEL form (OR-AND form)
OR-AND form
2.7 Multiplying Out and Factoring
![Page 30: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/30.jpg)
2 - 30
De Morgan’s Laws provide an easy way to find the inverse of a boolean expression:
(X + Y)’ = X’ Y’(X Y)’ = X’ + Y’
An easy way to remember this is that each TERM is complemented, and that OR’s become AND’s; AND’s become OR’s.
(Easy to prove this via a truth table, see textbook p. 46.)
The complement of the product is the sum of complementsThe complement of the sum is the product of complements.
The complement of the product is the sum of complementsThe complement of the sum is the product of complements.
-- Can easily generalize to n variables using above rules
DeMorgan’s Laws
2.8 DeMorgan’s Law
![Page 31: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/31.jpg)
2 - 31
Apply De Morgan’s Law to a more complex expression:
(AB + C’D)’ = (AB)’ (C’D)’= (A’+B’)(C + D’)
Note that De Morgan’s law was applied twice.
Another example:
[(A’ + B)C’]’ = (A’ + B)’ + (C’)’= (A’)’ (B)’ + C= AB’ + C
Applying DeMorgan’s Law
2.8 DeMorgan’s Law
![Page 32: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/32.jpg)
2 - 32
Why do we care about De Morgan’s Law?
There are two other gate types that produce the complement of a boolean function!
A
B
(AB)’
NAND
A
B
(A+B)’
NOR
NAND, NOR Gates
1
1
1
0
0 0
0 1
1 0
1 1
YA B
1
0
0
0
0 0
0 1
1 0
1 1
YA B
2.8 DeMorgan’s Law
![Page 33: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/33.jpg)
2 - 33
NAND (NOT AND) - can be thought of as an AND gate followed by an inverter.
A
B
AB (AB)’A
B
(AB)’
NAND
NOR (NOT OR) - can be thought as an OR gate followed by an inverter.
A
B
A+B (A+B)’A
B
(A+B)’
NOR
NAND, NOR Gates (cont’d)
2.8 DeMorgan’s Law
![Page 34: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/34.jpg)
2 - 34
In the real world, an AND gate is made from an NAND gate followed by an inverter.
An OR gate is made from a NOR gate followed by an inverter.
A
B
(AB)’
NAND
ABA
B
AB
AND
A
B
(A+B)’
NOR
A+B A
B
A+B
OR
Actually….
2.8 DeMorgan’s Law
![Page 35: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/35.jpg)
2 - 35
NAND, NOR gates far outnumber AND, OR in typical designs
easier to construct in the underlying transistor technologies
Any Boolean expression can be implemented by NAND, NOR, NOT gates
In fact, NOT is superfluous
(NOT = NAND or NOR with both inputs tied together)
X0
1
Y0
1
X NOR Y1
0
X0
1
Y0
1
X NAND Y1
0
NAND, NOR Implementation
2.8 DeMorgan’s Law
![Page 36: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/36.jpg)
2 - 36
Waveform View
2.8 DeMorgan’s Law
![Page 37: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/37.jpg)
2 - 37
A
B
(AB)’
C
D (CD)’
F = ((AB)’ (CD)’)’
Lets use De Morgan’s Law
F = ((AB)’ (CD)’)’ = ((AB)’)’ + ((CD)’)’ = AB + CD
An interesting result…………… SOP Form
What is this logic function in SOP form?
2.8 DeMorgan’s Law
![Page 38: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/38.jpg)
2 - 38
A
B
(AB)’
C
D (CD)’
F = ((AB)’ (CD)’)’
A
B
(AB)
C
D (CD)
F = AB + CD
Same logic function
NAND-NAND form = AND-OR form
2.8 DeMorgan’s Law
![Page 39: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/39.jpg)
2 - 39
DeMorgan’s Theorem
◈ Symbolic DeMorgan’s duals exist for all gate primitives
nand
nor
and
or
not
2.8 DeMorgan’s Law
![Page 40: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/40.jpg)
2 - 40
DeMorgan’s Theorem (cont’d)
Can save you time in evaluating/designing combinatorial logic
– Align bubbles and non-bubbles whenever possible
2.8 DeMorgan’s Law
![Page 41: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/41.jpg)
2 - 41
Apply the laws and theorems to simplify Boolean equations
Example: full adder's carry out function
Cout = A' B Cin + A B' Cin + A B Cin' + A B Cin
Laws of Boolean Algebra
2.8 DeMorgan’s Law
![Page 42: Chapter 2. Boolean Algebra - soc.yonsei.ac.krsoc.yonsei.ac.kr/class/material/logic/CH2(수정).pdfBoolean Algebra Basic mathematics for the study of logic design is Boolean Algebra](https://reader030.vdocument.in/reader030/viewer/2022040422/5e157ff43fe57b53f0428ede/html5/thumbnails/42.jpg)
2 - 42
Apply the laws and theorems to simplify Boolean equations
Example: full adder's carry out function
Cout = A' B Cin + A B' Cin + A B Cin' + A B Cin
= A' B Cin + A B' Cin + A B Cin' + A B Cin + A B Cin
= A' B Cin + A B Cin + A B' Cin + A B Cin' + A B Cin
= (A' + A) B Cin + A B' Cin + A B Cin' + A B Cin
= (1) B Cin + A B' Cin + A B Cin' + A B Cin
= B Cin + A B' Cin + A B Cin' + A B Cin + A B Cin
= B Cin + A B' Cin + A B Cin + A B Cin' + A B Cin
= B Cin + A (B' + B) Cin + A B Cin' + A B Cin
= B Cin + A (1) Cin + A B Cin' + A B Cin
= B Cin + A Cin + A B (Cin' + Cin)
= B Cin + A Cin + A B (1)
= B Cin + A Cin + A B
identity
associative
Laws of Boolean Algebra
2.8 DeMorgan’s Law