
- Digital Electronics - Home
- Digital Electronics Basics
- Types of Digital Systems
- Types of Signals
- Logic Levels And Pulse Waveforms
- Digital System Components
- Digital Logic Operations
- Digital Systems Advantages
- Number Systems
- Number Systems
- Binary Numbers Representation
- Binary Arithmetic
- Signed Binary Arithmetic
- Octal Arithmetic
- Hexadecimal Arithmetic
- Complement Arithmetic
- Base Conversions
- Base Conversions
- Binary to Decimal Conversion
- Decimal to Binary Conversion
- Binary to Octal Conversion
- Octal to Binary Conversion
- Octal to Decimal Conversion
- Decimal to Octal Conversion
- Hexadecimal to Binary Conversion
- Binary to Hexadecimal Conversion
- Hexadecimal to Decimal Conversion
- Decimal to Hexadecimal Conversion
- Octal to Hexadecimal Conversion
- Hexadecimal to Octal Conversion
- Binary Codes
- Binary Codes
- 8421 BCD Code
- Excess-3 Code
- Gray Code
- ASCII Codes
- EBCDIC Code
- Code Conversion
- Error Detection & Correction Codes
- Logic Gates
- Logic Gates
- AND Gate
- OR Gate
- NOT Gate
- Universal Gates
- XOR Gate
- XNOR Gate
- CMOS Logic Gate
- OR Gate Using Diode Resistor Logic
- AND Gate vs OR Gate
- Two Level Logic Realization
- Threshold Logic
- Boolean Algebra
- Boolean Algebra
- Laws of Boolean Algebra
- Boolean Functions
- DeMorgan's Theorem
- SOP and POS Form
- POS to Standard POS Form
- Minimization Techniques
- K-Map Minimization
- Three Variable K-Map
- Four Variable K-Map
- Five Variable K-Map
- Six Variable K-Map
- Don't Care Condition
- Quine-McCluskey Method
- Min Terms and Max Terms
- Canonical and Standard Form
- Max Term Representation
- Simplification using Boolean Algebra
- Combinational Logic Circuits
- Digital Combinational Circuits
- Digital Arithmetic Circuits
- Multiplexers
- Multiplexer Design Procedure
- Mux Universal Gate
- 2-Variable Function Using 4:1 Mux
- 3-Variable Function Using 8:1 Mux
- Demultiplexers
- Mux vs Demux
- Parity Bit Generator and Checker
- Comparators
- Encoders
- Keyboard Encoders
- Priority Encoders
- Decoders
- Arithmetic Logic Unit
- 7-Segment LED Display
- Code Converters
- Code Converters
- Binary to Decimal Converter
- Decimal to BCD Converter
- BCD to Decimal Converter
- Binary to Gray Code Converter
- Gray Code to Binary Converter
- BCD to Excess-3 Converter
- Excess-3 to BCD Converter
- Adders
- Half Adders
- Full Adders
- Serial Adders
- Parallel Adders
- Full Adder using Half Adder
- Half Adder vs Full Adder
- Full Adder with NAND Gates
- Half Adder with NAND Gates
- Binary Adder-Subtractor
- Subtractors
- Half Subtractors
- Full Subtractors
- Parallel Subtractors
- Full Subtractor using 2 Half Subtractors
- Half Subtractor using NAND Gates
- Sequential Logic Circuits
- Digital Sequential Circuits
- Clock Signal and Triggering
- Latches
- Shift Registers
- Shift Register Applications
- Binary Registers
- Bidirectional Shift Register
- Counters
- Binary Counters
- Non-binary Counter
- Design of Synchronous Counter
- Synchronous vs Asynchronous Counter
- Finite State Machines
- Algorithmic State Machines
- Flip Flops
- Flip-Flops
- Conversion of Flip-Flops
- D Flip-Flops
- JK Flip-Flops
- T Flip-Flops
- SR Flip-Flops
- Clocked SR Flip-Flop
- Unclocked SR Flip-Flop
- Clocked JK Flip-Flop
- JK to T Flip-Flop
- SR to JK Flip-Flop
- Triggering Methods:Flip-Flop
- Edge-Triggered Flip-Flop
- Master-Slave JK Flip-Flop
- Race-around Condition
- A/D and D/A Converters
- Analog-to-Digital Converter
- Digital-to-Analog Converter
- DAC and ADC ICs
- Realization of Logic Gates
- NOT Gate from NAND Gate
- OR Gate from NAND Gate
- AND Gate from NAND Gate
- NOR Gate from NAND Gate
- XOR Gate from NAND Gate
- XNOR Gate from NAND Gate
- NOT Gate from NOR Gate
- OR Gate from NOR Gate
- AND Gate from NOR Gate
- NAND Gate from NOR Gate
- XOR Gate from NOR Gate
- XNOR Gate from NOR Gate
- NAND/NOR Gate using CMOS
- Full Subtractor using NAND Gate
- AND Gate Using 2:1 MUX
- OR Gate Using 2:1 MUX
- NOT Gate Using 2:1 MUX
- Memory Devices
- Memory Devices
- RAM and ROM
- Cache Memory Design
- Programmable Logic Devices
- Programmable Logic Devices
- Programmable Logic Array
- Programmable Array Logic
- Field Programmable Gate Arrays
- Digital Electronics Families
- Digital Electronics Families
- CPU Architecture
- CPU Architecture
Implementation of NOT Gate from NOR Gate
A NOT Gate is a basic logic gate that gives an output which is complement of its input. A NOR gate is a universal logic gate that can be used to implement any other type of logic gate. A NOR gate is basically an OR gate followed by a NOT gate.
Read this tutorial to find out how you can implement a NOT gate using NOR gate. Let's start the discussion with a brief overview of NOT and NOR gates.
What is a NOT Gate?
In digital electronics, a NOT gate is a basic logic gate that has only one input and one output. It is type of logic gate whose output is always the complement of its input. Therefore, the NOT gate is also known as an inverter.
If the input of the NOT gate is LOW (Logic 0), then it gives an output that is HIGH (Logic 1). If the input is HIGH (Logic 1), then the NOT gate gives the LOW (logic 0) output. The logic symbol of the NOT gate is shown in Figure-1.

