

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Assignment; Class: Logic Synthesis; Subject: Electrical and Computer Engr; University: University of Illinois - Urbana-Champaign; Term: Unknown 1989;
Typology: Assignments
1 / 2
This page cannot be seen from the preview
Don't miss anything!


Divide F = ab + ac + ad’ + bc + bd’ by G = a + b to give a G + RQ form answer [5 points]
Apply the WEAK_DIV procedure to F = abrs + abrt + abd + abe + abu
How would you traverse the factoring tree representing a given factored form, for getting maximal factors? Show with 2 examples why your answer is correct [8 points]
Compute the factorization value for each of the following pairs of SOP and factored form.
Use Lits (P) = No: of literals in SOP form [5 points]
[6 points]
a) Using these filters, can you tell how many resubstitutions will be attempted for the network [5 points]
a
b
c
d
y
y
y3 y
y1y2 (^) y3+d
a+b
a’b’+c
b) Perform these resubstitutions and draw the resulting Boolean network [7 points]
NOTE: Each node of the Boolean network corresponds to a gate and an arc corresponds to a wire between the gates. The actual gates are abstracted, but need not be simple gates. The function performed by each gate is expressed in terms of the labeling on the input arrows.