Digital Design. Chapter 6: Optimizations and Tradeoffs
|
|
- Melvyn Greene
- 6 years ago
- Views:
Transcription
1 Digitl Design Chpter 6: Optimiztions nd Trdeoffs Slides to ccompny the tetbook Digitl Design, with RTL Design, VHDL, nd Verilog, 2nd Edition, by Frnk Vhid, John Wiley nd Sons Publishers, 2. Frnk Vhid Instructors of courses requiring Vhid's Digitl Design tetbook (published by John Wiley nd Sons) hve permission to modify nd use these slides for customry course-relted ctivities, subject to keeping this copyright notice in plce nd unmodified. These slides my be posted s unnimted pdf versions on publicly-ccessible course websites.. PowerPoint source (or pdf with nimtions) Digitl my Design not be posted 2e to publicly-ccessible websites, but my be posted for students on internl protected sites or distributed directly to students by other electronic mens. Instructors my Copyright mke printouts 2 of the slides vilble to students for resonble photocopying chrge, without incurring roylties. Any other use requires eplicit permission. Instructors my obtin PowerPoint Frnk Vhid source or obtin specil use permissions from Wiley see for informtion. You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
2 Krnugh Mps for Two-Level Size Optimiztion Esy to miss possible opportunities to combine terms when doing lgebriclly Krnugh Mps (K-mps) Grphicl method to help us find opportunities to combine terms Minterms differing in one vrible re djcent in the mp Cn clerly see opportunities to combine terms look for djcent s For F, clerly two opportunities Top left circle is shorthnd for: y z + y z = y (z +z) = y () = y Drw circle, write term tht hs ll the literls ecept the one tht chnges in the circle Circle y, = & y= in both cells of the circle, but z chnges (z= in one cell, in the other) Minimized function: OR the finl terms Digitl Design 2e Frnk Vhid Esier thn lgebriclly: F F F F = y z y z F = y + y Notice not in binry order y z y y z y z y z Tret left & right s djcent too F = + + y z + y z F = y(z + z ) + y (z + z ) F = y* + y * F = y + y y K-mp 7 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
3 K-mps Four djcent s mens two vribles cn be eliminted Mkes intuitive sense those two vribles pper in ll combintions, so one term must be true Drw one big circle shorthnd for the lgebric trnsformtions bove G = y z + y z + + G = (y z + y z + + ) (must be true) G = (y (z +z) + y(z+z )) G = (y +y) G = G Digitl Design 2e Frnk Vhid G Drw the biggest circle possible, or you ll hve more terms thn relly needed y y 8 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
4 K-mps Four djcent cells cn be in shpe of squre OK to cover twice Just like duplicting term Remember, c + d = c + d + d No need to cover s more thn once Yields etr terms not minimized J y y z z H I H = y z + + y z + (y ppers in ll combintions) y z z The two circles re shorthnd for: I = y z + y z + y z + + I = y z + y z + y z + y z + + I = ( y z + y z) + (y z + y z + + ) I = (y z) + () Digitl Design 2e Frnk Vhid 9 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
5 K-mps Circles cn cross left/right sides Remember, edges re djcent Minterms differ in one vrible only Circles must hve, 2, 4, or 8 cells 3, 5, or 7 not llowed 3/5/7 doesn t correspond to lgebric trnsformtions tht combine terms to eliminte vrible Circling ll the cells is OK K y z L E z Function just equls Digitl Design 2e Frnk Vhid You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
6 K-mps for Four Vribles Four-vrible K-mp follows sme principle Adjcent cells differ in one vrible Left/right djcent Top/bottom lso djcent 5 nd 6 vrible mps eist But hrd to use Two-vrible mps eist But not very useful esy to do lgebriclly by hnd F z y F w w y G w F=w y + Digitl Design 2e Frnk Vhid z G=z You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
7 Two-Level Size Optimiztion Using K-mps Generl K-mp method. Convert the function s eqution into sum-of-minterms form 2. Plce s in the pproprite K-mp cells for ech minterm 3. Cover ll s by drwing the fewest lrgest circles, with every included t lest once; write the corresponding term for ech circle 4. OR ll the resulting terms to crete the minimized function. Digitl Design 2e Frnk Vhid 2 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
8 Two-Level Size Optimiztion Using K-mps Generl K-mp method. Convert the function s eqution into sum-of-minterms form 2. Plce s in the pproprite K-mp cells for ech minterm Common to revise () nd (2): Crete sum-of-products Drw s for ech product E: F = w'z + + w'y'z' F w w z w y z Digitl Design 2e Frnk Vhid 3 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
9 Two-Level Size Optimiztion Using K-mps Generl K-mp method. Convert the function s eqution into sum-of-minterms form 2. Plce s in the pproprite K-mp cells for ech minterm 3. Cover ll s by drwing the fewest lrgest circles, with every included t lest once; write the corresponding term for ech circle Emple: Minimize: G = + b c + b*(c + bc ). Convert to sum-of-products G = + b c + bc + bc 2. Plce s in pproprite cells b c G bc bc 4. OR ll the resulting terms to crete the minimized function. 3. Cover s G bc c Digitl Design 2e Frnk Vhid 4. OR terms: G = + c 4 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
10 Two-Level Size Optimiztion Using K-mps Minimize: H = b (cd + c d ) + b c d + b cd + bd + bcd. Convert to sum-of-products: H = b cd + b c d + b c d + b cd + bd + bcd 2. Plce s in K-mp cells 3. Cover s 4. OR resulting terms Four Vrible Emple H b b c d cd b c d b cd bd bcd b d bc bd b cd H = b d + bc + bd Funny-looking circle, but remember tht left/right djcent, nd top/bottom djcent Digitl Design 2e Frnk Vhid 5 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
11 Don t Cre Input Combintions Wht if we know tht prticulr input combintions cn never occur? e.g., Minimize F = y z, given tht y z (=) cn never be true, nd tht y z (=) cn never be true So it doesn t mtter wht F outputs when y z or y z is true, becuse those cses will never occur Thus, mke F be or for those cses in wy tht best minimizes the eqution On K-mp Drw Xs for don t cre combintions Include X in circle ONLY if minimizes eqution Don t include other Xs Digitl Design 2e Frnk Vhid F y z X X Good use of don t cres F y z unneeded X X Unnecessry use of don t cres; results in etr term y 6 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
12 Optimiztion Emple using Don t Cres Minimize: F = bc + bc + b c Given don t cres: bc, bc F bc c b X Note: Introduce don t cres with cution Must be sure tht we relly don t cre wht the function outputs for tht input combintion X F = c + b If we do cre, even the slightest, then it s probbly sfer to set the output to Digitl Design 2e Frnk Vhid 7 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
13 Optimiztion with Don t Cres Emple: Sliding Switch Switch with 5 positions 3-bit vlue gives position in binry Wnt circuit tht Outputs when switch is in position 2, 3, or 4 Outputs when switch is in position or 5 Note tht the 3-bit input cn never output binry, 6, or 7 Tret s don t cre input combintions Digitl Design 2e Frnk Vhid G Without don t cres: F = y + y z G y z 2,3,4, detector X X X y z y y z F With don t cres: F = y + z 8 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
14 Automting Two-Level Logic Size Optimiztion Minimizing by hnd Is hrd for functions with 5 or more vribles My not yield minimum cover depending on order we choose Is error prone Minimiztion thus typiclly done by utomted tools Ect lgorithm: finds optiml solution Heuristic: finds good solution, but not necessrily optiml I () I (b) y z y 4 terms y Digitl Design 2e Frnk Vhid y z z y Only 3 terms 9 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
15 Bsic Concepts Underlying Automted Two-Level Digitl Design 2e Frnk Vhid Logic Size Optimiztion Definitions On-set: All minterms tht define when F= Off-set: All minterms tht define when F= Implicnt: Any product term (minterm or other) tht when cuses F= On K-mp, ny legl (but not necessrily lrgest) circle Cover: Implicnt y covers minterms nd Epnding term: removing vrible (like lrger K-mp circle) y is n epnsion of F y z 4 implicnts of F Note: We use K-mps here just for intuitive illustrtion of concepts; utomted tools do not use K-mps. ' y Prime implicnt: Mimlly epnded implicnt ny epnsion would cover s not in on-set y z, nd y, bove But not or they cn be epnded 2 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
16 Bsic Concepts Underlying Automted Two-Level Definitions (cont) Logic Size Optimiztion Essentil prime implicnt: The only prime implicnt tht covers prticulr minterm in function s on-set Importnce: We must include ll essentil PIs in function s cover In contrst, some, but not ll, nonessentil PIs will be included G y essentil z not essentil not essentil y z y essentil Digitl Design 2e Frnk Vhid 2 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
17 Automted Two-Level Logic Size Optimiztion Method Steps nd 2 re ect Step 3: Hrd. Checking ll possibilities: ect, but computtionlly epensive. Checking some but not ll: heuristic. Digitl Design 2e Frnk Vhid 22 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
18 Tbulr Method Step : Determine Prime Implicnts Methodiclly Compre All Implicnt Pirs, Try to Combine Emple function: F = 'y'z' + 'y'z + ' + y'z + ' + Minterms (3-literl implicnts) () 'y'z' () 'y'z (3) ' 'y'z'+' No 'y'z'+'y'z = 'y' 2-literl implicnts (,) 'y' (,5) y'z (,3) 'z (3,7) Actully, compring ALL pirs isn t necessry just pirs differing in uncomplemented literls by one. Minterms (3-literl implicnts) () 'y'z' () 'y'z (3) ' 2-literl implicnts (,) 'y' (,5) y'z (,3) 'z (3,7) -literl implicnts (,5,3,7) z (,3,5,7) z (5) y'z (5,7) z 2 (5) y'z (5,7) z (6) ' (6,7) y (6) ' (6,7) y (7) 3 (7) Prime implicnts: Digitl Design 2e Frnk Vhid Implicnt's number of uncomplemented literls 'y' y z 23 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
19 Tbulr Method Step 2: Add Essentil PIs to Cover Prime implicnts (from Step ): 'y', y, z Prime implicnts Prime implicnts Prime implicnts Minterms 'y' (,) y (6,7) z (,3,5,7) Minterms 'y' (,) y (6,7) z (,3,5,7) Minterms 'y' (,) y (6,7) z (,3,5,7) () 'y'z' () 'y'z' () 'y'z' () 'y'z () 'y'z () 'y'z (3) ' (3) ' (3) ' (5) y'z (5) y'z (5) y'z (6) ' (6) ' (6) ' (7) (7) (7) () (b) (c) Digitl Design 2e Frnk Vhid If only one X in row, then tht PI is essentil it's the only PI tht covers tht row's minterm. 24 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
20 Tbulr Method Step 3: Use Fewest Remining PIs to Cover Remining Minterms Essentil PIs (from Step 2): 'y', y, z Covered ll minterms, thus nothing to do in step 3 Finl minimized eqution: F = 'y' + y + z Minterms () 'y'z' () 'y'z (3) ' Prime implicnts 'y' (,) y (6,7) z (,3,5,7) (5) y'z (6) ' (7) (c) Digitl Design 2e Frnk Vhid 25 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
21 Problem with Methods tht Enumerte ll Minterms or Compute ll Prime Implicnts Too mny minterms for functions with mny vribles Function with 32 vribles: 2 32 = 4 billion possible minterms. Too much compute time/memory Too mny computtions to generte ll prime implicnts Compring every minterm with every other minterm, for 32 vribles, is (4 billion) 2 = qudrillion computtions Functions with mny vribles could requires dys, months, yers, or more of computtion unresonble Digitl Design 2e Frnk Vhid 26 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
22 Solution Solution to Computtion Problem Don t generte ll minterms or prime implicnts Insted, just tke input eqution, nd try to itertively improve it E: F = bcdefgh + bcdefgh + jklmnop Note: 5 vribles, my hve thousnds of minterms But cn minimize just by combining first two terms: F = bcdefg(h+h ) + jklmnop = bcdefg + jklmnop Digitl Design 2e Frnk Vhid 27 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
23 Two-Level Optimiztion using Itertive Method Method: Rndomly pply epnd opertions, see if helps Epnd: remove vrible from term Like epnding circle size on K-mp e.g., Epnding z to z legl, but epnding z to z not legl, in shown function After epnd, remove other terms covered by newly epnded term Keep trying (iterte) until doesn t help I () I (b) y z y z z z z ' Not legl E: F = bcdefgh + bcdefgh + jklmnop F = bcdefg + bcdefgh + jklmnop F = bcdefg + jklmnop Illustrted bove on K-mp, but itertive method is intended for n utomted solution (no K-mp) Digitl Design 2e Frnk Vhid Covered by newly epnded term bcdefg 28 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
24 E: Itertive Hueristic for Two-Level Logic Size Optimiztion F = + ' + 'y'z' + 'y'z (minterms in on-set) Rndom epnd: F = + ' + 'y'z + 'y'z Legl: Covers ' nd, both in on-set Any implicnt covered by y? Yes, '. F = y + ' + 'y'z' + 'y'z Rndom epnd: F = y + 'y'z' + 'y'z Not legl ( covers y'z', y'z, ', : two not in on-set) Rndom epnd: F = y + 'y'z' + 'y'z Legl X Implicnt covered by 'y': 'y'z X F = y + 'y'z' + 'y'z X X X Digitl Design 2e Frnk Vhid 29 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
25 Multi-Level Logic Optimiztion Performnce/Size Trdeoffs We don t lwys need the speed of two-level logic Multiple levels my yield fewer gtes Emple F = b + cd + ce F2 = b + c(d + e) = (b + c(d + e)) Generl technique: Fctor out literls y + z = (y+z) b c d c e trnsistors 2 gte delys 6 F = b + cd + ce () F b c d e trnsistors 4 gte-delys 4 F2 = (b+c(d+e)) (b) 4 size(trnsistors) F F (c) F dely (gte-delys) Digitl Design 2e Frnk Vhid 3 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
26 Multi-Level Emple Q: Use multiple levels to reduce number of trnsistors for F = bcd + bcef A: bcd + bcef = bc(d + ef) Hs fewer gte inputs, thus fewer trnsistors b c d b c e f 8 22 trnsistors 8 trnsistors 2 gte delys 3 gte delys 2 F b 6 c 4 F2 5 4 F = bcd + bcef () F d e f 4 4 F2 = bc(d + ef) (b) size (trnsistors) 5 (c) F dely (gte-delys) Digitl Design 2e Frnk Vhid 3 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
27 Multi-Level Emple: Non-Criticl Pth Criticl pth: longest dely pth to output Optimiztion: reduce size of logic on non-criticl pths by using multiple levels b c d e g f trnsistors 3 gte-delys 4 F = (+b)c + dfg + efg () 6 F b c b f g trnsistors 3 gte-delys F2 = (+b)c + (d+e)fg (b) F2 Size (trnsistors) (c) F F dely (gte-delys) Digitl Design 2e Frnk Vhid 32 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
28 Automted Multi-Level Methods Min techniques use heuristic itertive methods Define vrious opertions Fctoring : bc + bd = b(c+d) Plus other trnsformtions similr to two-level itertive improvement Digitl Design 2e Frnk Vhid 33 You creted this PDF from n ppliction tht is not licensed to print to novpdf printer (
Introduction to Computer Engineering EECS 203 dickrp/eecs203/ CMOS transmission gate (TG) TG example
Introduction to Computer Engineering EECS 23 http://ziyng.eecs.northwestern.edu/ dickrp/eecs23/ CMOS trnsmission gte TG Instructor: Robert Dick Office: L477 Tech Emil: dickrp@northwestern.edu Phone: 847
More informationChapter 1: Introduction
Chpter : Introduction Slides to ccompny the textbook, First Edition, by, John Wiley nd Sons Publishers, 7. http://www.ddvhid.com Copyright 7 Instructors of courses requiring Vhid's textbook (published
More informationMATH 25 CLASS 5 NOTES, SEP
MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid
More informationUnit #9 : Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More information1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)
Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric
More informationEECS 281: Homework #4 Due: Thursday, October 7, 2004
EECS 28: Homework #4 Due: Thursdy, October 7, 24 Nme: Emil:. Convert the 24-bit number x44243 to mime bse64: QUJD First, set is to brek 8-bit blocks into 6-bit blocks, nd then convert: x44243 b b 6 2 9
More informationINTRODUCTION TO SIMPLICIAL COMPLEXES
INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min
More informationAn Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization
An Efficient Divide nd Conquer Algorithm for Exct Hzrd Free Logic Minimiztion J.W.J.M. Rutten, M.R.C.M. Berkelr, C.A.J. vn Eijk, M.A.J. Kolsteren Eindhoven University of Technology Informtion nd Communiction
More informationECE 468/573 Midterm 1 September 28, 2012
ECE 468/573 Midterm 1 September 28, 2012 Nme:! Purdue emil:! Plese sign the following: I ffirm tht the nswers given on this test re mine nd mine lone. I did not receive help from ny person or mteril (other
More informationStained Glass Design. Teaching Goals:
Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to
More informationDigital Design. Chapter 1: Introduction. Digital Design. Copyright 2006 Frank Vahid
Chpter : Introduction Copyright 6 Why Study?. Look under the hood of computers Solid understnding --> confidence, insight, even better progrmmer when wre of hrdwre resource issues Electronic devices becoming
More informationTree Structured Symmetrical Systems of Linear Equations and their Graphical Solution
Proceedings of the World Congress on Engineering nd Computer Science 4 Vol I WCECS 4, -4 October, 4, Sn Frncisco, USA Tree Structured Symmetricl Systems of Liner Equtions nd their Grphicl Solution Jime
More informationMath 464 Fall 2012 Notes on Marginal and Conditional Densities October 18, 2012
Mth 464 Fll 2012 Notes on Mrginl nd Conditionl Densities klin@mth.rizon.edu October 18, 2012 Mrginl densities. Suppose you hve 3 continuous rndom vribles X, Y, nd Z, with joint density f(x,y,z. The mrginl
More information12-B FRACTIONS AND DECIMALS
-B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn
More information2 Computing all Intersections of a Set of Segments Line Segment Intersection
15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design
More informationAngle properties of lines and polygons
chievement Stndrd 91031 pply geometric resoning in solving problems Copy correctly Up to 3% of workbook Copying or scnning from ES workbooks is subject to the NZ Copyright ct which limits copying to 3%
More informationEngineer To Engineer Note
Engineer To Engineer Note EE-186 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit
More informationWhat do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers
Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single
More informationSection 10.4 Hyperbolas
66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol
More informationScanner Termination. Multi Character Lookahead. to its physical end. Most parsers require an end of file token. Lex and Jlex automatically create an
Scnner Termintion A scnner reds input chrcters nd prtitions them into tokens. Wht hppens when the end of the input file is reched? It my be useful to crete n Eof pseudo-chrcter when this occurs. In Jv,
More information4452 Mathematical Modeling Lecture 4: Lagrange Multipliers
Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl
More informationTheory of Computation CSE 105
$ $ $ Theory of Computtion CSE 105 Regulr Lnguges Study Guide nd Homework I Homework I: Solutions to the following problems should be turned in clss on July 1, 1999. Instructions: Write your nswers clerly
More informationIntegration. September 28, 2017
Integrtion September 8, 7 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my
More information9.1 apply the distance and midpoint formulas
9.1 pply the distnce nd midpoint formuls DISTANCE FORMULA MIDPOINT FORMULA To find the midpoint between two points x, y nd x y 1 1,, we Exmple 1: Find the distnce between the two points. Then, find the
More informationQuestions About Numbers. Number Systems and Arithmetic. Introduction to Binary Numbers. Negative Numbers?
Questions About Numbers Number Systems nd Arithmetic or Computers go to elementry school How do you represent negtive numbers? frctions? relly lrge numbers? relly smll numbers? How do you do rithmetic?
More informationIntegration. October 25, 2016
Integrtion October 5, 6 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my hve
More information1 Drawing 3D Objects in Adobe Illustrator
Drwing 3D Objects in Adobe Illustrtor 1 1 Drwing 3D Objects in Adobe Illustrtor This Tutoril will show you how to drw simple objects with three-dimensionl ppernce. At first we will drw rrows indicting
More informationWhat do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers
Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single
More informationMatrices and Systems of Equations
Mtrices Mtrices nd Sstems of Equtions A mtri is rectngulr rr of rel numbers. CHAT Pre-Clculus Section 8. m m m............ n n n mn We will use the double subscript nottion for ech element of the mtri.
More informationCOMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
More information6.2 Volumes of Revolution: The Disk Method
mth ppliction: volumes by disks: volume prt ii 6 6 Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem 6) nd the ccumultion process is to determine so-clled volumes
More informationBefore We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):
Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters
More informationMATH 2530: WORKSHEET 7. x 2 y dz dy dx =
MATH 253: WORKSHT 7 () Wrm-up: () Review: polr coordintes, integrls involving polr coordintes, triple Riemnn sums, triple integrls, the pplictions of triple integrls (especilly to volume), nd cylindricl
More informationLecture 10 Evolutionary Computation: Evolution strategies and genetic programming
Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting
More informationParallel Square and Cube Computations
Prllel Squre nd Cube Computtions Albert A. Liddicot nd Michel J. Flynn Computer Systems Lbortory, Deprtment of Electricl Engineering Stnford University Gtes Building 5 Serr Mll, Stnford, CA 945, USA liddicot@stnford.edu
More informationConstrained Optimization. February 29
Constrined Optimiztion Februry 9 Generl Problem min f( ) ( NLP) s.. t g ( ) i E i g ( ) i I i Modeling nd Constrints Adding constrints let s us model fr more richer set of problems. For our purpose we
More informationHomework. Context Free Languages III. Languages. Plan for today. Context Free Languages. CFLs and Regular Languages. Homework #5 (due 10/22)
Homework Context Free Lnguges III Prse Trees nd Homework #5 (due 10/22) From textbook 6.4,b 6.5b 6.9b,c 6.13 6.22 Pln for tody Context Free Lnguges Next clss of lnguges in our quest! Lnguges Recll. Wht
More informationSystems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits
Systems I Logic Design I Topics Digitl logic Logic gtes Simple comintionl logic circuits Simple C sttement.. C = + ; Wht pieces of hrdwre do you think you might need? Storge - for vlues,, C Computtion
More informationImproper Integrals. October 4, 2017
Improper Integrls October 4, 7 Introduction We hve seen how to clculte definite integrl when the it is rel number. However, there re times when we re interested to compute the integrl sy for emple 3. Here
More informationUnit 5 Vocabulary. A function is a special relationship where each input has a single output.
MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with
More informationStudy Guide for Exam 3
Mth 05 Elementry Algebr Fll 00 Study Guide for Em Em is scheduled for Thursdy, November 8 th nd ill cover chpters 5 nd. You my use "5" note crd (both sides) nd scientific clcultor. You re epected to no
More informationChapter 2 Sensitivity Analysis: Differential Calculus of Models
Chpter 2 Sensitivity Anlysis: Differentil Clculus of Models Abstrct Models in remote sensing nd in science nd engineering, in generl re, essentilly, functions of discrete model input prmeters, nd/or functionls
More informationMA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork
MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html
More informationFig.25: the Role of LEX
The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing
More informationThe Reciprocal Function Family. Objectives To graph reciprocal functions To graph translations of reciprocal functions
- The Reciprocl Function Fmil Objectives To grph reciprocl functions To grph trnsltions of reciprocl functions Content Stndrds F.BF.3 Identif the effect on the grph of replcing f () b f() k, kf(), f(k),
More information2014 Haskell January Test Regular Expressions and Finite Automata
0 Hskell Jnury Test Regulr Expressions nd Finite Automt This test comprises four prts nd the mximum mrk is 5. Prts I, II nd III re worth 3 of the 5 mrks vilble. The 0 Hskell Progrmming Prize will be wrded
More informationSection 3.1: Sequences and Series
Section.: Sequences d Series Sequences Let s strt out with the definition of sequence: sequence: ordered list of numbers, often with definite pttern Recll tht in set, order doesn t mtter so this is one
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationTransparent neutral-element elimination in MPI reduction operations
Trnsprent neutrl-element elimintion in MPI reduction opertions Jesper Lrsson Träff Deprtment of Scientific Computing University of Vienn Disclimer Exploiting repetition nd sprsity in input for reducing
More information9 4. CISC - Curriculum & Instruction Steering Committee. California County Superintendents Educational Services Association
9. CISC - Curriculum & Instruction Steering Committee The Winning EQUATION A HIGH QUALITY MATHEMATICS PROFESSIONAL DEVELOPMENT PROGRAM FOR TEACHERS IN GRADES THROUGH ALGEBRA II STRAND: NUMBER SENSE: Rtionl
More informationECEN 468 Advanced Logic Design Lecture 36: RTL Optimization
ECEN 468 Advnced Logic Design Lecture 36: RTL Optimiztion ECEN 468 Lecture 36 RTL Design Optimiztions nd Trdeoffs 6.5 While creting dtpth during RTL design, there re severl optimiztions nd trdeoffs, involving
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More informationOn the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis
On the Detection of Step Edges in Algorithms Bsed on Grdient Vector Anlysis A. Lrr6, E. Montseny Computer Engineering Dept. Universitt Rovir i Virgili Crreter de Slou sin 43006 Trrgon, Spin Emil: lrre@etse.urv.es
More informationMath 142, Exam 1 Information.
Mth 14, Exm 1 Informtion. 9/14/10, LC 41, 9:30-10:45. Exm 1 will be bsed on: Sections 7.1-7.5. The corresponding ssigned homework problems (see http://www.mth.sc.edu/ boyln/sccourses/14f10/14.html) At
More informationBasics of Logic Design Arithmetic Logic Unit (ALU)
Bsics of Logic Design Arithmetic Logic Unit (ALU) CPS 4 Lecture 9 Tody s Lecture Homework #3 Assigned Due Mrch 3 Project Groups ssigned & posted to lckord. Project Specifiction is on We Due April 9 Building
More informationsuch that the S i cover S, or equivalently S
MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i
More informationCS201 Discussion 10 DRAWTREE + TRIES
CS201 Discussion 10 DRAWTREE + TRIES DrwTree First instinct: recursion As very generic structure, we could tckle this problem s follows: drw(): Find the root drw(root) drw(root): Write the line for the
More information10.5 Graphing Quadratic Functions
0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions
More informationAssignment 4. Due 09/18/17
Assignment 4. ue 09/18/17 1. ). Write regulr expressions tht define the strings recognized by the following finite utomt: b d b b b c c b) Write FA tht recognizes the tokens defined by the following regulr
More informationSolutions to Math 41 Final Exam December 12, 2011
Solutions to Mth Finl Em December,. ( points) Find ech of the following its, with justifiction. If there is n infinite it, then eplin whether it is or. ( ) / ln() () (5 points) First we compute the it:
More informationx )Scales are the reciprocal of each other. e
9. Reciprocls A Complete Slide Rule Mnul - eville W Young Chpter 9 Further Applictions of the LL scles The LL (e x ) scles nd the corresponding LL 0 (e -x or Exmple : 0.244 4.. Set the hir line over 4.
More informationIf you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.
Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online
More informationCS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis
CS143 Hndout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexicl Anlysis In this first written ssignment, you'll get the chnce to ply round with the vrious constructions tht come up when doing lexicl
More informationCSE 401 Midterm Exam 11/5/10 Sample Solution
Question 1. egulr expressions (20 points) In the Ad Progrmming lnguge n integer constnt contins one or more digits, but it my lso contin embedded underscores. Any underscores must be preceded nd followed
More informationCS311H: Discrete Mathematics. Graph Theory IV. A Non-planar Graph. Regions of a Planar Graph. Euler s Formula. Instructor: Işıl Dillig
CS311H: Discrete Mthemtics Grph Theory IV Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mthemtics Grph Theory IV 1/25 A Non-plnr Grph Regions of Plnr Grph The plnr representtion of
More informationRepresentation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation
Representtion of Numbers Number Representtion Computer represent ll numbers, other thn integers nd some frctions with imprecision. Numbers re stored in some pproximtion which cn be represented by fixed
More informationToday. Search Problems. Uninformed Search Methods. Depth-First Search Breadth-First Search Uniform-Cost Search
Uninformed Serch [These slides were creted by Dn Klein nd Pieter Abbeel for CS188 Intro to AI t UC Berkeley. All CS188 mterils re vilble t http://i.berkeley.edu.] Tody Serch Problems Uninformed Serch Methods
More informationDynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012
Dynmic Progrmming Andres Klppenecker [prtilly bsed on slides by Prof. Welch] 1 Dynmic Progrmming Optiml substructure An optiml solution to the problem contins within it optiml solutions to subproblems.
More informationFig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.
Answer on Question #5692, Physics, Optics Stte slient fetures of single slit Frunhofer diffrction pttern. The slit is verticl nd illuminted by point source. Also, obtin n expression for intensity distribution
More informationA New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method
A New Lerning Algorithm for the MAXQ Hierrchicl Reinforcement Lerning Method Frzneh Mirzzdeh 1, Bbk Behsz 2, nd Hmid Beigy 1 1 Deprtment of Computer Engineering, Shrif University of Technology, Tehrn,
More informationMisrepresentation of Preferences
Misrepresenttion of Preferences Gicomo Bonnno Deprtment of Economics, University of Cliforni, Dvis, USA gfbonnno@ucdvis.edu Socil choice functions Arrow s theorem sys tht it is not possible to extrct from
More informationCS2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014
CS DIGITAL LOGIC & STATE MACHINE DESIGN SPRING DUE : April 7, HOMEWOR V READ : Relted portions of Chpters III, IV, VI, VII nd VIII ASSIGNMENT : There re seven questions Solve ll homework nd exm problems
More informationL2-Python-Data-Structures
L2-Python-Dt-Structures Mrch 19, 2018 1 Principl built-in types in Python (Python ) numerics: int, flot, long, complex sequences: str, unicode, list, tuple, byterry, buffer, xrnge mppings: dict files:
More informationEssential Question What are some of the characteristics of the graph of a rational function?
8. TEXAS ESSENTIAL KNOWLEDGE AND SKILLS A..A A..G A..H A..K Grphing Rtionl Functions Essentil Question Wht re some of the chrcteristics of the grph of rtionl function? The prent function for rtionl functions
More informationCreating Flexible Interfaces. Friday, 24 April 2015
Creting Flexible Interfces 1 Requests, not Objects Domin objects re esy to find but they re not t the design center of your ppliction. Insted, they re trp for the unwry. Sequence digrms re vehicle for
More information50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula:
5 AMC LECTURES Lecture Anlytic Geometry Distnce nd Lines BASIC KNOWLEDGE. Distnce formul The distnce (d) between two points P ( x, y) nd P ( x, y) cn be clculted by the following formul: d ( x y () x )
More informationCSCI 446: Artificial Intelligence
CSCI 446: Artificil Intelligence Serch Instructor: Michele Vn Dyne [These slides were creted by Dn Klein nd Pieter Abbeel for CS188 Intro to AI t UC Berkeley. All CS188 mterils re vilble t http://i.berkeley.edu.]
More informationTASK SPECIFIC DESCRIPTION
MYP Algebr II/Trig Unit 2 Ch. 4 Trnsformtions Project Nme: Block: - Due Dte: Tuesdy, 11/7 (B-dy) & Wednesdy, 11/8 (A-dy) Mterils: Grph pper, ruler, protrctor, compss, highlight mrkers/colored pencils SCORE:
More informationSOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES
SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES MARCELLO DELGADO Abstrct. The purpose of this pper is to build up the bsic conceptul frmework nd underlying motivtions tht will llow us to understnd ctegoricl
More informationCS 130 : Computer Systems - II. Shankar Balachandran Dept. of Computer Science & Engineering IIT Madras
CS 3 : Computer Systems - II Shnkr Blchndrn (shnkr@cse.iitm.c.in) Dept. of Computer Science & Engineering IIT Mdrs Recp Differentite Between s nd s Truth Tbles b AND b OR NOT September 4, 27 Introduction
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationFall 2018 Midterm 1 October 11, ˆ You may not ask questions about the exam except for language clarifications.
15-112 Fll 2018 Midterm 1 October 11, 2018 Nme: Andrew ID: Recittion Section: ˆ You my not use ny books, notes, extr pper, or electronic devices during this exm. There should be nothing on your desk or
More informationMidterm 2 Sample solution
Nme: Instructions Midterm 2 Smple solution CMSC 430 Introduction to Compilers Fll 2012 November 28, 2012 This exm contins 9 pges, including this one. Mke sure you hve ll the pges. Write your nme on the
More informationLecture T4: Pattern Matching
Introduction to Theoreticl CS Lecture T4: Pttern Mtching Two fundmentl questions. Wht cn computer do? How fst cn it do it? Generl pproch. Don t tlk bout specific mchines or problems. Consider miniml bstrct
More informationHow to Design REST API? Written Date : March 23, 2015
Visul Prdigm How Design REST API? Turil How Design REST API? Written Dte : Mrch 23, 2015 REpresenttionl Stte Trnsfer, n rchitecturl style tht cn be used in building networked pplictions, is becoming incresingly
More informationAlgorithm Design (5) Text Search
Algorithm Design (5) Text Serch Tkshi Chikym School of Engineering The University of Tokyo Text Serch Find sustring tht mtches the given key string in text dt of lrge mount Key string: chr x[m] Text Dt:
More informationCHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE
CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE 3.1 Scheimpflug Configurtion nd Perspective Distortion Scheimpflug criterion were found out to be the best lyout configurtion for Stereoscopic PIV, becuse
More informationAnswer Key Lesson 6: Workshop: Angles and Lines
nswer Key esson 6: tudent Guide ngles nd ines Questions 1 3 (G p. 406) 1. 120 ; 360 2. hey re the sme. 3. 360 Here re four different ptterns tht re used to mke quilts. Work with your group. se your Power
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationApproximation by NURBS with free knots
pproximtion by NURBS with free knots M Rndrinrivony G Brunnett echnicl University of Chemnitz Fculty of Computer Science Computer Grphics nd Visuliztion Strße der Ntionen 6 97 Chemnitz Germny Emil: mhrvo@informtiktu-chemnitzde
More informationOn Computation and Resource Management in Networked Embedded Systems
On Computtion nd Resource Mngement in Networed Embedded Systems Soheil Ghisi Krlene Nguyen Elheh Bozorgzdeh Mjid Srrfzdeh Computer Science Deprtment University of Cliforni, Los Angeles, CA 90095 soheil,
More informationRational Numbers---Adding Fractions With Like Denominators.
Rtionl Numbers---Adding Frctions With Like Denomintors. A. In Words: To dd frctions with like denomintors, dd the numertors nd write the sum over the sme denomintor. B. In Symbols: For frctions c nd b
More informationFunctor (1A) Young Won Lim 10/5/17
Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published
More informationFile Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment
File Mnger Quick Reference Guide June 2018 Prepred for the Myo Clinic Enterprise Khu Deployment NVIGTION IN FILE MNGER To nvigte in File Mnger, users will mke use of the left pne to nvigte nd further pnes
More informationRegister Transfer Level (RTL) Design
CSE4: Components nd Design Techniques for Digitl Systems Register Trnsfer Level (RTL) Design Tjn Simunic Rosing Where we re now Wht we hve covered lst time: Register Trnsfer Level (RTL) design Wht we re
More informationRevisiting the notion of Origin-Destination Traffic Matrix of the Hosts that are attached to a Switched Local Area Network
Interntionl Journl of Distributed nd Prllel Systems (IJDPS) Vol., No.6, November 0 Revisiting the notion of Origin-Destintion Trffic Mtrix of the Hosts tht re ttched to Switched Locl Are Network Mondy
More informationUNIT 11. Query Optimization
UNIT Query Optimiztion Contents Introduction to Query Optimiztion 2 The Optimiztion Process: An Overview 3 Optimiztion in System R 4 Optimiztion in INGRES 5 Implementing the Join Opertors Wei-Png Yng,
More informationSolution of Linear Algebraic Equations using the Gauss-Jordan Method
Solution of Liner Algebric Equtions using the Guss-Jordn Method Populr pproch for solving liner equtions The Guss Jordn method depends on two properties of liner equtions: Scling one or more of ny of the
More informationCMPUT101 Introduction to Computing - Summer 2002
CMPUT Introdution to Computing - Summer 22 %XLOGLQJ&RPSXWHU&LUFXLWV Chpter 4.4 3XUSRVH We hve looked t so fr how to uild logi gtes from trnsistors. Next we will look t how to uild iruits from logi gtes,
More informationP(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have
Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using
More information