The NOT operation is represented by the '-' (bar) symbol. Therefore, if the input variable of the NOT gate is A, then its output Y is given by,
$$\mathrm{Y \: = \: \bar{A} \: = \: A' }$$
Truth Table of NOT Gate
The truth table of the NOT gate gives the relationship between its input variable and output variable. The following is truth table of the NOT gate −
Input (A) | Output (Y = A') |
---|---|
A | B |
0 | 1 |
1 | 0 |
What is a NOR Gate?
NOR gate is a type of universal gate, therefore, it can be used to implement any other type of logic gate. NOR gate is basically a combination of NOT gate and OR gate, i.e. OR gate followed by a NOT gate is a NOR gate. Thus,
$$\mathrm{NOR \: Gate \: = \: OR \: Gate \: = \: NOT \: Gate}$$
A NOR gate can accept any number of inputs and gives a single output. The output of the NOR gate is assumed HIGH or Logic 1, only when all of its inputs are LOW or Logic 0. For any other combination of inputs, the output of the NOR gate is assumed LOW or Logic 0. The logic symbol of a two input NOR gate is shown in Figure-2.

The operation of the NOR Gate is expressed by,
$$\mathrm{Y \: = \: \overline{A \: + \: B} \: = \: (A \: + \: B)'}$$
Where, A and B are the input variables and Y is the output variable of the NOR gate. The output expression of the NOR gate is read as "Y is equal to A plus B whole bar".
Truth Table of NOR Gate
For different combinations of inputs, we can analyze the operation of the NOR gate using its truth table, which is given below.
Input | Output | |
---|---|---|
A | B | Y = (A + B)' |
0 | 0 | 1 |
0 | 1 | 0 |
1 | 0 | 0 |
1 | 1 | 0 |
Now, let us discuss the implementation of NOT Gate using NOR Gate.
Implementation of NOT Gate from NOR Gate
As discussed above, a NOR gate is a universal gate, therefore, we can use it to realize any other type of logic gate. The implementation of NOT gate from NOR gate is shown in Figure-3.

Hence, to realize the NOT gate using NOR gate, we simply join all its inputs terminals together and apply the signal to be NOTed or inverted to this common input terminal.
Also, we can use the NOR gate as a NOT gate by connecting all its input terminals except one to Logic 0, and applying the signal to be inverted to the remaining terminal. This configuration of NOR Gate as NOT Gate is referred to as a controlled inverter.
Hence, in this way, the NOT gate can be implemented using a NOR gate only.