Академический Документы
Профессиональный Документы
Культура Документы
Z = X & Y
OR Gate
OR
X Y Z
X 0 0 0
Z 0 1 1
Y 1 0 1
1 1 1
Z = X | Y
NOT Gate -- Inverter
NOT X Y
X Y 0 1
1 0
Y = ~X
NAND Gate
NAND
X Y Z
X 0 0 1
0 1 1
Z
1 0 1
Y 1 1 0
Z = ~(X & Y)
nand(Z,X,Y)
NAND Gate
NOT-AND
X Y W Z
X 0 0 0 1
W 0 1 0 1
Z
1 0 0 1
Y 1 1 1 0
W = X & Y
Z = ~W = ~(X & Y)
NOR Gate
NOR
X Y Z
X 0 0 1
Z 0 1 0
Y 1 0 0
1 1 0
Z = ~(X | Y)
nor(Z,X,Y)
NOR Gate
NOT-OR
X Y W Z
X 0 0 0 1
W Z 0 1 1 0
Y 1 0 1 0
1 1 1 0
W = X | Y
Z = ~W = ~(X | Y)
Proving NAND gate is universal
Proving NOR gate is universal
Conclusion::
Any circuit which is designed by using NOT,
AND, and OR gates can also be designed using
only NAND gates.
14
Exclusive-OR Gate
XOR X Y Z
X
Z 0 0 0
Y
0 1 1
1 0 1
1 1 0
X Y XY XY
Exclusive-NOR Gate
XNOR X Y Z
X
Z 0 0 1
Y
0 1 0
1 0 0
1 1 1
Z XY
Logical Gates and
Combinatorial Circuits
In circuitry theory, NOT, AND, and OR gates are
the basic gates. Any circuit can be designed using
these gates. The circuits designed depend only on
the inputs, not on the output. In other words,
these circuits have no memory. Also these circuits
are called combinatorial circuits.
0 0 0 1 0 1 0 1
0 1 0 1 1 0 1 0
1 0 0 1 1 0 1 0
1 1 1 0 1 0 0 1
THE END