Scribd
Upload
461 views24 pages

Simplification of Boolean Expressions and Universal Gates

The document discusses simplifying Boolean logic expressions using Boolean algebra rules and laws. It provides an example of simplifying the expression AB + A'B + C + BB' + C. The document also discusses how NAND and NOR gates are considered universal gates as they can be used to implement any Boolean logic circuit. It provides examples of how to implement the basic logic gates (AND, OR, NOT) using only NAND gates or only NOR gates. Finally, it shows an example of designing a logic circuit for the expression Y=(A'B+C)' using only NAND gates and only NOR gates, and compares the number of gates required for each.

Uploaded by

Bulls Vai
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
461 views24 pages

Simplification of Boolean Expressions and Universal Gates

The document discusses simplifying Boolean logic expressions using Boolean algebra rules and laws. It provides an example of simplifying the expression AB + A'B + C + BB' + C. The document also discusses how NAND and NOR gates are considered universal gates as they can be used to implement any Boolean logic circuit. It provides examples of how to implement the basic logic gates (AND, OR, NOT) using only NAND gates or only NOR gates. Finally, it shows an example of designing a logic circuit for the expression Y=(A'B+C)' using only NAND gates and only NOR gates, and compares the number of gates required for each.

Uploaded by

Bulls Vai
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/ 24

Simplification Using Boolean Algebra

&
Universal Gates
Tawsif Ibne Alam
▪ A large Boolean Logic Expression can often be simplified to a simpler and shorter
Boolean Logic Expression. This is done by applying the laws and rules of Boolean
Algebra.
▪ Using Boolean algebra techniques, simplify this expression:
𝐀𝐁 + 𝐀 𝐁 + 𝐂 + 𝐁 𝐁 + 𝐂

This can be simplified to:


𝐁 + 𝐀𝐂
A.B

A.(B+C)
B+C
B.(B+C)
ҧ
𝐴𝐵𝐶 + (𝐴 + 𝐴)ҧ 𝐵ത 𝐶ҧ + 𝐴𝐶(𝐵 + 𝐵)
ത
𝐴𝐵𝐶ҧ + 𝐵ത 𝐶ҧ + 𝐴𝐶
ҧ
𝐴𝐶 + 𝐴𝐵𝐶 + 𝐵ത 𝐶ҧ
𝐶(𝐴 + 𝐴𝐵)ҧ + 𝐵ത 𝐶ҧ
𝐶(𝐴 + 𝐵) + 𝐵ത 𝐶ҧ ҧ
As (𝐴 + 𝐴𝐵)=A+B
𝐴𝐶 + 𝐵𝐶 + 𝐵ത 𝐶ҧ
Universal Gates
• Although we can implement any circuit with AND/OR/NOT, we can
also implement any circuit with only NAND or NOR gates.
• We might want to do this because of technology considerations, that
is, these gates might be cheaper to implement in silicon or they
might be the only type of gates we have available.
• Since we can always use only NAND or NOR gates, these gates are
sometimes called universal gates.
• The “trick” (if you want to call it that) is to see that we can implement
the three basic gates (AND, OR, NOT) in terms of NAND or NOR gates.
Universal Property of NAND and NOR gate
The NAND gate as a Universal logic gate:

• 1) One NAND gate used as an inverter (NOT gate):

𝐴. 𝐴 = 𝐴ҧ

• 2) Two NAND gates used as an AND gate

• ) Three NAND gates used as an OR gate

𝐴.ҧ 𝐵ത = 𝐴ҧ + 𝐵ത = 𝐴 + 𝐵
The NOR gate as a Universal logic gate:
• 1) One NOR gate used as an inverter (NOT gate):

• 2) Two NOR gates used as an OR gate:

• 3) Three NOR gates used as an AND gate:


Steps for Construction of Logic circuits Using
Universal Gates
1)First construct the logic expression using basic gates ( AND/OR/NOT),
2)Replace each basic gate with its equivalent universal gate
implementation,
3)Cancel two consecutive NOT gates (according to Boolean algebra),
4)Redraw the final circuit.
Example: Implement the following expression with (a) NAND gates ONLY, (b) NOR
gates ONLY.
Y=(AB’+C)’D+E= 𝐴. 𝐵ത + 𝐶 . 𝐷 + 𝐸

Solution:
Implementation using NAND gates ONLY:

i) Implementation with Basic gates:

C
D
E
(ii) Replace each basic gate with its equivalent NAND gate implementation from Table 1.

Red circle = NOT op


Green circle = AND op
Blue circle= OR op

A’’=A
A’
(iii) Cancel two consecutive NOT equivalent gates (according to Boolean algebra).
A
(iv)Redraw the final circuit
A (A.B’)’
[ 𝐴. 𝐵ത . 𝐶]ҧ (𝐴. 𝐵ത + C)
B’
(𝐴. 𝐵ത + C) . 𝐷
(𝐴. 𝐵ത + C) 𝐴. 𝐵ത + 𝐶 . 𝐷. 𝐸ത
C’
𝐴. 𝐵ത + 𝐶 . 𝐷 + 𝐸ധ
𝐴. 𝐵ത + 𝐶 . 𝐷 + 𝐸
𝐸ത

(b) Implementation using NOR gates ONLY:

(i) Implementation with Basic gates:


(ii) Replace each basic gate with its equivalent NOR gate implementation from Table 1.
Red Circle = NOT op
Blue Circle/ Region = AND op
Green Circle/ Region = OR op

(iii) Cancel two consecutive NOT equivalent gates (according to Boolean algebra).
(iv)Redraw the final circuit.
In Class Activity
• Design the following equation using i) NAND gates only ii) NOR gates
only
• Count the number of gates for each design and comment on which
one is better.
•Y=(A’.B+C)’
i) Basic Gate Design
iii) Final Circuit after
reduction

ii) Replacement
using NAND only
i) Basic Gate Design
iii) Final Circuit after
reduction

ii) Replacement
using NOR only
Comment
• Since after design both the circuits using NAND and NOR gates it is
found that NAND gate design requires 5 gates in the final design
while, the NOR gate design requires only 3 gates. So in my opinion,
NOR gate design is more preferred as it has lesser number of gates
and cost effective.

You might also like