Unlocking the Power of NOR Gates:
Implementing Complex Logic Expressions
This is an OR gate followed by a NOT gate, or a NOT-OR gate. If any of
the inputs are high, the output of the NOR gate is low. An OR gate with a tiny
circle on the output serves as the sign. The little circle is a representation
of inversion.
A |
B |
~(A+B) |
0 |
0 |
1 |
0 |
1 |
0 |
1 |
0 |
0 |
1 |
1 |
0 |
Observation:
· By giving input ‘0’ and ‘0’ the output was ‘0’.
· By giving input ‘0’ and ‘1’ and output was ‘0’.
· By giving input ‘1’ and ‘0’ and output was ‘0’.
· By giving input ‘1’ and ‘1’ and output was ‘1’
A |
B |
F=A.B |
0 |
0 |
0 |
0 |
1 |
0 |
1 |
0 |
0 |
1 |
1 |
1 |
A |
B |
X=~A |
Y=~B |
X+Y |
A.B=~(X+Y) |
0 |
0 |
1 |
1 |
1 |
0 |
0 |
1 |
1 |
0 |
1 |
0 |
1 |
0 |
0 |
1 |
1 |
0 |
1 |
1 |
0 |
0 |
0 |
1 |
· Step 1: Take Complement of A and Store in X.
· Step 2: Take Complement of B and Store in Y.
· Step 3: Take AND of X.Y.
· Step 4: Complement of ~(X+Y) gives A.B.
Observation:
· By giving input ‘0’ and ‘0’ the output was ‘0’.
· By giving input ‘0’ and ‘1’ and output was ‘1’.
· By giving input ‘1’ and ‘0’ and output was ‘1’.
· By giving input ‘1’ and ‘1’ and output was ‘1’
A |
B |
F=A+B |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
0 |
1 |
1 |
1 |
1 |
A |
B |
A+B |
M=~(A+B) |
~(M) |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
1 |
0 |
1 |
1 |
0 |
1 |
0 |
1 |
1 |
1 |
1 |
0 |
1 |
Observation:
· By giving input ‘0’ and ‘0’ the output was ‘0’.
· By giving input ‘0’ and ‘1’ and output was ‘1’.
· By giving input ‘1’ and ‘0’ and output was ‘1’.
· By giving input ‘1’ and ‘1’ and output was ’0’.
A |
B |
A⊕B |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
0 |
1 |
1 |
1 |
0 |
A |
B |
C=NOR |
X=A+C |
Y=B+C |
~X |
~Y |
M=~X+~Y |
||
0 |
0 |
1 |
1 |
1 |
0 |
0 |
0 |
||
0 |
1 |
0 |
0 |
1 |
1 |
0 |
1 |
||
1 |
0 |
0 |
1 |
0 |
0 |
1 |
1 |
||
1 |
1 |
0 |
1 |
1 |
0 |
0 |
0 |
||
M=~M |
M=~M |
|
|||||||
1 |
0 |
|
|||||||
0 |
1 |
|
|||||||
0 |
1 |
|
|||||||
1 |
0 |
|
· Step 1: Column C store the Values According to NOR operation.
· Step 2: Apply OR operation on A and C, store them in Column X.
· Step 3: Apply OR operation on B and C, store them in Column Y.
· Step 4: Take complement of X and Y.
· Step 5: Again, apply OR operation on Complement of X and Y, store
them in Column M.
· Step 6: Take Complement of M.
· Step 7: Again, Complement of M after that we get XNOR by using
only NOR.
· By giving input ‘0’ and ‘0’ the output was ‘1’.
· By giving input ‘0’ and ‘1’ and output was ‘0’.
· By giving input ‘1’ and ‘0’ and output was ‘0’.
· By giving input ‘1’ and ‘1’ and output was ’1’.
A |
B |
~( A⊕B) |
0 |
0 |
1 |
0 |
1 |
0 |
1 |
0 |
0 |
1 |
1 |
1 |
A |
B |
C=NOR |
X=A+C |
Y=B+C |
~X |
~Y |
M=~X+~Y
|
~M |
0 |
0 |
1 |
1 |
1 |
0 |
0 |
0 |
1 |
0 |
1 |
0 |
0 |
1 |
1 |
0 |
1 |
0 |
1 |
0 |
0 |
1 |
0 |
0 |
1 |
1 |
0 |
1 |
1 |
0 |
1 |
1 |
0 |
0 |
0 |
1 |
· Step 1: Column C store the Values According to NOR operation.
· Step 2: Apply OR operation on A and C, store them in Column X.
· Step 3: Apply OR operation on B and C, store them in Column Y.
· Step 4: Take complement of X and Y.
· Step 5: Again, apply OR operation on Complement of X and Y, store
them in Column M.
· Step 6: Take Complement of M after that we get XNOR by using only OR.
(How many gates are needed to
build a certain gate using NOR are CLICK )
0 Comments