Boolean logic in CMOS - University of Texas at Austin · Boolean logic in CMOS. University of Texas...
Transcript of Boolean logic in CMOS - University of Texas at Austin · Boolean logic in CMOS. University of Texas...
![Page 1: Boolean logic in CMOS - University of Texas at Austin · Boolean logic in CMOS. University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 2 Representations](https://reader033.fdocuments.net/reader033/viewer/2022041609/5e36a1e76f667c47cc76d696/html5/thumbnails/1.jpg)
University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell
Boolean logic in CMOS
![Page 2: Boolean logic in CMOS - University of Texas at Austin · Boolean logic in CMOS. University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 2 Representations](https://reader033.fdocuments.net/reader033/viewer/2022041609/5e36a1e76f667c47cc76d696/html5/thumbnails/2.jpg)
University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 2
Representations of Boolean logic
Truth tableBoolean equationCircuit element (gate)
![Page 3: Boolean logic in CMOS - University of Texas at Austin · Boolean logic in CMOS. University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 2 Representations](https://reader033.fdocuments.net/reader033/viewer/2022041609/5e36a1e76f667c47cc76d696/html5/thumbnails/3.jpg)
University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 3
Truth table
Brute force I/O specificationGrows exponentially with number of inputs
![Page 4: Boolean logic in CMOS - University of Texas at Austin · Boolean logic in CMOS. University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 2 Representations](https://reader033.fdocuments.net/reader033/viewer/2022041609/5e36a1e76f667c47cc76d696/html5/thumbnails/4.jpg)
University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 4
Boolean algebra
Identitiesx + 0 = xx + 1 = 1x + x = xx + x’ = 1x’’ = xx * 1 = xx * 0 = 0x * x = xx * x’ = 0
![Page 5: Boolean logic in CMOS - University of Texas at Austin · Boolean logic in CMOS. University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 2 Representations](https://reader033.fdocuments.net/reader033/viewer/2022041609/5e36a1e76f667c47cc76d696/html5/thumbnails/5.jpg)
University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 5
Boolean algebra
Commutativityx + y = y + xx * y = y * xAssociativityx + (y + z) = (x + y) + zx * (y * z) = (x * y) * z
![Page 6: Boolean logic in CMOS - University of Texas at Austin · Boolean logic in CMOS. University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 2 Representations](https://reader033.fdocuments.net/reader033/viewer/2022041609/5e36a1e76f667c47cc76d696/html5/thumbnails/6.jpg)
University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 6
Boolean algebra
Distributivex * (y + z) = x*y + x*zx + (y * z) = (x+y) * (x+z)
= x + xy + xz + yz= x(1+y) + xz + yz= x + xz + yz= x(1+z) + yz= x + yz
De Morgan(x + y)' = x' * y'(x * y)' = x' + y'
![Page 7: Boolean logic in CMOS - University of Texas at Austin · Boolean logic in CMOS. University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 2 Representations](https://reader033.fdocuments.net/reader033/viewer/2022041609/5e36a1e76f667c47cc76d696/html5/thumbnails/7.jpg)
University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 7
CMOS gates - NOT
gnd0110
OutIn
![Page 8: Boolean logic in CMOS - University of Texas at Austin · Boolean logic in CMOS. University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 2 Representations](https://reader033.fdocuments.net/reader033/viewer/2022041609/5e36a1e76f667c47cc76d696/html5/thumbnails/8.jpg)
University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 8
CMOS gates - NAND
gnd
a
b
Vdd
011101
10B
1010
OutA
![Page 9: Boolean logic in CMOS - University of Texas at Austin · Boolean logic in CMOS. University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 2 Representations](https://reader033.fdocuments.net/reader033/viewer/2022041609/5e36a1e76f667c47cc76d696/html5/thumbnails/9.jpg)
University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 9
CMOS gates - NOR
a
b
Vdd
011001
10B
0010
OutA
![Page 10: Boolean logic in CMOS - University of Texas at Austin · Boolean logic in CMOS. University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 2 Representations](https://reader033.fdocuments.net/reader033/viewer/2022041609/5e36a1e76f667c47cc76d696/html5/thumbnails/10.jpg)
University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 10
CMOS gates - AND
NO!Logically correct, butviolates n to n and p to p rule,passes weak values
111001
10B
0000
OutAVdd
A
B Out
Vdd
A
B
Out
![Page 11: Boolean logic in CMOS - University of Texas at Austin · Boolean logic in CMOS. University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 2 Representations](https://reader033.fdocuments.net/reader033/viewer/2022041609/5e36a1e76f667c47cc76d696/html5/thumbnails/11.jpg)
University of Texas at Austin CS310 - Computer Organization Spring 2009 Don Fussell 11
CMOS gates - OR
A
B Out
Vdd
111101
10B
1000
OutA