A NOT gate is the simplest digital logic gate. It takes one input and flips it to the opposite output: if the input is 1, the output is 0, and if the input is 0, the output is 1. This flipping action is called “inversion,” which is why the NOT gate is also known as an inverter. It’s one of the fundamental building blocks used to create every digital circuit, from basic calculators to modern processors.
How a NOT Gate Works
Unlike other logic gates that combine two or more inputs, a NOT gate has exactly one input and one output. Its entire job is to reverse the signal it receives. In digital electronics, signals are represented as binary values: 1 (high voltage, or “on”) and 0 (low voltage, or “off”). When a NOT gate receives a 1, it outputs a 0. When it receives a 0, it outputs a 1.
This behavior is captured in a simple truth table:
- Input 0 → Output 1
- Input 1 → Output 0
In Boolean algebra, the mathematical system behind digital logic, the NOT operation on a variable A is written as Ā (A with a bar over it) or sometimes as A’. The expression reads as “NOT A.” If A equals 1, NOT A equals 0, and vice versa.
The Circuit Symbol
On circuit diagrams, a NOT gate is drawn as a triangle pointing to the right with a small circle (called a “bubble”) at its tip. The triangle represents the gate body, and the bubble specifically indicates the inversion. You’ll see this same bubble appear on other gate symbols whenever an output is inverted, such as on NAND and NOR gates. The input connects to the flat left side of the triangle, and the output comes from the bubble on the right.
How NOT Gates Are Built in Hardware
At the physical level, NOT gates are constructed using transistors, the tiny electronic switches inside every chip. The most common design uses a pair of complementary transistors (one that conducts when the input is high, another that conducts when the input is low) arranged so that a high input pulls the output to ground (0) and a low input pulls the output to the supply voltage (1). This complementary design, called CMOS, is the technology behind virtually all modern processors and memory chips.
You can also find NOT gates packaged as standalone integrated circuits. A single chip like the classic 7404 contains six independent NOT gates, each with its own input and output pin. These are commonly used in electronics prototyping and education.
Why NOT Gates Matter
The NOT gate is one of three universal operations in digital logic, alongside AND and OR. Every possible digital circuit, no matter how complex, can be built from combinations of these three gate types. The NOT gate’s role is to provide the ability to negate or complement a signal, which turns out to be essential for almost every useful computation.
When you combine a NOT gate with an AND gate, you get a NAND gate. Combine it with an OR gate, and you get a NOR gate. Both NAND and NOR are individually “universal gates,” meaning you can construct any other logic function using only one of those types. But neither would exist without the inversion that the NOT gate provides.
Common Uses in Digital Circuits
NOT gates show up constantly in practical circuit design. One straightforward use is signal inversion: if a system needs to respond when a signal is absent rather than present, a NOT gate flips the logic so a 0 triggers the action. For example, many microcontroller pins are “active low,” meaning they activate when pulled to 0 instead of 1. A NOT gate lets you interface these with systems that use “active high” logic.
They’re also key components inside more complex circuits. Flip-flops, which are the basic memory cells that store a single bit of data, rely on NOT gates (or their equivalents) internally. An SR latch, one of the simplest memory circuits, can be built from two cross-connected NOR gates, each of which contains NOT logic. Oscillator circuits use a chain of an odd number of NOT gates connected in a loop, where the output continuously flips back and forth, generating a clock signal that drives the timing of digital systems.
In arithmetic circuits, NOT gates handle the creation of negative numbers. Computers represent negative integers using a system called two’s complement, where you flip all the bits of a number (using NOT gates) and then add one. This makes subtraction possible using the same hardware that performs addition.
NOT Gates in Programming
If you’ve done any programming, you’ve already used the logical equivalent of a NOT gate. In most languages, the exclamation mark (!) or the keyword “not” performs the same inversion on true/false values. Writing if (!doorOpen) checks whether the door is closed, flipping the Boolean value just like a NOT gate flips a binary signal. The concept is identical, just implemented in software rather than hardware.
Bitwise NOT operations also exist in programming, where every bit in a number is flipped simultaneously. This is the software equivalent of running each bit through its own NOT gate in parallel, and it’s used in tasks like creating bit masks, computing checksums, and manipulating low-level data.