- Digital Electronics Tutorial
- 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
- Base Conversions
- Binary Numbers Representation
- Binary Arithmetic
- Signed Binary Arithmetic
- Octal Arithmetic
- Hexadecimal Arithmetic
- Complement Arithmetic
- 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
- Two Level Logic Realization
- Threshold Logic
- Boolean Algebra
- Boolean Algebra
- Laws of Boolean Algebra
- Boolean Functions
- DeMorgan's Theorem
- SOP and 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
- Parity Bit Generator and Checker
- Comparators
- Encoders
- Keyboard Encoders
- Priority Encoders
- Decoders
- Demultiplexers
- 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
- 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
- Flip-Flops
- Conversion of Flip-Flops
- Shift Registers
- Shift Register Applications
- Counters
- Finite State Machines
- Algorithmic State Machines
- 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
- 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 XNOR Gate using NOR Gate
The NOR gate is a type of universal logic gate, hence we can use only NOR gates to realize the XNOR logic function.
Designing an XNOR Gate using NOR Gate
To design an XNOR gate using NOR gate, we first derive the XNOR logic function in terms of NOR logic as follows.
The output of XNOR gate is given by,
$$\mathrm{Y \: = \: AB \: + \: \bar{A} \: \bar{B}}$$
To implement an XNOR gate logic using NOR gate, we require a minimum of 4 NOR gates. The circuit diagram of XNOR gate from NOR gate is depicted in the following figure:
In this circuit, the output is
$$\mathrm{Y \: = \: \overline{\overline{A \: + \: \overline{(A \: + \: B)}} \: + \: \overline{B \: + \: \overline{(A \: + \: B)}}}}$$
$$\mathrm{Y \: = \: \overline{\overline{A \: + \: \overline{(A \: + \: B)}}} \: \cdot \: \overline{ \overline{B \: + \: \overline{(A \: + \: B)}}}}$$
$$\mathrm{Y \: = \: (A \: + \: \overline{(A \: + \: B)}) \: \cdot \: (B \: + \: \overline{(A \: + \: B)})}$$
$$\mathrm{Y \: = \: (A \: + \: (\bar{A} \: \cdot \: \bar{B})) \: (B \: + \: (\bar{A} \: \cdot \: \bar{B}))}$$
$$\mathrm{Y \: = \: (A \: + \: \bar{A}) \: (A \: + \: \bar{B}) \: (\bar{A} \: + \: B) \: (B \: + \: \bar{B})}$$
$$\mathrm{Y \: = \: (A \: + \: \bar{B}) \: (\bar{A} \: + \: B)}$$
$$\mathrm{Y \: = \: A\cdot\bar{A} \: + \: \bar{A}\cdot\bar{B} \: + \: A\cdot B \: + \: B\cdot\bar{B}}$$
$$\mathrm{\therefore \: Y \: = \: A\cdot B \: + \: \bar{A}\cdot\bar{B}}$$
This is the desired output of the XNOR gate. Thus, the above shown NOR logic circuit performs the XNOR operation.