Cairo

University
Faculty of
Engineering

Electronics and
Electrical
Communications
Engineering Department

ELC 448 Advanced Topics in Logic Design - Elective Course 2

Fourth Year 1436/1437 H (2015/2016) - Term 1
Final Exam Rabia Al-Akhar 1437 H (January 2016) - 2 Hours

Question 1 Boolean Decomposition (20 minutes)

a. [4 marks] Write the logic expression of the Boolean Difference of the n-variable Boolean
function (1 , 2 , , ) with respect to an arbitrary variable in terms of cofactors of with
respect to that variable. Find the simplest Boolean expression of the Boolean Difference , the
Universal Quantification , and the Existential Quantification of the n-variable XOR
function (1 , 2 , , ) = 1 2 .
b. [8 marks] Prove for the Boolean function (1 , 2 , , ) = (1 , 2 , , ) (1 , 2 , , )
that for any variable

Verify the correctness of this rule when = 4, = 2, = 1 4 , and = 2 + 3 .

Question 2 Boolean Satisfiability (20 minutes)

a. [4 marks] Explain briefly what is meant in Boolean Satisfiability by an empty clause, a unit clause, a
unate variable, and a contradiction.
b. [4 marks] Solve the following Boolean SAT problem:
(1 + 2 )(1 + 3 )(1 + 3 + 4 )(1 + 2 + 3 )(2 + 4 )
using the Davis-Putnam Resolution-Based Algorithm.
c. [4 marks] Solve the SAT problem given in part (b) using the Davis-Logemann-Loveland Depth-First
Search Algorithm.
Question 3 Boolean Matching (20 minutes)
a. [4 marks] Find the Unateness and the Onset-Size signatures of the pair of Boolean functions
(1 , 2 , 3 ) = 1 2 + 2 3 + 2 3 and (1 , 2 , 3 ) = 1 2 + 1 2 3.
b. [8 marks] Find all possible matching cases for the pair of Boolean functions given in part (a).

Question 4 Reduced Ordered Binary Decision Diagrams (20 minutes)

a. [4 marks] Write the logic expression of the if-then-else (ITE) operator, and show how the ITE
operator can be used to represent a 2-input NAND gate.
b. [4 marks] Explain briefly how the Onset of an -variable Boolean function can be computed from an
ROBDD representation of the function.
c. [4 marks] Sketch the ROBDD representation of the Boolean function
(1 , 2 , 3 , 4 ) = (1 2 ) (3 + 4 )
with the variable ordering 1 < 2 < 3 < 4 .
Question 5 Logic Optimization (20 minutes)

a. [4 marks] Explain briefly what is meant in logic optimization by an irredundant cover, and an
essential prime implicant.
b. [8 marks] Use the Quine-McCluskey Tabular Minimization method to find the minimum cover of the
following incompletely specified Boolean function
F(, , , ) = (0,1,5,7,8,10,13) + (2,9,14,15)

Question 6 And-Inverter Graphs (20 minutes)

a. [4 marks] Use the AIG representation of the basic logic operations to construct a 2-level AIG
representation of the 4-input OR Boolean function (, , , ) = + + + .
b. [4 marks] Find all 3-feasible structural cuts of the AIG constructed in part (a).
c. [4 marks] Explain briefly how structural hashing in used AIG optimization to reduce the number of
AND nodes.