
- 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 AND Gate from NOR Gate
An AND Gate is a basic logic gate that performs the binary multiplication, i.e., it gives a HIGH or Logic 1 output, only when all its inputs are in HIGH or Logic 1 state. On the other hand, a NOR gate is a type of universal logic gate. Therefore, NOR gate can be used to realize any other type of logic gate.
Before going into the implementation of AND gate using NOR gates only, let us discuss the basic theory of AND Gate and NOR Gate first.
What is an AND Gate?
An AND Gate is a basic logic gate. An AND gate may have two or more than two inputs, but gives only one output. The AND gate gives a LOW (Logic 0) output if any one of its inputs is in the LOW or Logic 0 state, otherwise, it gives a HIGH (Logic 1) state as output. Therefore, the output of the AND gate is HIGH or Logic 1 state, only if all its inputs are HIGH or Logic 1 state.
The AND gate is also known as an "all or nothing gate". The logic symbol of a two input AND gate is shown in Figure-1.

If variables A and B are inputs to the AND gate and Y is the output variable of the AND gate, then the output equation of the AND gate is given by,
$$\mathrm{Y \: = \: A\cdot B}$$
Where, the '.' (dot) symbol represents the AND operation. It is read as "Y is equal to A AND B".
Truth Table of AND Gate
The table that show the relationship between inputs and output of the AND gate is referred to as the truth table of AND gate. The following is the truth table of the AND Gate −
Input | Output | |
---|---|---|
A | B | Y = A · B |
0 | 0 | 0 |
0 | 1 | 0 |
1 | 0 | 0 |
1 | 1 | 1 |
What is a NOR Gate?
NOR Gate is a type of universal logic gate, because this logic gate can be used for realization of any other type of logic gate.
NOR means NOT + OR. That means, the OR output is NOTed or inverted. Therefore, the NOR gate is a combination of OR gate and a NOT gate, i.e.,
$$\mathrm{NOR \: Gate \: = \: OR \: Gate \: + \: NOT \: Gate}$$
A NOR gate is a type of logic gate whose output is HIGH (Logic 1), only when all its inputs are LOW (Logic 0), and it gives an output LOW (Logic 0), even if any of its inputs become HIGH (Logic 1). The logic symbol of a two input NOR gate is shown in Figure-2.

If variables A and B are the input variables and Y is the output variable of the NOR gate, then the output of the NOR gate is given by,
$$\mathrm{Y \: = \: \overline{A \: + \: B} \: = \: (A \: + \: B)'}$$
It is read as "Y is equal to A plus B whole bar".
Truth Table of NOR Gate
The following is the truth table of the NOR gate −
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 AND Gate from NOR Gate.
Implementation of AND Gate from NOR Gate
As mentioned above that the NOR gate is a logic gate, therefore, we may use it to realize an AND gate. The realization of an AND gate from the NOR gates only is shown Figure-3.

Thus, for the realization of an AND gate from NOR gate, we require 3 NOR gates. Where, the first two NOR gates are used to complement the input variables A and B, and the third NOR gate is used to produce an output equivalent to the AND operation.
Output Equation
The outputs of the first two NOR gates are,
$$\mathrm{Y_{1} \: = \: \bar{A}}$$
$$\mathrm{Y_{2} \: = \: \bar{B}}$$
The output of the third NOR gate is,
$$\mathrm{Y \: = \: \overline{\bar{A} \: + \: \bar{B}} \: = \: \bar{\bar{A}} \cdot \bar{\bar{B}} \: = \: A \cdot B} $$
This is the output of an AND gate. Hence, the logic circuit using NOR gates shown in Figure-3 is equivalent to the AND gate.