- 2068 Baisakh · 4 marks
Why NAND and NOR are universal gates
Short answer
NAND and NOR are universal because each can implement NOT, AND, and OR. Examples: NAND (A A) = A', (A NAND B) NAND (A NAND B) = AB, (A NAND A) NAND (B NAND B) = A+B. Thus any Boolean function can be built with only one type.
Why NAND and NOR gates are called Universal gates? Illustrate with examples.
NAND and NOR gates are called universal gates because each of them alone can realise the three basic operations NOT, AND and OR, and therefore any Boolean function. A complete circuit can thus be made using only one type of gate (e.g. 7400 quad NAND or 7402 quad NOR), which reduces inventory, cost and design effort.
Using NAND only
| Gate | Realisation | Gates |
|---|---|---|
| NOT | 1 | |
| AND | 2 | |
| OR | 3 |
NOT: A --[NAND]-- A' (inputs tied)
AND: A,B --[NAND]--[NAND]-- AB
OR : A --[NAND]-- A' --+
B --[NAND]-- B' --+--[NAND]-- A+B
Using NOR only
| Gate | Realisation | Gates |
|---|---|---|
| NOT | 1 | |
| OR | 2 | |
| AND | 3 |
NOT: A --[NOR]-- A'
OR : A,B --[NOR]--[NOR]-- A+B
AND: A --[NOR]-- A' --+
B --[NOR]-- B' --+--[NOR]-- AB
Example: can be done with three NAND gates: (NAND-NAND form of an SOP).
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Universal gates; Ex-OR using NAND · Digital Logic, chapter 2
- De Morgan; NOR gate from NAND gates · Digital Logic, chapter 2
- Universal gates; positive and negative logic · Digital Logic, chapter 2
- Minterms/maxterms; K-map Σm(2,4,5,13,14)+d, universal gates · Digital Logic, chapter 3
- De Morgan; X-NOR using a universal gate · Digital Logic, chapter 2
- XOR gate using minimum NAND gates · Digital Logic, chapter 2 · asked 2×
- Why NOR and NAND are universal gates · Basic Electronics Engineering, chapter 6
- Universal motor and why so called · Electrical Machine, chapter 7
- CMOS NAND, NOR (and NOT) circuits · Embedded System, chapter 8 · asked 2×
- X-OR gate using NAND gates only · Basic Electronics Engineering, chapter 6