Combinational Logic Circuits
description
Transcript of Combinational Logic Circuits
![Page 1: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/1.jpg)
CombinationalLogic Circuits
Chapter 2
Mano and Kime
![Page 2: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/2.jpg)
CombinationalLogic Circuits
• Binary Logic and Gates
• Boolean Algebra
• Standard Forms
• Map Simplification
• NAND and NOR Gates
• Exclusive-OR Gates
• Integrated Circuits
![Page 3: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/3.jpg)
Digital Logic Gates
*
![Page 4: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/4.jpg)
Gates with More than Two Inputs
![Page 5: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/5.jpg)
CombinationalLogic Circuits
• Binary Logic and Gates
• Boolean Algebra
• Standard Forms
• Map Simplification
• NAND and NOR Gates
• Exclusive-OR Gates
• Integrated Circuits
![Page 6: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/6.jpg)
Basic Identities of Boolean Algebra
![Page 7: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/7.jpg)
Implementation of Boolean Function with Gates
![Page 8: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/8.jpg)
CombinationalLogic Circuits
• Binary Logic and Gates
• Boolean Algebra
• Standard Forms
• Map Simplification
• NAND and NOR Gates
• Exclusive-OR Gates
• Integrated Circuits
![Page 9: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/9.jpg)
Minterms for Three Variables
![Page 10: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/10.jpg)
Sum of Products Design
X Y minterms0 0 m0 = !X & !Y0 1 m1 = !X & Y1 0 m2 = X & !Y1 1 m3 = X & Y
![Page 11: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/11.jpg)
Sum of Products Design
X Y Z0 0 00 1 11 0 11 1 0
Design an XOR gate
m1 = !X & Ym2 = X & !Y
Z = m1 + m2 = (!X & Y) + (X & !Y)
![Page 12: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/12.jpg)
X Y
X !X Y !Y
Sum of Products: Exclusive-OR
!X & Y
X & !Y
Z = (!X & Y) + (X & !Y)
![Page 13: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/13.jpg)
Maxterms for Three Variables
![Page 14: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/14.jpg)
Product of Sums Design
Maxterms:A maxterm is NOT a mintermmaxterm M0 = NOT minterm m0M0 = m0’ =(X’ . Y’)’ = (X + Y)” = X + Y
![Page 15: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/15.jpg)
Product of Sums Design
X Y minterms maxterms0 0 m0 = !X . !Y M0 = !m0 = X + Y0 1 m1 = !X . Y M1 = !m1 = X + !Y1 0 m2 = X . !Y M2 = !m2 = !X + Y1 1 m3 = X . Y M3 = !m3 = !X + !Y
![Page 16: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/16.jpg)
Product of Sums Design
X Y Z0 0 00 1 11 0 11 1 0
Design an XOR gate
Z is NOT minterm m0
AND it is NOT minterm m3
![Page 17: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/17.jpg)
Product of Sums Design
X Y Z0 0 00 1 11 0 11 1 0
Design an XOR gate
M0 = X + Y
M3 = !X + !Y
Z = M0 & M3 = (X + Y) & (!X + !Y)
![Page 18: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/18.jpg)
X Y
X !X Y !Y
X + Y
!X + !Y
Z
Z = (X + Y) & (!X + !Y)
Product of Sums: Exclusive-OR
![Page 19: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/19.jpg)
Three- Level and Two- Level Implementation
![Page 20: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/20.jpg)
CombinationalLogic Circuits
• Binary Logic and Gates
• Boolean Algebra
• Standard Forms
• Map Simplification
• NAND and NOR Gates
• Exclusive-OR Gates
• Integrated Circuits
![Page 21: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/21.jpg)
Two-Variable Map
![Page 22: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/22.jpg)
Three-Variable Map
![Page 23: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/23.jpg)
Three- Variable Map: Flat and on a Cylinder to Show Adjacent Squares
![Page 24: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/24.jpg)
Three-variable K-Maps
XYZ
00 01 11 10
0
1
1 1
1 1
F = !X & !Y + X & Z
![Page 25: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/25.jpg)
Three-variable K-Maps
XYZ
00 01 11 10
0
1
1 1
1 1
F = !X & !Y & !Z + !X & !Y & Z + X & !Y & Z + X & Y & Z
F = !X & !Y & (!Z + Z) + X & Z & (!Y + Y) = !X & !Y + X & Z
![Page 26: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/26.jpg)
Three-variable K-Maps
XYZ
00 01 11 10
0
1 1
1
1 1
F = Y & !Z + X
1
![Page 27: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/27.jpg)
Three-variable K-Maps
XYZ
00 01 11 10
0
1
1 1
1 11
1
F = !X & !Y + X & y + Z
![Page 28: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/28.jpg)
Three-variable K-Maps
XYZ
00 01 11 10
0
1
1 1
1 1
F = X & Z + !X & !Z
![Page 29: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/29.jpg)
Three-variable K-Maps
XYZ
00 01 11 10
0
1
1 1
1 1
1
1
F = Y + !Z
![Page 30: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/30.jpg)
Three-variable K-Maps
X
YZ00 01 11 10
0
1
0 1 23
4 5 67
1 1
1 1
F = m0 + m2 + m5 + m7 = (0,2,5,7)
![Page 31: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/31.jpg)
Four-Variable Map
![Page 32: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/32.jpg)
Four-Variable Map: Flat and on a Torus to Show Adjacencies
![Page 33: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/33.jpg)
Four-variable K-Maps
WXYZ
00 01 11 10
00
01
11
10
0 1 3 2
4 5 7 6
8 9
13 15 14
11 10
12
Each square is numbered in the above K-map
![Page 34: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/34.jpg)
Four-variable K-Maps
WXYZ
00 01 11 10
00
01
11
10
0 1 23
4 5 67
8 9 1011
12 13 1415
F(W,X,Y,Z) = (2,4,5,6,7,9,13,14,15)
![Page 35: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/35.jpg)
Four-variable K-Maps
1 11
1
1
WXYZ
00 01 11 10
00
01
11
10
111
1
F = !W & X + X & Y + !W & Y & !Z + W & !Y & Z
![Page 36: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/36.jpg)
CombinationalLogic Circuits
• Binary Logic and Gates
• Boolean Algebra
• Standard Forms
• Map Simplification
• NAND and NOR Gates
• Exclusive-OR Gates
• Integrated Circuits
![Page 37: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/37.jpg)
Prime Implicants
F = XY’Z + X’Z’ + X’Y
Each product termis an implicant
A product term that cannot have any of itsvariables removed and still imply the logicfunction is called a prime implicant.
![Page 38: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/38.jpg)
CombinationalLogic Circuits
• Binary Logic and Gates
• Boolean Algebra
• Standard Forms
• Map Simplification
• NAND and NOR Gates
• Exclusive-OR Gates
• Integrated Circuits
![Page 39: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/39.jpg)
Digital Logic Gates
>
![Page 40: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/40.jpg)
>
![Page 41: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/41.jpg)
��Logical Operations with NAND Gates
![Page 42: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/42.jpg)
Alternative Graphics Symbols for NAND and NOT Gates
![Page 43: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/43.jpg)
��Logical Operations with NOR Gates
![Page 44: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/44.jpg)
Two Graphic Symbols for NOR Gate
![Page 45: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/45.jpg)
Generalized De Morgan’s Theorem
• NOT all variables
• Change & to + and + to &
• NOT the result
• --------------------------------------------
• F = X & Y + X & Z + Y & Z
• F = !((!X + !Y) & (!X + !Z) & (!Y + !Z))
• F = !(!(X & Y) & !(X & Z) & !(Y & Z))
![Page 46: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/46.jpg)
X
Y
X
Z
Y
Z
F
F = !(!(X & Y) & !(X & Z) & !(Y & Z))
![Page 47: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/47.jpg)
X
Y
X
Z
Y
Z
F
F = !(!(X & Y) & !(X & Z) & !(Y & Z))
NAND Gate
![Page 48: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/48.jpg)
X Y
X Z
Y Z
F
F = X & Y + X & Z + Y & Z
![Page 49: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/49.jpg)
CombinationalLogic Circuits
• Binary Logic and Gates
• Boolean Algebra
• Standard Forms
• Map Simplification
• NAND and NOR Gates
• Exclusive-OR Gates
• Integrated Circuits
![Page 50: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/50.jpg)
Exclusive-OR Gate
XOR
X
YZ
Z = X $ Y
X Y Z0 0 00 1 11 0 11 1 0
X $ 0 = XX $ 1 = !XX $ X = 0X $ !X = 1
X $ !Y = !(X $ Y)!X $ Y = !(X $ Y)A $ B = B $ A(A $ B) $ C = A $ (B $ C)
= A $ B $ C
![Page 51: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/51.jpg)
Exclusive-OR Constructed with NAND gates
X & (!X + !Y) + Y & (!X + !Y) = X & !X + X & !Y + Y & !X + Y & !Y= X & !Y + Y & !X= X & !Y + !X & Y= X $ Y
![Page 52: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/52.jpg)
Parity Generation and Checking
![Page 53: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/53.jpg)
CombinationalLogic Circuits
• Binary Logic and Gates
• Boolean Algebra
• Standard Forms
• Map Simplification
• NAND and NOR Gates
• Exclusive-OR Gates
• Integrated Circuits
![Page 54: Combinational Logic Circuits](https://reader035.fdocuments.net/reader035/viewer/2022062500/56815b1b550346895dc8cb12/html5/thumbnails/54.jpg)
Fully Complementary CMOS Gate Structure and Examples
An Integrated circuit (IC) is a silicon semiconductor crystal, containing the components for the digital gates. The various gates are connected on the chip to form the IC.