Scribd
Upload
15 views6 pages

Digital and Analog Electronics

The document discusses universal gates in digital electronics, specifically NAND and NOR gates. It states that NOR gates are universal gates since all binary logic operations can be implemented using only NOR gates. It then shows how to build NOT, OR, AND, XOR, and XNOR gates using only NOR gates by representing their truth tables symbolically.

Uploaded by

Omkar Jha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views6 pages

Digital and Analog Electronics

The document discusses universal gates in digital electronics, specifically NAND and NOR gates. It states that NOR gates are universal gates since all binary logic operations can be implemented using only NOR gates. It then shows how to build NOT, OR, AND, XOR, and XNOR gates using only NOR gates by representing their truth tables symbolically.

Uploaded by

Omkar Jha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Introduction

Universal gates are the one where the logic gates are
capable of implementing any Boolean expression. Since
all the Boolean functions are derived from the universal
gate without the usage of any other gate, thus they are
called universal gate.

Properties :
i. Universal Gates are non-associative in nature.
ii. Universal Gates are commutative in nature.

Types :
In digital electronics, there are only two type of
universal gates. They are:
i. NAND Gate ii. NOR Gate

1
NOR Gate
A NOR gate is the gate constructed by connecting a
NOT gate at the output terminal of the OR gate. So,
NOR gate = Not gate + OR gate
Truth table of NOR Gate
A B Y= A NOR B
0 0 1
0 1 0
1 0 0
1 1 0

Nor Gate Representation :

A NOR gate is also referred to as a universal gate.


Because all binary operations can be realized by only
using NOR gates.

As we know that there are only three basic operations


AND, OR, and NOT. Also, we know that all complex
binary operations can be realized by using these three
basic operations.

2
Building a NOT Gate Using NOR Gates
The truth table of NOT Gate : A Q= Ac
0 1
1 0

Symbolic Representation of NOT from NOR Gate

Building an OR Gate Using NOR Gates


The truth table of OR Gate : A B Q= A+B
0 0 0
0 1 1
1 0 1
1 1 1

Symbolic Representation of OR from NOR Gate

3
Building an AND Gate Using NOR Gates
The truth table of AND Gate : A B Q=A.B
0 0 0
0 1 0
1 0 0
1 1 1

Symbolic Representation of AND from NOR Gate

Building an AND Gate Using NAND Gates


The truth table of NAND Gate : A B Q= (A.B)c
0 0 1
0 1 1
1 0 1
1 1 0

Symbolic Representation of NA ND from NOR Gate

4
Building a XOR Gate Using NOR Gates
The truth table of XOR Gate : A B Q=A⊕B
0 0 0
0 1 1
1 0 1
1 1 0

Symbolic Representation of XOR from NOR Gate

Building a XNOR Gate Using NOR Gates


The truth table of XNOR Gate : A B Q=A⊕B
0 0 1
0 1 0
1 0 0
1 1 1

5
Symbolic Representation of XNOR from NOR Gate

Conclusion
On a concluding note, with the help of universal NOR
Gate all other logic gates have been verified with their
respective truth table(AND, OR, NAND, XOR, XNOR).

You might also like