hw10_soln - ECE3060:VLSIandAdvancedDigitalDesign Fall2006

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

View Full Document Right Arrow Icon
ECE3060: VLSI and Advanced Digital Design Fall 2006 Homework #10: due November 2, 4:30pm Solutions Use the expression format for answering 1(a), 1(d), and 2(c), e.g., C = ab'   + c. 1. Consider the following binary function: F(a; b; c; d) =m(0; 2; 3; 4; 6; 7; 9; 11; 12; 13; 15) (a) Find an initial cover C using the Expand operation. Use the following rules: visit minterms in the order they appear in F. expand variables under the ordering [c; a; b; d]. minterm expand in c expand in a expand in b expand in d 0000 0010 00*0 0**0 0011 *011 **11 0100 0110 0111 1001 1011 10*1 1**1 1100 *100 1101 1111 The remaining primes are { 0**0, **11, 1**1, *100 }. Using the expression format:  C = a'd' + cd + ad + bc'd' -2.5 Did not use expression format (b) For each implicant in C, indicate if it is reducible. If so, give the expression for the reduced implicant, e.g., “ab'   can be reduced to ab ' c ' ". You are to examine reducibility only - do not commit your change on C. a'd' cannot be reduced without loosing cover. cd can be reduced to a'cd and still maintain the cover (since acd is covered by ad) ad can be reduced to ac'd (since acd is covered by cd).
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the 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.

Page1 / 4

hw10_soln - ECE3060:VLSIandAdvancedDigitalDesign Fall2006

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online