Digital Logic Design Lab ( 5 ) :
Title: SIMPLIFICATION OF BOOLEAN
FUNCTIONS
Lab Objectives:
1- Simplification of Boolean functions using Maps (2 and 3 variables map)
Lab Exercise:
1. Simplify the following Boolean function using k-map:
F2(x, y, z) = xyz` + y`(x` + xz)
2. Express the function in a sum of Min-terms Write down the detailed algebraic steps used.
3. Draw the simplified function F2
(LOGISIM ) SCREEN SHOT HERE
4. Implement the function F2 >>> verify the truth tabl
INPUTS output
X Y Z F2
Q2 : implement the following circuit
1- Find the expression of D function
2- Represent D function as a sum of product , product of sum (shorthanded
form)
3- Use K-map to simplify the expression
4- Rebuild this circuit using NAND gates only
5- Find the expression of D after applying NAND only