Download - Digital Logic Systems
![Page 1: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/1.jpg)
Digital Logic Systems
Combinational Circuits
![Page 2: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/2.jpg)
Basic Gates&
Truth Tables
![Page 3: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/3.jpg)
Basic Gates
AND Gate OR Gate NOT Gate
![Page 4: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/4.jpg)
More Gates
NAND Gate NOR Gate BUF Gate
![Page 5: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/5.jpg)
More Gates
XNOR GateXOR Gate
![Page 6: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/6.jpg)
n-Input Gates
3-Input XOR Gate
5-Input NOR Gate 5-Input AND Gate
4-Input OR Gate
![Page 7: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/7.jpg)
Definitions
AND It gives a logical output true only if all the inputs are true
OR It gives a logical output true if any of the inputs is true
XOR It gives a logical output true only if an odd-number of inputs is true
NOT It gives a logical output true if the input is false and vice versa
![Page 8: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/8.jpg)
Truth Table
A truth table is a tabular procedure to express the relationship of the outputs to the inputs of a Logical System
![Page 9: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/9.jpg)
Truth Tables for Gates
a b fAND
0 0 00 1 01 0 01 1 1
a b fOR
0 0 00 1 11 0 11 1 1
a fNOT
0 11 0
AND Operation OR Operation
NOT Operation
AND Gate OR Gate NOT Gate
![Page 10: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/10.jpg)
Truth Tables for Gates
a b fNAND
0 0 10 1 11 0 11 1 0
a b fNOR
0 0 10 1 01 0 01 1 0
a fBUF
0 01 1
NAND Operation NOR Operation
BUF Operation
NAND Gate NOR Gate BUF Gate
![Page 11: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/11.jpg)
Truth Tables for Gates
a b fXOR
0 0 00 1 11 0 11 1 0
a b fXNOR
0 0 10 1 01 0 01 1 1
XOR Operation XNOR Operation
XNOR GateXOR Gate
![Page 12: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/12.jpg)
A Bubble Implies a Logical Inversion
Bubbles can be replaced by NOT Gates to get logically equivalent
circuits
Bubbles
![Page 13: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/13.jpg)
![Page 14: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/14.jpg)
![Page 15: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/15.jpg)
![Page 16: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/16.jpg)
![Page 17: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/17.jpg)
![Page 18: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/18.jpg)
![Page 19: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/19.jpg)
![Page 20: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/20.jpg)
![Page 21: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/21.jpg)
![Page 22: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/22.jpg)
Generate tables for all combinations of bubbles and a XOR gate
![Page 23: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/23.jpg)
Gate Equivalence
===
![Page 24: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/24.jpg)
Gate Equivalence
== ?
![Page 25: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/25.jpg)
Gate Equivalence
= =
![Page 26: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/26.jpg)
Switching Expressions
![Page 27: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/27.jpg)
Basic Switching Expressions
AND f = a . b
OR f = a + b
NOT f = a’f = ā
![Page 28: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/28.jpg)
Is there an expression for XOR operation?
![Page 29: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/29.jpg)
![Page 30: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/30.jpg)
![Page 31: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/31.jpg)
Switching Expressions
![Page 32: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/32.jpg)
Switching Expressions
![Page 33: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/33.jpg)
Switching Expressions
f1 = a . b’f2 = (a + b)’
![Page 34: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/34.jpg)
Switching Expressions
![Page 35: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/35.jpg)
Switching Expressions
![Page 36: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/36.jpg)
Switching Expressions
f = ?
![Page 37: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/37.jpg)
Switching Expressions
f = m + n
n = a’ . bm = a . b’
![Page 38: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/38.jpg)
Switching Expressions
f = (a . b’) + (a’ . b)This is the equivalent circuit and equivalent
expression for a XOR operation
![Page 39: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/39.jpg)
From Digital Design, 5th Edition by M. Morris Mano and Michael Ciletti
![Page 40: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/40.jpg)
Switching Expressions
![Page 41: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/41.jpg)
Switching Expressions
![Page 42: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/42.jpg)
Switching Expressions
f1 = a . bf2 = a ^ bf2 = (a . b’) + (a’ . b)
![Page 43: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/43.jpg)
Switching Expressions
![Page 44: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/44.jpg)
x y z p = x ^ y g = x . y m = p . z s = p ^ z c = m + g 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1
![Page 45: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/45.jpg)
x y z p = x ^ y g = x . y m = p . z s = p ^ z c = m + g 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 0 1 1 1 0 1 0 0 1 0 1 0 1 1 0 1 1 0 0 1 1 1 1 0 1
![Page 46: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/46.jpg)
x y z p = x ^ y g = x . y m = p . z s = p ^ z c = m + g 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 1 0 0 0 1 1 1 0 1 1 0 0 1 0 0 1 0 1 1 0 1 1 1 0 0 1 0 1 1 1 0 1 0
![Page 47: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/47.jpg)
x y z p = x ^ y g = x . y m = p . z s = p ^ z c = m + g 0 0 0 0 0 0 0 00 0 1 0 0 0 1 00 1 0 1 0 0 1 00 1 1 1 0 1 0 11 0 0 1 0 0 1 01 0 1 1 0 1 0 11 1 0 0 1 0 0 11 1 1 0 1 0 1 1
![Page 48: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/48.jpg)
x y z s c0 0 0 0 00 0 1 1 00 1 0 1 00 1 1 0 11 0 0 1 01 0 1 0 11 1 0 0 11 1 1 1 1
![Page 49: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/49.jpg)
s = sc = m + g
![Page 50: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/50.jpg)
s = sc = m + g m = p . z
g = g
s = p ^ z
![Page 51: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/51.jpg)
s = sc = m + g m = p . z
g = g
p = x ^ y g = x . y
s = p ^ z
![Page 52: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/52.jpg)
s = sc = m + g
p = x ^ y g = x . y m = (x ^ y) . z
g = g
s = (x ^ y) ^ z
![Page 53: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/53.jpg)
s = (x ^ y) ^ zc = ((x ^ y) . z) + (x . y)
p = x ^ y g = x . y m = (x ^ y) . z
g = g
s = (x ^ y) ^ z
![Page 54: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/54.jpg)
s = (x ^ y) ^ zc = ((x ^ y) . z) + (x . y)
![Page 55: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/55.jpg)
s = ((x . y’) + (x’ . y)) ^ zc = (((x . y’) + (x’ . y)) . z) + (x . y)
![Page 56: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/56.jpg)
s = (((x . y’) + (x’ . y))’ . z) + (((x . y’) + (x’ . y)) . z’)c = (((x . y’) + (x’ . y)) . z) + (x . y)
![Page 57: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/57.jpg)
Procedure
To obtain the output functions from a logic diagram, proceed as follows:
1. Label with arbitrary symbols all gate outputs that are a function of the input variables. Obtain the Boolean Functions for each gate.
2. Label with other arbitrary symbols those gates that are a function of input variables and/or preciously labeled gates. Find the Boolean functions of these gates.
3. Repeat the process in step 2 until all the outputs of the circuit are obtained.4. By repeated substitution of previously defined functions, obtain the output
Boolean functions in terms of input variables only.
![Page 58: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/58.jpg)
![Page 59: Digital Logic Systems](https://reader033.vdocuments.mx/reader033/viewer/2022051623/56815cba550346895dcab65e/html5/thumbnails/59.jpg)