# hw7 - F . (c) Set up the covering clause for F and solve it...

This preview shows page 1. Sign up to view the full content.

ECE3060: VLSI and Advanced Digital Design Fall 2007 Homework #7: due Oct 30, 4:30pm Show all your work to get full credit. 1. Consider the following binary function: F ( a,b,c,d ) = a 0 d + a 0 c 0 d 0 + a 0 b 0 cd + bcd + ab 0 c . (a) Represent F using the empty hypercube provided below. a b c d (b) Is F an irredundant cover? Explain the reason brieﬂy. (c) Is F minimal with respect to single implicant containment? Explain the reason brieﬂy. (d) Is F a prime cover? Explain the reason brieﬂy. 2. Consider the hypercube below that represents a 4-input binary function F ( a,b,c,d ). a b c d (a) Find all prime implicants of F using Quine-McCluskey algorithm. (b) Set up the prime implicant table for
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: F . (c) Set up the covering clause for F and solve it using Patricks method. 3. Using the Branch algorithm, nd a minimum cover and construct a decision tree for the following covering matrix. Also for each minimum cover, give the corresponding selection and status vectors, i.e., the vector x and y from Ax = y (lecture slide 10-20). Always choose the left-most column for branching. (hint: this problem requires branching.) 1 0 0 0 1 1 0 0 0 1 1 1 0 1 0 0 0 1 0 1 1 0 1 0 0 1 0 1 0 1 1 0 1 1 0 0...
View Full Document

## This note was uploaded on 02/19/2010 for the course ECE 3060 taught by Professor Shimmel during the Spring '07 term at Georgia Institute of Technology.

Ask a homework question - tutors are online