# hw8 - all global minimum sets of prime implicants such that...

This preview shows pages 1–2. Sign up to view the full content.

ECE3060 October 12, 2006 Homework #8 due Thursday October 19 @ 4:30pm 100 points 1. (20) Consider the following function: f = a’b’c’d’ + a’b’c’d + a’b’cd’ + a’b’cd + ab’c’d + ab’cd’ + abc’d’ + abc’d + abcd’. Use your favorite method to derive all possible prime implicants for f. For full credit, state which method you are using, show all work and explain your work. Also, state how many essential prime implicants you have found. 2. (5) Design an A matrix for your answer to problem 1 above. 3. (35) For the following A matrix, use the Quine-McCluskey Exact 2-Level Logic Minimization algorithm taught in class to find

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: all global minimum sets of prime implicants such that all minterms are covered. Shown are the rows labeled m i and the columns P i . f = a’b’c’d’ + a’b’c’d + a’b’cd’ + a’b’cd + ab’c’d + ab’cd’ + abc’d’ + abc’d + abcd’ If desired, you may use the following hypercubes to help you. 4. (40) Consider the following version of a transmission gate full adder. First, use the method of folding transmission gates into the gates that drive them to come up with a new version of the gate diagram below. Then, for each new complex gate resulting from folding, calculate logical effort per input....
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

hw8 - all global minimum sets of prime implicants such that...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online