test2soln - ECE 3060 Advanced igital esign and VLSI Test ll...

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

View Full Document Right Arrow Icon
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5

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

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ECE 3060 Advanced igital esign and VLSI Test ll July 9, 2009 This exam is closed book closed notes. Calculators are permitted. You may have two sheets of hand written notes. There are four questions and a supplemental quiz. Do read them over before you start to work. If you need to make any assumptions, state them. The meaning of each question should be clear, but if something does not make any sense to you, please ask For clarification. Please continue problems on the back of the previous page. Good Luck! Name (Please print) 5 O [Vi/LO k This exam will be conducted according to the Georgia Tech Honor Code. I pledge to neither give nor receive unauthorized assistance on this exam and to abide by all provisions of the Honor Code. Signed b) (10) If a pair of recursive calls occur (ie a branch), which columns are selecfed by each mm of ’rhe branch? 5L COLIN” 5* (Sf/(ii 5 / my ) l 2. (25) 8005 a) (10) Given F = a €917 6-36, draw the ROBDD For F using the variable order abc. b) (5) In heuristic two-level minimization, what does the EXPAND operator do? EYWHVD MULst i1“ €1.3e fl? an [Aplm ( calm) (4151M? M *9 drth Ora/(S, #‘V‘i ‘J‘ed‘f fl’H CW’f-q’o»? XL C¢L)( [4 4k aww JIM/(eh. 11' 5’71 1“ Jinasz Ukh‘ c) (5) Consider the implicant a c. What is the expansion of this implicant in the a dimension? 1?pr 4/“ m It 2-"? [DC 111’? a(// d) (5) Is the expanded implicant in part c) covered by F in part a)? You must answer this ques- tion only based on your BDD in a). Feel Free to annotate the BDD or recopy it on the previ- ous Page. MAI/{kw I.” a VCM FLC ’ A“) (M {u 4%‘4 7! 1 I “Q9” u is g M 53 F ' 3. (25) Mulfi-level minimization a) (5) In heuristic mulfilevel minimization, what does ’rhe ELIMINATION imnsforma’rion do? X and Y. 6, ~ 2 cl‘ / My :1bé/ W? t— : —— 4 X/f fl ’7"; / X//¢( 1 iréJ I. X? :L q __ 4. (25) Technology Mapping Consider a technology library (AREA costs) containing a NANDZ (Cost—:2), NORZ (Cost-:3) INV (Costzl), and OAIZl (C05t=2). (a) (10) Using the base Function symbols 0 For a NANDZ, O for an inverter, and a hashed circle for inputs, draw the pattern trees for the library. 5% NRNDL Chic?» INV (W‘l‘l ’p‘b’ (b) (15) Using ’rhe circuil shown, draw ’rhe subject free using the symbols From par’r a), and per- form the dynamic programming technology mapping algorithm FOR AREA as presenled in class. You must show each s’rep of lhe algorithm. A correct answer with no (correc’r) work will receive no credit Supplemental Quiz. a) (5) Calcula’re lhe logical efforl ngm For each relevan’r inpu’r of an A0132 gale Show lhe prolo’rype gale complele wi’rh Jrransislor sizes. ABC JIM? f V a 2 + Y _‘ [L gal-0132(2) " 5 5‘ __ Z +- Y a jib]; 72(1) ~ 5 ’ Z/ N b) (5) Calcula’re ’rhe parasilic delay For fhe ga’re in a). 3 + 2 4- 8’ k 6“ ~ 2 | ...
View Full Document

Page1 / 7

test2soln - ECE 3060 Advanced igital esign and VLSI Test ll...

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

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