{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

FINALw07-ANS - 1 McGILL UNIVERSITY Electrical and Computer...

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

View Full Document Right Arrow Icon
1 McGILL UNIVERSITY Electrical and Computer Engineering Department ECSE -323 Winter 2007 FINAL EXAM Question Maximum Points Points Attained 1 10 2 15 3 20 4 15 5 15 6 15 7 15 8 15 9 15 10 20 11 15 12 10 Total 180 points Please write down your name: ANSWER KEY Please write your student ID: ______________________________________ Instructions/Please read carefully! This is a close book exam. No books or notes are allowed. You may use a standard calculator. All work is to be done on the attached sheets and under no circumstance are booklets or loose sheets to be used. Write your name at the top of every sheet. Read the question carefully. If something appears ambiguous, write down your assumption. The points have been assigned according to the formula that 1 point = 1 exam minute, so please pace yourself accordingly.
Background image of page 1

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

View Full Document Right Arrow Icon
Your Name_______________________________________________________ Question 1 : CMOS Circuit Technology (10 points) Draw a CMOS circuit that produces the same function as the circuit shown below A B C F ONLY TRUE VARIABLES ARE AVAILABLE AS INPUTS HINT: Only 8 transistors are required. Remark: A correct solution with more that 8 transistors will receive partial credit. ________________________________________________________________________ ANSWER f8e5 F (A,B,C) = f8e5 A + B C ; F =A ( f8e5 B + f8e5 C ) A F B C C B Vdd 2
Background image of page 2
Your Name_______________________________________________________ Question 2 :Boolean Logic Theory (15 points) (7 points) a) Which of the following are self-dual functions F = x y ; G = f8e5 x ; H = x y z + f8e5 x y + f8e5 x f8e5 y z. (8 points) b) Draw a circuit producing the function F(A,B,C,D) = f8e5 C f8e5 D + f8e5 A f8e5 B f8e5 D + f8e5 A B D + C f8e5 D B + C f8e5 D f8e5 A Using ONLY a minimal number of 2 x 1 MUX’s. ________________________________________________________________________ ANSWER (a) F = x y, F D = x + y , F F D ,therefore, F is not self-dual. G = f8e5 x , G D = f8e5 x, G = G D ,therefore, G is self-dual. H = x y z + f8e5 x y + f8e5 x f8e5 y z, H D = (x + y + z)( f8e5 x + y)( f8e5 x + f8e5 y + z) = (x + y + z)( f8e5 x + yz) = xyz + f8e5 xy + z f8e5 x + yz xy z 00 01 11 10 0 0 1 0 0 1 1 1 1 0 Map of H Map of H D H = H D , therefore, H is self-sual. xy z 00 01 11 10 0 0 1 0 0 1 1 1 1 0 3
Background image of page 3

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

View Full Document Right Arrow Icon
Continue Part (b) on next page…. Your Name_______________________________________________________ Question 2 :Boolean Logic Theory (CONTINUES) (b) We apply the Shannon expansion repeatedly until the residue functions are input variables or fixed polarities. The choice of expansion variable is arbitrary and produces different, although correct, solutions. Expansion with respect to A : F(A,B,C,D) = f8e5 A [ f8e5 C f8e5 D + f8e5 B f8e5 D + B D + C f8e5 D ] + + A [ f8e5 C f8e5 D + C f8e5 D B] Residue functions expansion with respect to B: R0 = [ f8e5 D + f8e5 B f8e5 D + B D ] = f8e5 B [ f8e5 D ] + B[ 1 ] R1 = [ f8e5 C f8e5 D + C f8e5 D B ] = f8e5 B[ f8e5 C f8e5 D ] + B[ f8e5 D ] R10 = [ f8e5 C f8e5 D ] Expanding R10 with respect to C: R10 = f8e5 C[ f8e5 D ] + C[ 0]. The resulting circuit is the following: 4 2 x 1 MUX 2 x 1 MUX 2 x 1 MUX 2 x 1 MUX B D C B F A 0 1 R0 R1 R10
Background image of page 4
Your Name_______________________________________________________ Question 3: VHDL (20 points) (10 points) a) Using a single selected signal assignment statement write a complete VHDL description of a circuit that implements the Boolean functions: Y(1)=XYZ+W Y(2)=WXY+Z Y(3)=X+Y (10 points) b) Using a single process block write a complete VHDL description of a circuit that takes in two 1-bit signals (X and Y) and, on a positive-going clock edge, increments a count value if X and Y have the same value and decrements the count value otherwise. Assume that COUNT represents an 8-bit signed number. If the COUNT value is at its minimum, then do not
Background image of page 5

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

View Full Document Right Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}