Scribd
Upload
111 views9 pages

Hamza DLD Lab Assignment #4

The document is a lab assignment on simplifying Boolean expressions to reduce circuit complexity. It contains 3 tasks - the first task involves simplifying a Boolean expression from 4 gates to 3 gates. The second task simplifies an expression from 3 gates to 3 gates. The third task derives a function from a circuit diagram, simplifies it from 8 gates to 3 gates. Minimizing Boolean expressions reduces the number of logic gates needed and thus reduces circuit complexity.

Uploaded by

Hamza Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
111 views9 pages

Hamza DLD Lab Assignment #4

The document is a lab assignment on simplifying Boolean expressions to reduce circuit complexity. It contains 3 tasks - the first task involves simplifying a Boolean expression from 4 gates to 3 gates. The second task simplifies an expression from 3 gates to 3 gates. The third task derives a function from a circuit diagram, simplifies it from 8 gates to 3 gates. Minimizing Boolean expressions reduces the number of logic gates needed and thus reduces circuit complexity.

Uploaded by

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

Name : Hamza Hanif

Class : Bs(CS) 2
Section: ‘A’
Subject : DLD Lab
Teacher Name : Imran Ahmad
Assignment # 04

Lab 4: Circuit Complexity Reduction by Minimization of Boolean


Expressions

OBJECTIVE:
To learn the advantages of simplifying Boolean expressions and thus helping in reduction of
circuit complexity.
Task # 4.1:
● Simplify the following function
● F=A’D + BD + B’C + AB’D
● Obtain the truth table
● Simulate the circuit in Proteus and build it on bread board.
● Mention the total number of gates used to implement the original function and the
simplified one.

Simplification:
F=A’D + BD + B’C + AB’D
F=A’D+BD+AB’D+B’C
F=D(A’+A.B’.B)+B’C
F=D(1.1)+B’C
F=D+B’C
Circuit:

Truth Table:
B C D B’ B’C D+B’C
0 0 0 1 0 0
0 0 1 1 0 1
0 1 0 1 1 1
0 1 1 1 1 1
1 0 0 0 0 0
1 0 1 0 0 1
1 1 0 0 0 0
1 1 1 0 0 1
No of Gates used:
 For Original Function :- 2 Not Gates, 4 AND Gates(3 gates of two inputs, one
gate of three inputs), 1 OR gate(four inputs). Total 7 gates.

 For Simplified Function:- 1 Not gate, 1 AND gate, 1 OR gate,total 3 gates.


Conclusion:
First we simplify the given function then we use 1 Not gate, 1 AND gate , 1 OR gate to build
this function.

Task # 4.2:
● Simplify the function F1. F1= A’.B’.C’+A’.B’.C+A’.C’
● Obtain the simplified SOP expression and the truth table.
● Simulate the circuit and build it on bread board.

Simplification:
F1= A’.B’.C’+A’.B’.C+A’.C’

F=A’.B’.(C’.C)+A’C’

F=A’.B’+A’.C’

F=A’.(B’+C’)

F=A+B.C

Circuit:
Truth Table:
A B C B.C A+B.C
0 0 0 0 0
0 0 1 0 0
0 1 0 0 0
0 1 1 1 1
1 0 0 0 1
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1

Conclusion:
First we simplify the given function then we use 1 Not gate, 1 AND gate , 1 OR gate to build
this function.

Task # 4.3:
● Derive the function from the given circuit, simplify it and implement the simplified
circuit.
● Mention the total number of gates used to implement the original function and the
simplified one.
Function : F= ABC+A’C+BC’D+AB’C

Simplification :
F= ABC+A’C+BC’D+AB’C

F=ABC+AB’C+A’C+BC’D

F=AC(B+B’)+A’C+BC’D

F=AC(1)+A’C+BC’D

F=C(A+A’)+BC’D

F=C+BC’D

Simplified Circuit:
Truth Table:
B C D C’ BC’D C+BC’D
0 0 0 1 0 0
0 0 1 1 0 0
0 1 0 0 0 1
0 1 1 0 0 1
1 0 0 1 0 0
1 0 1 1 1 1
1 1 0 0 0 1
1 1 1 0 0 1

No of Gates used:
 For Original Function :- 3 Not gates. 4 AND gates, 1 OR gate, total 8 gates.
 For Simplified Function:- 1 Not gate, 1 AND gate, 1 OR gate, total 3 gates.
Answer the following questions

1. How does minimization help in reducing the circuit’s complexity?


Answer:
The process of simplifying the algebraic expression of a Boolean function is called
minimization. Minimization is important since it reduces the cost and complexity of the
associated circuit. The minimized version of the expression takes a less number of logic
gates and also reduces the complexity of the circuit substantially.
2. For the function F= A’B’D+A’BD+AC’D+ACD+AB’D’
b) Simulate the circuit with simplification
Simplification:-
F= A’B’D+A’BD+AC’D+ACD+AB’D’
F=A’D(B’+B)+AD(C’+C)+AB’D
F=A’D(1)+AD(1)+AB’D
F=A’D+AD+AB’D
F=D(A’+A)+AB’D
F=D(1)+AB’D
F=D+AB’D

a) Simulate the circuit without simplification


Circuit :
b) Simulate the circuit with simplification
Circuit:

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy