NAND gate

From Fox Labs Wiki
Revision as of 14:42, 8 November 2023 by Inari (talk | contribs) (Created page with "{| class="wikitable floatright" style="text-align:center" |- ! colspan="3" | NAND gate truth table |- bgcolor="#ddeeff" |colspan=2|'''Input''' || '''Output''' |- bgcolor="#ddeeff" | A || B || A NAND B |- |{{no2|0}} || {{no2|0}} || {{yes2|1}} |- |{{no2|0}} || {{yes2|1}} || {{yes2|1}} |- |{{yes2|1}} || {{no2|0}} || {{yes2|1}} |- |{{yes2|1}} || {{yes2|1}} || {{no2|0}} |} In digital electronics, a '''NAND gate''' is a logic gate which produces an output of false...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
NAND gate truth table
Input Output
A B A NAND B
0 0 1
0 1 1
1 0 1
1 1 0

In digital electronics, a NAND gate is a logic gate which produces an output of false when all its inputs are true; thus the outputs are the complement of the AND gate. A LOW (0) output results only if all the inputs to the gate are HIGH (1); if any input is LOW (0), a HIGH (1) output results.

The NAND gate is significant because any Boolean function can be implemented by using a combination of NAND gates. This property is called "functional completeness". It shares this property with the NOR gate. Digital systems employing certain logic circuits take advantage of NAND's functional completeness.

A two-input NAND gate can be expressed in Boolean logic as .

Functional completeness

Construction of a NAND gate from four NOR gates.

The NAND gate has the property of functional completeness, which it shares with the NOR gate. That is, any other logic function (AND, OR, etc.) can be implemented using only NAND gates.

As NOR gates are also functionally complete, if no specific NAND gates are available, one can be made from NOR gates using NOR logic.