conversion from one number base to another binary arithmetic equation simplification
DESCRIPTION
Review for Exam 1. Conversion from one number base to another Binary arithmetic Equation simplification DeMorgan’s Laws Conversion to/from SOP/POS Reading equations from Truth Tables Boolean expression to Karnaugh Map Minimization using Karnaugh Maps Minterm and Maxterm Equations - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/1.jpg)
Conversion from one number base to another
Binary arithmetic
Equation simplification
DeMorgan’s Laws
Conversion to/from SOP/POS
Reading equations from Truth Tables
Boolean expression to Karnaugh Map
Minimization using Karnaugh Maps
Minterm and Maxterm Equations
Minimization using don’t cares
Logic to Boolean Expression conversion
Word problems
Determining how many gates and inputs a boolean expression has
Determining Prime Implicants and Essential Prime Implicants
Logical completeness
Review for Exam 1
![Page 2: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/2.jpg)
Conversion from one number base to another
356.8910 to Hexadecimal (2 digits)
![Page 3: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/3.jpg)
Conversion from one number base to another
![Page 4: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/4.jpg)
Binary arithmetic
23 6 | 141 -12 21 -18 3
![Page 5: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/5.jpg)
Equation simplification
Simplify and convert to SOP(A’ + B + C’)(A’ + C’ + D)(B’ + D’)
Y = (AB’ + (AB + B)) B + A
![Page 6: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/6.jpg)
Equation simplification
(X + Y)(X + Z) = (X + YZ)
X + XY = X
X + X’Y = X + Y
X + XY = X
![Page 7: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/7.jpg)
DeMorgan’s Laws
G = {[(R + S + T)’ PT(R + S)’]’T}’
![Page 8: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/8.jpg)
DeMorgan’s Laws
G = {[(R + S + T)’ PT(R + S)’]’T}’ = [(R + S + T)’ PT(R + S)’] + T’ = [ R’S’T’ PT(R’S’)] + T’ = R’S’T’PTR’S’ + T’ = R’S’P(T’T) + T’ = T’
![Page 9: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/9.jpg)
Conversion to/from SOP/POS
(X + YZ) = (X + Y)(X + Z)
![Page 10: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/10.jpg)
Reading equations from Truth Tables
A B C D F
0 0 0 0 1
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 1
0 1 0 1 0
0 1 1 0 1
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 0
1 1 1 0 1
1 1 1 1 0
![Page 11: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/11.jpg)
Reading equations from Truth Tables
A B C D F
0 0 0 0 1 A’B’C’D’
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 1 A’BC’D’
0 1 0 1 0
0 1 1 0 1 A’BCD’
0 1 1 1 1 A’BCD
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1 ABC’D’
1 1 0 1 0
1 1 1 0 1 ABCD’
1 1 1 1 0
![Page 12: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/12.jpg)
Boolean expression to Karnaugh Map
AB
CD 00 01 11 10
00
01
11
10
AB + C’D + A’B’C + ABCD + AB’C
![Page 13: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/13.jpg)
Boolean expression to Karnaugh Map
AB
CD 00 01 11 10
00 1
01 1 1 1 1
11 1 1 1
10 1 1 1
AB + C’D + A’B’C + ABCD + AB’C
![Page 14: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/14.jpg)
Minimization using Karnaugh Maps
AB
CD 00 01 11 10
00 1
01 1 1 1 1
11 1 1 1
10 1 1 1
AB + C’D + A’B’C + ABCD + AB’C
AB + C’D + B’C
![Page 15: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/15.jpg)
Minterm and Maxterm Equations
F(ABCD) = m (0,2,4,7,9,12,14,15)
AB
CD 00 01 11 10
00
01
11
10
BC’D’ + BCD + ABC + A’B’D’ + AB’C’D
![Page 16: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/16.jpg)
Minterm and Maxterm Equations
F(ABCD) = m (0,2,4,7,9,12,14,15)
AB
CD 00 01 11 10
00 1 1 1
01 1
11 1 1
10 1 1
BC’D’ + BCD + ABC + A’B’D’ + AB’C’D
![Page 17: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/17.jpg)
Minimization using don’t cares
AB
CD 00 01 11 10
00
01
11
10
A’B’ + AD
F(ABCD) = m (0,1,2,11,13) + d (3,9,12,15)
![Page 18: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/18.jpg)
Minimization using don’t cares
AB
CD 00 01 11 10
00 1 x
01 1 1 x
11 x x 1
10 1
A’B’ + AD
F(ABCD) = m (0,1,2,11,13) + d (3,9,12,15)
![Page 19: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/19.jpg)
Logic to Boolean Expression conversion
![Page 20: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/20.jpg)
Logic to Boolean Expression conversion
F = (XY + W)Z + V
F = (B+C)A + BC
![Page 21: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/21.jpg)
Word problems
![Page 22: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/22.jpg)
Determining how many gates and inputs a boolean expression has
levelsgatesinputstransistorsinputs/gate max
levelsgatesinputstransistorsinputs/gate max
F = (XY + W)Z + V
Z = A’B’C’ + ABC + BCD +B’C’D’
![Page 23: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/23.jpg)
Determining how many gates and inputs a boolean expression has
4 levels4 gates8 inputs16 transistors2 inputs/gate max
2 levels5 gates16 inputs32 transistors4 inputs/gate max
F = (XY + W)Z + V
Z = A’B’C’ + ABC + BCD +B’C’D’
![Page 24: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/24.jpg)
Determining Prime Implicants and Essential Prime Implicants
AB
CD 00 01 11 10
00 1 1 1
01 1 1 1 x
11 x x 1
10 1
![Page 25: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/25.jpg)
Determining Prime Implicants and Essential Prime Implicants
AB
CD 00 01 11 10
00 1 1 1
01 1 1 1 x
11 x x 1
10 1
6 prime implicants
3 essential prime implicants
![Page 26: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/26.jpg)
Logical completeness
Inverter
AND gate
OR gate
![Page 27: Conversion from one number base to another Binary arithmetic Equation simplification](https://reader036.vdocument.in/reader036/viewer/2022081519/568134c0550346895d9be418/html5/thumbnails/27.jpg)
Logical completeness
Inverter
Inverter AND gate
NAND
NAND gateInverter
InverterOR gate