NAND gate
| Truth table | ||
|---|---|---|
| A | B | A NAND B |
0
|
0
|
1
|
0
|
1
|
1
|
1
|
0
|
1
|
1
|
1
|
0
|
NAND-gates (⊼) are like AND-gates, but without inverting the output.
About[]
NAND stands for NOT AND, which basically means the output is inverted. Yet when comparing it to a regular AND-gate, with one torch less. A NAND outputs 1 always, except when both inputs are on. An ideal version of this gate would propagate in 1 tick.
Formula[]
Starting from the formula of the AND-gate;
(A'+B')'
When inverted;
(A'+B')
A'+B'
One layer of inverting indicates that it only requires 1 tick.
Trivia[]
In real life, this is a fundamental gate. For optimisation, equations are formed into a combination of these.