Chapter 3 Boolean Algebra and Logic Gate (Part 2).
-
date post
20-Dec-2015 -
Category
Documents
-
view
254 -
download
5
Transcript of Chapter 3 Boolean Algebra and Logic Gate (Part 2).
![Page 1: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/1.jpg)
Chapter 3
Boolean Algebra and Logic Gate (Part 2)
![Page 2: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/2.jpg)
1. Identity Elements 2. Inverse Elements 1 . A = A A . A = 0 0 + A = A A + A = 1 3. Idempotent Laws 4. Boundess Laws A + A = A A + 1 = 1 A . A = A A . 0 = 0 5. Distributive Laws 6. Order Exchange Laws A . (B + C) = A.B + A.C A . B = B . A A + (B . C) = (A+B) . (A+C) A + B = B + A 7. Absorption Laws 8. Associative Laws A + (A . B) = A A + (B + C) = (A + B) + C A . (A + B) = A A . (B . C) = (A . B) . C 9. Elimination Laws 10. De Morgan Theorem A + (A . B) = A + B (A + B) = A . B A . (A + B) = A . B (A . B) = A + B
Basic Theorems of Boolean Algebra
![Page 3: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/3.jpg)
Truth Table
![Page 4: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/4.jpg)
A B C Q
0 0 1 0
1 0 1 0
0 1 1 0
1 1 0 1
A = 0, B = 0, C = 1, Q = 0
A = 1, B = 0, C = 1, Q = 0
A = 0, B = 1, C = 1, Q = 0
A = 1, B = 1, C = 0, Q = 1
Truth Table
![Page 5: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/5.jpg)
A B Q
0 0 0
1 0 1
0 1 0
1 1 0
Truth Table
![Page 6: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/6.jpg)
p q r p . qp . q qq q + rq + r
0 0 0 0 1 1
0 0 1 0 1 1
0 1 0 0 0 0
0 1 1 0 0 1
1 0 0 0 1 1
1 0 1 0 1 1
1 1 0 1 0 0
1 1 1 1 0 1
![Page 7: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/7.jpg)
p q p+q p.(p+q) p.q p.p (p.p)+(p.q)
0 0 0 0 0 0 0
0 1 1 0 0 0 0
1 0 1 1 0 1 1
1 1 1 1 1 1 1
Logically equivalentp.(p+q) = (p.p)+(p.q)
![Page 8: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/8.jpg)
Relationship Between Boolean Function and Logic Circuit
AB
F
A.B = AB
CD C + D
= AB + C + D
![Page 9: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/9.jpg)
G = A . (B + C + D)
A
B
CD
G = A . (B + C + D)
C + D
B + C + D
![Page 10: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/10.jpg)
A
B Q
AAB
B= AB + B
Produce a truth table from the logic circuit
A B A AB Q
0 0 1 0 0
0 1 1 1 1
1 0 0 0 0
1 1 0 0 1
![Page 11: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/11.jpg)
Elimination Laws: A.(A + B) = A.B
Proof using truth table.
A B A A + B A.B A.(A + B)
0 0 1 1 0 0
0 1 1 1 0 0
1 0 0 0 0 0
1 1 0 1 1 1
Draw the logic circuit for output = A.(A + B)
![Page 12: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/12.jpg)
A A
A.(A+B)
A
A + B
Draw the logic circuit for output = A.(A + B)
B
![Page 13: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/13.jpg)
De Morgan Theorem : (A + B) = A . B
Proof using truth table.
A B A+B A B A.B (A + B)
0 0 0 1 1 1 1
0 1 1 1 0 0 0
1 0 1 0 1 0 0
1 1 1 0 0 0 0
Draw the logic circuit for output = (A + B)
![Page 14: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/14.jpg)
Karnaugh Map
• A graphical way of depicting the content of a truth table where the adjacent expressions differ by only one variable
• For the purposes simplification, the Karnaugh map is a convenient way of representing a Boolean function of a small number (up to four) of variables
• The map is an array of 2n squares, representing all possible combination of values of n binary variables
• Example: 2 variables, A and B
A B A B
A B A B
00 01
10 11
BA B
A
B
A
BA
1 0
1
0
![Page 15: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/15.jpg)
• The number of squares in Karnaugh map depends on the number of variables
• e.g., if 2 variables, A, and B, there are 22 = 4 squares in the Karnaugh map
• e.g., if 3 variables, A, B, and C, there are 23=8 squares
000 001
010 011
110 111
100 101
AB C
A B
C
A B
C
A B
A B
or
000
001
AB
C
A B
C
A BC A B A B
![Page 16: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/16.jpg)
0000 0001
0100
1100
1000
AB C D
A B
C D
A B
CD
A B
A B
C DC D
4 variables, A, B, C, D 24 = 16 squares
![Page 17: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/17.jpg)
000 010 110 100
001 011 111 101
AB
C
A B
C
A BC A B A B
000 001
010 011
110 111
100 101
AB C
A B
C
A B
A B
A B
00 01 11 10
0
1
00
01
11
10
0 1
• The adjacent differ by only one variable
• List combinations in the order 00, 01, 11, 10
C
![Page 18: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/18.jpg)
A B C F
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 0
Truth Table
Karnaugh Map
1 1
1 1
0 0 0 1 1 1 1 0BC
A
0
1
A
A
B CB C B C B C
How to create Karnaugh Map
1. Place 1 in the corresponding square
![Page 19: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/19.jpg)
1 1
0 0 0 1 1 1 1 0AB
F = AB + AB
A BA B A B A B
Karnaugh Maps to Represent Boolean Functions
![Page 20: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/20.jpg)
1 1
1
0 0 0 1 1 1 1 0BCB CB C B C B CA
A
A
ABC
ABC
ABC
F=ABC + ABC + ABC
![Page 21: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/21.jpg)
1
1
1
0 0 0 1 1 1 1 0CDC DC D C D C DAB
ABCD
ABCD
A B
A B
A B
A B
00
01
11
10
ABCD
F = + ABCD+ABCD ABCD
![Page 22: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/22.jpg)
A B C F
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 0
Truth Table
Karnaugh Map
1 1
1 1
0 0 0 1 1 1 1 0BC
A
0
1
A
A
B CB C B C B C
Create Karnaugh Map
1. Place 1 in the corresponding square
![Page 23: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/23.jpg)
2. Group the adjacent squares:Begin grouping square with 2n-1 for n variables• e.g. 3 variables, A, B, and C
23-1 = 22 = 4 = 21 = 2 = 20 = 1
1 1
1 1
0 0 0 1 1 1 1 0BC
A
0
1
A
A
B CB C B C B C
ABBC ABC F = BC AB ABC+ +
Represent Boolean Functions
![Page 24: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/24.jpg)
1 1
1 1 1
0 0 0 1 1 1 1 0BC
A
0
1
A
A
B CB C B C B C3 variables: 23-1 = 22 = 4 22-1 = 21 = 2 21-1 = 20 = 1
C
AB
F = C + AB
![Page 25: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/25.jpg)
1
1 1 1 1
0 0 0 1 1 1 1 0BC
A
0
1
A
A
B CB C B C B C3 variables: 23-1 = 22 = 4 22-1 = 21 = 2 21-1 = 20 = 1
A
BC
F = A + BC
![Page 26: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/26.jpg)
1 1
1
1
1 1 1
AB 01
01
00
00
CD
11
10
1011
4 variables, A, B, C, D 24-1 = 23 = 8 (maximum); 22 = 4;21 = 2; 20 = 1 (minimum);
CD + BD ABC+F =
![Page 27: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/27.jpg)
1 1
AB 01
01
00
00
CD
11
10
1011
ABDF =
1
1
AB 01
01
00
00
CD
11
10
1011
F = BCD
![Page 28: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/28.jpg)
1 1
1 1
AB 01
01
00
00
CD
11
10
1011
BCF =
1 1 1 1
1 1 1 1
AB 01
01
00
00
CD
11
10
1011
F = A
![Page 29: Chapter 3 Boolean Algebra and Logic Gate (Part 2).](https://reader035.fdocuments.us/reader035/viewer/2022081420/56649d415503460f94a1c3b7/html5/thumbnails/29.jpg)
1 1
1 1
1 1
1 1
AB 01
01
00
00
CD
11
10
1011
F = D