0% found this document useful (0 votes)
121 views8 pages

Logic Gates: The Logic "NAND" Gate

The document discusses logic gates and the NAND gate specifically. It defines a logic gate as a physical model of a Boolean function that takes one or more inputs and produces a single output. It then defines the NAND gate as a combination of an AND gate and inverter such that the output is only low/0 when all inputs are high/1. The NAND gate can be used to build any other logic gate functions and is thus considered a "universal gate".

Uploaded by

Raj Kapoor
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
121 views8 pages

Logic Gates: The Logic "NAND" Gate

The document discusses logic gates and the NAND gate specifically. It defines a logic gate as a physical model of a Boolean function that takes one or more inputs and produces a single output. It then defines the NAND gate as a combination of an AND gate and inverter such that the output is only low/0 when all inputs are high/1. The NAND gate can be used to build any other logic gate functions and is thus considered a "universal gate".

Uploaded by

Raj Kapoor
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

LOGIC GATES

A logic gate is a physical model of a Boolean function, that is, it performs a logical
operation on one or more logic inputs and produces a single logic output. Logic
gates are primarily implemented electronically using diodes or transistors, but can
also be constructed using electromagnetic relays (relay logic), fluidic logic,
pneumatic logic, optics, molecules, or even mechanical elements.

With amplification, logic gates can be cascaded in the same way that Boolean
functions can be composed, allowing the construction of a physical model of all of
Boolean logic, and therefore, all of the algorithms and mathematics that can be
described with Boolean logic.

The Logic "NAND" Gate

Definition
The Logic NAND Gate is a combination of the digital logic AND gate with that of
an inverter or NOT gate connected together in series. The NAND (Not - AND) gate
has an output that is normally at logic level "1" and only goes "LOW" to logic level
"0" when ALL of its inputs are at logic level "1". The Logic NAND Gate is the
reverse or "Complementary" form of the AND gate.

Logic NAND Gate Equivalence


The logic or Boolean expression given for a logic NAND gate is that for Logical
Addition, which is the opposite to the AND gate, and which it performs on the
complements of the inputs. The Boolean expression for a logic NAND gate is
denoted by a single dot or full stop symbol, (.) with a line or Overline, (‾‾) over
the expression to signify the NOT or logical negation of the NAND gate giving us
the Boolean expression of:  A.B = Q.

Then we can define the operation of a 2-input logic NAND gate as being:

"If either A or B are NOT true, then Q is true"

Symbols
There are three symbols for NAND gates: the 'distinctive' (MIL/ANSI) symbol and
the 'rectangular' IEC symbol, as well as a deprecated DIN symbol sometimes
found on old schematics. For more information see logic gate symbols.

MIL/ANSI Symbol IEC Symbol DIN Symbol


Transistor NAND Gate
A simple 2-input logic NAND gate can be constructed using RTL Resistor-transistor
switches connected together as shown below with the inputs connected directly
to the transistor bases. Either transistor must be cut-off "OFF" for an output at Q.

Where R = 10k, R2 = 4.7k and T1, T2 are 2N2222 type

Logic NAND Gates are available using digital circuits to produce the desired logical
function and is given a symbol whose shape is that of a standard AND gate with a
circle, sometimes called an "inversion bubble" at its output to represent the NOT
gate symbol with the logical operation of the NAND gate given as.
The Digital Logic "NAND" Gate
2-input NAND Gate
Symbol Truth Table
B A Q

0 0 1
0 1 1
1 0 1
2-input NAND Gate
1 1 0

Boolean Expression Q = A.B Read as A AND B gives NOT Q

The NAND function can also have any number of individual inputs and commercial
available NAND Gate i.c.´s are available in standard 2, 3, or 4 input types. If
additional inputs are required, then the standard NAND gates can be cascaded
together to provide more inputs for example.

A 4-input NAND Function

The Boolean Expression for this 4-input logic NAND gate will therefore
be:   Q = A.B.C.D

If the number of inputs required is an odd number of inputs any "unused" inputs
can be held HIGH by connecting them directly to the power supply using suitable
"Pull-up" resistors.
The Logic NAND Gate function is sometimes known as the Sheffer Stroke
Function and is denoted by a vertical bar or upwards arrow operator, for
example, A NAND B = A|B or A↑B.

The "Universal" NAND Gate


The Logic NAND Gate is generally classed as a "Universal" gate because it is one
of the most commonly used logic gate types. NAND gates can also be used to
produce any other type of logic gate function, and in practice the NAND gate
forms the basis of most practical logic circuits. By connecting them together in
various combinations the three basic gate types of AND, OR and NOT function can
be formed using only NAND's, for example.

Various Logic Gates using only NAND Gates

As well as the three common types above, Ex-Or, Ex-Nor and standard NOR gates
can be formed using just individual NAND gates.
NOT GATE

A NOT gate is made by joining the inputs of a NAND gate. Since a NAND gate is
equivalent to an AND gate followed by a NOT gate, joining the inputs of a NAND
gate leaves only the NOT part.

Desired Gate NAND Construction

Truth Table
Input A Output Q
0 1
1 0

AND

An AND gate is made by following a NAND gate with a NOT gate as shown below.
This gives a NOT NAND, i.e. AND.

Desired Gate NAND Construction

Input A Input B Output Q


0 0 0
0 1 0
1 0 0
1 1 1
OR

If the truth table for a NAND gate is examined, it can be seen that if any of the inputs
are 0, then the output will be 1. However to be an OR gate, if any input is 1, the output
must also be 1. Therefore, if the inputs are inverted, any high input will trigger a high
output.

Desired Gate NAND Construction

Input A Input B Output Q


0 0 0
0 1 1
1 0 1
1 1 1

NOR

A NOR gate is simply an OR gate with an inverted output:

Desired Gate NAND Construction

Input A Input B Output Q


0 0 1
0 1 0
1 0 0
1 1 0
NAND gate chips are particularly easy to make and are very cheap.  So if we can
make a circuit that consists of other gates entirely from NAND gates, then we can
save a lot on redundancy of our resources.  So we use NAND gates as building
blocks for circuits.

You might also like