ECE 274 Digital Logic Fall Digital Design. Optimization and Tradeoffs Introduction. Optimization and Tradeoffs Introduction
|
|
- Miles Henderson
- 6 years ago
- Views:
Transcription
1 ors) t r (t ECE 27 Digitl Logi ll 28 Optimitio Troffs Two-Lvl Miimitio, Krugh Mps, Et Huristi Miimitio, Multi-lvl Miimitio Digitl Dg..2 Digitl Dg Chptr : Optimitio Troffs Slis to omp th ttook Digitl Dg, irst Eitio, rk Vhi, Joh Wil Sos Pulishrs, Copright 27 rk Vhi strutors of ourss rquirig Vhi's Digitl Dg ttook (pulish Joh Wil Sos) hv prmiso to moif us ths slis for ustomr ours-rlt tivitis, sujt to kpig this opright oti i pl umoifi. Ths slis m post s uimt pf vros o pulil-sl ours wts.. PowrPoit sour (or pf with imtios) m ot post to pulil-sl wts, ut m post for stuts o itrl prott ts or istriut irtl to stuts othr ltroi ms. strutors m mk pritouts of th slis vill to stuts for rsol photoopig hrg, without iurrig roltis. A othr us rquirs pliit prmiso. strutors m oti PowrPoit sour or oti spil us prmisos from Wil s for iformtio. Optimitio Troffs troutio W ow kow how to uil igitl iruits How w uil ttr iruits? Lt s or two importt g ritri Dl th tim from iputs hgig to w orrt stl output Si th umr of trstors or quik stimtio, ssum Trsformig to rprsts Evr gt hs l of gt-l optimitio: Bttr i ll Evr gt iput rquirs 2 trstors ritri of itrst gor ivrtrs w w trstors 2 gt-ls trstors gt-l w = w + w = w = w(+ ) = w () (trstors) l (gt-ls) () Optimitio Troffs troutio Troff mprovs som, ut worss othr, ritri of itrst w w trstors 2 gt-ls w G G = w + w + G2 = w(+) + 2 trstors 3 gt-ls Trsformig G to G2 rprsts troff: Som ritri ttr, othrs wors. G2 (trstors) 2 G G2 2 3 l (gt-ls) 3
2 s Optimitio Troffs troutio Optimitios All ritri of itrst r improv (or t lst kpt th sm) l l Troffs Som ritri of itrst r improv, whil othrs r wors W oviousl prfr optimitios, ut oft must pt troffs You t uil r tht is th most omfortl, hs th st ful ffii, is th fstst ou hv to giv up somthig to gi othr thigs. Optimitio Troffs Comitiol Logi Optimitio Troffs Two-lvl optimitio ug lgri mthos Gol: iruit with ol two lvls (OR AND gts), with miimum trstors Though trstors gttig hpr (Moor s Lw), th still ost somthig Dfi prolm lgrill Sum-of-prouts ils two lvls = + is sum-of-prouts; G = w( + ) is ot. Trsform sum-of-prouts qutio to hv fwst litrls trms Eh litrl trm trslts to gt iput, h of whih trslts to out 2 trstors (s Ch. 2) gor ivrtrs for mpliit Not: Assumig -trstor 2-iput AND/OR iruits; i rlit, ol NAND/NOR r so ffiit..2 Empl = = ( + ) + ( + ) = * + * = + litrls + 2 trms = m gt iputs gt iputs = 2 trstors m m m Optimitio Troffs Algri Two-Lvl Si Miimitio Prvious mpl show ommo lgri miimitio mtho (Multipl out to sum-of-prouts, th) Appl followig s muh posl + = ( + ) = * = Comiig trms to limit vril (ormll ll th Uitig thorm ) Duplitig trm somtims hlps Not tht os t hg futio + = + + = Somtims ftr omiig trms, omi rsultig trms G = G = ( +) + (+ ) G = + (ow o gi) G = ( +) G = = = ( + ) + ( + ) = * + * = + = + + = = (+ ) + ( +) = + 7 Optimitio Troffs Krugh Mps for Two-Lvl Si Miimitio Es to miss g posl opportuitis to omi trms Krugh Mps (K-mps) Grphil mtho to hlp us fi opportuitis to omi trms Mitrms iffrig i o vril r jt i th mp C lrl s opportuitis to omi trms look for jt s or, lrl two opportuitis Top lft irl is shorth for + = ( +) = () = Drw irl, writ trm tht hs ll th litrls pt th o tht hgs i th irl Cirl, = & = i oth lls of th irl, ut hgs (= i o ll, i th othr) Miimi futio: OR th fil trms Er th ll tht lgr: = Noti ot i ir orr K-mp Trt lft & right s jt too = + = = ( + ) + ( + ) = * + * = + 8 2
3 Optimitio Troffs Krugh Mps for Two-Lvl Si Miimitio Optimitio Troffs Krugh Mps for Two-Lvl Si Miimitio our jt s ms two vrils limit Mks ituitiv ss thos two vrils ppr i ll omitios, so o must tru Drw o ig irl shorth for th lgri trsformtios ov G = G = ( ) (must tru) G = ( ( +) + (+ )) G = ( +) G = G G Drw th iggst irl posl, or ou ll hv mor trms th rll our jt lls i shp of squr OK to ovr twi Just lik uplitig trm Rmmr, + = + + No to ovr s mor th o Yils tr trms ot miimi J H H = ( pprs i ll omitios) Th two irls r shorth for: = = = ( + ) + ( ) = ( ) + () 9 Optimitio Troffs Krugh Mps for Two-Lvl Si Miimitio Cirls ross lft/right s Rmmr, gs r jt Mitrms iffr i o vril ol Cirls must hv, 2,, or 8 lls 3,, or 7 ot llow 3//7 os t orrspo to lgri trsformtios tht omi trms to limit vril Cirlig ll th lls is OK utio just quls K L E Optimitio Troffs Krugh Mps for Two-Lvl Si Miimitio our-vril K-mp follows sm priipl Ajt lls iffr i o vril Lft/right jt Top/ottom lso jt vril mps ist But hr to us Two-vril mps ist But ot vr usful s to o lgrill h w w G w =w + G= 2 3
4 Optimitio Troffs Krugh Mps for Two-Lvl Si Miimitio Optimitio Troffs Krugh Mps for Two-Lvl Si Miimitio Grl K-mp mtho. Covrt th futio s qutio ito sum-of-prouts form 2. Pl s i th pproprit K-mp lls for h trm 3. Covr ll s rwig th fwst lrgst irls, with vr ilu t lst o; writ th orrspoig trm for h irl. OR ll th rsultig trms to rt th miimi futio. Empl: Miimi: G = + + *( + ). Covrt to sum-of-prouts G = Pl s i pproprit lls G 3. Covr s G. OR trms: G = + Miimi: H = ( + ) Covrt to sum-of-prouts: H = Pl s i K-mp lls 3. Covr s. OR rsultig trms H H = + + u-lookig irl, ut rmmr tht lft/right jt, top/ottom jt 3 Optimitio Troffs Krugh Mps: Do t Cr put Comitios Optimitio Troffs Krugh Mps: Do t Cr put Comitios Wht if prtiulr iput omitios vr our?.g., Miimi =, giv tht (=) vr tru, tht (=) vr tru So it os t mttr wht outputs wh or is tru, us thos ss will vr our Thus, mk or for thos ss i w tht st miimis th qutio O K-mp Drw Xs for o t r omitios lu X i irl ONLY if miimis qutio Do t ilu othr Xs X X u Goo us of o t rs X X Ussr us of o t rs; rsults i tr trm Miimi: = + + Giv o t rs:, Not: Us o t rs with utio Must sur tht w rll o t r wht th futio outputs for tht iput omitio f w o r, v th slightst, th it s prol sfr to st th output to X X = +
5 Optimitio Troffs Krugh Mps: Do t Cr put Comitios Empl: Swith with potios 3-it vlu givs potio i ir Wt iruit tht Outputs wh swith is i potio 2, 3, or Outputs wh swith is i potio or Not tht th 3-it iput vr output ir,, or 7 Trt s o t r iput omitios 2 3 Withou t o t rs: = + G G 2,3,, ttor X X X G With o t rs: = + Optimitio Troffs Automtig Two-Lvl Logi Si Miimitio Miimiig h s hr for futios with or mor vrils M ot il miimum ovr pig o orr w hoos s rror pro Miimitio thus tpill o utomt tools Et lgorithm: fis optiml solutio Huristi: fis goo solutio, ut ot ssril optiml () trms Ol 3 trms 7 8 Optimitio Troffs B Copts Urlig Automt Two-Lvl Logi Miimitio Dfiitios O-st: All mitrms tht fi wh = Off-st: All mitrms tht fi wh = mplit: A prout trm (mitrm or othr) tht wh uss = O K-mp, lgl (ut ot ssril lrgst) irl Covr: mplit ovrs mitrms Epig trm: rmovig vril (lik lrgr K-mp irl) is po of implits of Not: W us K-mps hr just for ituitiv illustrtio of opts; utomt tools o ot us K-mps. Prim implit: Mimll p implit po woul ovr s ot i o-st,, ov But ot or th p Optimitio Troffs B Copts Urlig Automt Two-Lvl Logi Miimitio Dfiitios (ot) Esstil prim implit: Th ol prim implit tht ovrs prtiulr mitrm i futio s o-st mport: W must ilu ll sstil Ps i futio s ovr otrst, som, ut ot ll, osstil Ps will ilu G ot sstil sstil ot sstil sstil 9 2
6 Optimitio Troffs Automt Two-Lvl Logi Miimitio Mtho Optimitio Troffs Empl of Automt Two-Lvl Miimitio Stps 2: Et Stp 3: Hr. Chkig ll posilitis: t, ut omputtioll pv. Chkig som ut ot ll: huristi. 2. Dtrmi ll prim implits 2. A sstil Ps to ovr tlii s r thus lr ovr Ol o uovr rmis 3. Covr rmiig mitrms with osstil Ps Pik mog th two posl Ps () () 22 Optimitio Troffs Prolm with Mthos tht Eumrt ll Mitrms or Comput ll Prim mplits Too m mitrms for futios with m vrils utio with 32 vrils: 2 32 = illio posl mitrms. Too muh omput tim/mmor Too m omputtios to grt ll prim implits Comprig vr mitrm with vr othr mitrm, for 32 vrils, is ( illio) 2 = qurillio omputtios utios with m vrils oul rquirs s, moths, rs, or mor of omputtio ursol Optimitio Troffs Solutio to Computtio Prolm Solutio Do t grt ll mitrms or prim implits st, just tk iput qutio, tr to itrtivl improv it E: = fgh + fgh + jklmop Not: vrils, m hv thouss of mitrms But miimi just omiig first two trms: = fg(h+h ) + jklmop = fg + jklmop 23 2
7 ) ) ors t s r (t Optimitio Troffs Two-Lvl Miimitio ug trtiv Mtho Mtho: Roml ppl p oprtios, s if hlps Ep: rmov vril from trm Lik pig irl o K-mp.g., Epig to lgl, ut pig to ot lgl, i show futio Aftr p, rmov othr trms ovr wl p trm Kp trig (itrt) util os t hlp E: = fgh + fgh + jklmop = fg + fgh + jklmop = fg + jklmop () Optimitio Troffs Multi-Lvl Logi Optimitio Prform/Si Troffs W o t lws th sp of two lvl logi Multipl lvls m il fwr gts Empl = + + = + ( + ) = ( + ( + )) Grl thiqu: tor out litrls + = (+) 22 trstors 2 gt ls = + + () trstors gt-ls = (+(+)) (trstors) 2 () 2 3 l (gt-ls) 2 2 Optimitio Troffs Multi-Lvl Logi Optimitio Prform/Si Troffs Us multipl lvls to ru umr of trstors for = + f Solutio = + f = ( + f) Hs fwr gt iputs, thus fwr trstors f 22 trstors 8 trstors 2 gt ls 3 gt ls 2 8 f 2 3 l (gt-ls) = + f = ( + f) () () (trstors) 27 Optimitio Troffs Multi-Lvl Empl: No-Critil Pth Critil pth: logst l pth to output Optimitio: ru of logi o o-ritil pths ug multipl lvls g f 2 trstor s 3 gt-l s = (+) + fg + fg () f g 22 trstor s 3 gt-l s = (+) + (+)fg (trstors ) 2 2 () 2 3 l (gt-l s) 28 7
ECE 274 Digital Logic. Digital Design. Optimization and Tradeoffs Introduction. Optimization and Tradeoffs Introduction
ECE 27 Digitl Logi Optiitio d Trdoffs To-Lvl Miiitio, Krugh Mps, Et d Huristi Miiitio, Multi-lvl Miiitio Digitl Dsig..2 Digitl Dsig Chptr : Optiitio d Trdoffs Slids to op th ttook Digitl Dsig, First Editio,
More information(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely
. DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,
More informationChapter 3 Fourier Series Representation of Periodic Signals
Chptr Fourir Sris Rprsttio of Priodic Sigls If ritrry sigl x(t or x[] is xprssd s lir comitio of som sic sigls th rspos of LI systm coms th sum of th idividul rsposs of thos sic sigls Such sic sigl must:
More informationLectures 2 & 3 - Population ecology mathematics refresher
Lcturs & - Poultio cology mthmtics rrshr To s th mov ito vloig oultio mols, th olloig mthmtics crisht is suli I i out r mthmtics ttook! Eots logrithms i i q q q q q q ( tims) / c c c c ) ( ) ( Clculus
More informationMath 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.
Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right
More informationLinear Algebra Existence of the determinant. Expansion according to a row.
Lir Algbr 2270 1 Existc of th dtrmit. Expsio ccordig to row. W dfi th dtrmit for 1 1 mtrics s dt([]) = (1) It is sy chck tht it stisfis D1)-D3). For y othr w dfi th dtrmit s follows. Assumig th dtrmit
More information1 Introduction to Modulo 7 Arithmetic
1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w
More informationModule graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura
Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not
More informationHow much air is required by the people in this lecture theatre during this lecture?
3 NTEGRATON tgrtio is us to swr qustios rltig to Ar Volum Totl qutity such s: Wht is th wig r of Boig 747? How much will this yr projct cost? How much wtr os this rsrvoir hol? How much ir is rquir y th
More informationECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS
C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h
More informationWhy the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.
Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y
More informationa b v a v b v c v = a d + bd +c d +ae r = p + a 0 s = r + b 0 4 ac + ad + bc + bd + e 5 = a + b = q 0 c + qc 0 + qc (a) s v (b)
Outlin MULTIPLE-LEVEL LOGIC OPTIMIZATION Gionni D Mihli Stnfor Unirsit Rprsnttions. Tonom of optimition mthos: { Gols: r/l. { Algorithms: lgri/booln. { Rul-s mthos. Empls of trnsformtions. Booln n lgri
More informationminimize c'x subject to subject to subject to
z ' sut to ' M ' M N uostrd N z ' sut to ' z ' sut to ' sl vrls vtor of : vrls surplus vtor of : uostrd s s s s s s z sut to whr : ut ost of :out of : out of ( ' gr of h food ( utrt : rqurt for h utrt
More informationPresent state Next state Q + M N
Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I
More informationRight Angle Trigonometry
Righ gl Trigoomry I. si Fs d Dfiiios. Righ gl gl msurig 90. Srigh gl gl msurig 80. u gl gl msurig w 0 d 90 4. omplmry gls wo gls whos sum is 90 5. Supplmry gls wo gls whos sum is 80 6. Righ rigl rigl wih
More informationCSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018
CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs
More information, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management
nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o
More informationCOMP108 Algorithmic Foundations
Grdy mthods Prudn Wong http://www.s.liv..uk/~pwong/thing/omp108/01617 Coin Chng Prolm Suppos w hv 3 typs of oins 10p 0p 50p Minimum numr of oins to mk 0.8, 1.0, 1.? Grdy mthod Lrning outoms Undrstnd wht
More informationSolutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1
Solutions for HW Exris. () Us th rurrn rltion t(g) = t(g ) + t(g/) to ount th numr of spnning trs of v v v u u u Rmmr to kp multipl gs!! First rrw G so tht non of th gs ross: v u v Rursing on = (v, u ):
More informationA Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation
A Simpl Co Gnrtor Co Gnrtion Chptr 8 II Gnrt o for singl si lok How to us rgistrs? In most mhin rhitturs, som or ll of th oprnsmust in rgistrs Rgistrs mk goo tmporris Hol vlus tht r omput in on si lok
More informationS i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.
S i m p l i y i n g A l g r SIMPLIFYING ALGEBRA www.mthltis.o.nz Simpliying SIMPLIFYING Algr ALGEBRA Algr is mthmtis with mor thn just numrs. Numrs hv ix vlu, ut lgr introus vrils whos vlus n hng. Ths
More informationFace Detection and Recognition. Linear Algebra and Face Recognition. Face Recognition. Face Recognition. Dimension reduction
F Dtto Roto Lr Alr F Roto C Y I Ursty O solto: tto o l trs s s ys os ot. Dlt to t to ltpl ws. F Roto Aotr ppro: ort y rry s tor o so E.. 56 56 > pot 6556- stol sp A st o s t ps to ollto o pots ts sp. F
More information12. Traffic engineering
lt2.ppt S-38. Introution to Tltrffi Thory Spring 200 2 Topology Pths A tlommunition ntwork onsists of nos n links Lt N not th st of nos in with n Lt J not th st of nos in with j N = {,,,,} J = {,2,3,,2}
More informationCSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review
rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht
More informationOutline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example
Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)
More informationb. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?
MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth
More informationpage 11 equation (1.2-10c), break the bar over the right side in the middle
I. Corrctios Lst Updtd: Ju 00 Complx Vrils with Applictios, 3 rd ditio, A. Dvid Wusch First Pritig. A ook ought for My 007 will proly first pritig With Thks to Christi Hos of Swd pg qutio (.-0c), rk th
More informationExam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013
CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or
More informationEE1000 Project 4 Digital Volt Meter
Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s
More informationGarnir Polynomial and their Properties
Univrsity of Cliforni, Dvis Dprtmnt of Mthmtis Grnir Polynomil n thir Proprtis Author: Yu Wng Suprvisor: Prof. Gorsky Eugny My 8, 07 Grnir Polynomil n thir Proprtis Yu Wng mil: uywng@uvis.u. In this ppr,
More informationSection 5.1/5.2: Areas and Distances the Definite Integral
Scto./.: Ars d Dstcs th Dt Itgrl Sgm Notto Prctc HW rom Stwrt Ttook ot to hd p. #,, 9 p. 6 #,, 9- odd, - odd Th sum o trms,,, s wrtt s, whr th d o summto Empl : Fd th sum. Soluto: Th Dt Itgrl Suppos w
More informationIntegration by Guessing
Itgrtio y Gussig Th computtios i two stdrd itgrtio tchiqus, Sustitutio d Itgrtio y Prts, c strmlid y th Itgrtio y Gussig pproch. This mthod cosists of thr stps: Guss, Diffrtit to chck th guss, d th Adjust
More informationIntegration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals
Intgrtion Continud Intgrtion y Prts Solving Dinit Intgrls: Ar Undr Curv Impropr Intgrls Intgrtion y Prts Prticulrly usul whn you r trying to tk th intgrl o som unction tht is th product o n lgric prssion
More informationAn undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V
Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon
More informationSeven-Segment Display Driver
7-Smnt Disply Drivr, Ron s in 7-Smnt Disply Drivr, Ron s in Prolm 62. 00 0 0 00 0000 000 00 000 0 000 00 0 00 00 0 0 0 000 00 0 00 BCD Diits in inry Dsin Drivr Loi 4 inputs, 7 outputs 7 mps, h with 6 on
More informationENGR 3861 Digital Logic Boolean Algebra. Fall 2007
ENGR 386 Digitl Logi Boole Alger Fll 007 Boole Alger A two vlued lgeri system Iveted y George Boole i 854 Very similr to the lger tht you lredy kow Sme opertios ivolved dditio sutrtio multiplitio Repled
More informationGraph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2
Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny
More informationCSC Design and Analysis of Algorithms. Example: Change-Making Problem
CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =
More informationIIT JEE MATHS MATRICES AND DETERMINANTS
IIT JEE MTHS MTRICES ND DETERMINNTS THIRUMURUGN.K PGT Mths IIT Trir 978757 Pg. Lt = 5, th () =, = () = -, = () =, = - (d) = -, = -. Lt sw smmtri mtri of odd th quls () () () - (d) o of ths. Th vlu of th
More information5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees
/1/018 W usully no strns y ssnn -lnt os to ll rtrs n t lpt (or mpl, 8-t on n ASCII). Howvr, rnt rtrs our wt rnt rquns, w n sv mmory n ru trnsmttl tm y usn vrl-lnt non. T s to ssn sortr os to rtrs tt our
More information# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.
How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0
More informationMinimum Spanning Trees
Minimum Spnning Trs Minimum Spnning Trs Problm A town hs st of houss nd st of rods A rod conncts nd only houss A rod conncting houss u nd v hs rpir cost w(u, v) Gol: Rpir nough (nd no mor) rods such tht:
More informationCSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp
CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140
More informationCycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!
Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik
More informationTangram Fractions Overview: Students will analyze standard and nonstandard
ACTIVITY 1 Mtrils: Stunt opis o tnrm mstrs trnsprnis o tnrm mstrs sissors PROCEDURE Skills: Dsriin n nmin polyons Stuyin onrun Comprin rtions Tnrm Frtions Ovrviw: Stunts will nlyz stnr n nonstnr tnrms
More information0.1. Exercise 1: the distances between four points in a graph
Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in
More informationNefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim
MULTIPLE STITCHES Nrtiti Ehos o Rgl omponnts vok visions o th pst sign y Hln Tng-Lim Us vrity o stiths to rt this rgl yt wrl sign. Prt sping llows squr s to mk roun omponnts tht rp utiully. FCT-SC-030617-07
More informationHelping every little saver
Spt th diffc d cut hw u c fid I c spt thigs! Hlpig v littl sv Hw d u p i? I ch Just pp it f u chs. T fid u lcl ch just visit s.c.uk/ch If u pig i chqu, it c tk ud 4 wkig ds t cl Ov th ph Just cll Tlph
More informationQ.28 Q.29 Q.30. Q.31 Evaluate: ( log x ) Q.32 Evaluate: ( ) Q.33. Q.34 Evaluate: Q.35 Q.36 Q.37 Q.38 Q.39 Q.40 Q.41 Q.42. Q.43 Evaluate : ( x 2) Q.
LASS XII Q Evlut : Q sc Evlut c Q Evlut: ( ) Q Evlut: Q5 α Evlut: α Q Evlut: Q7 Evlut: { t (t sc )} / Q8 Evlut : ( )( ) Q9 Evlut: Q0 Evlut: Q Evlut : ( ) ( ) Q Evlut : / ( ) Q Evlut: / ( ) Q Evlut : )
More informationConstructive Geometric Constraint Solving
Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC
More informationSelf-Adjusting Top Trees
Th Polm Sl-jsting Top Ts ynmi ts: ol: mintin n n-tx ost tht hngs o tim. link(,w): ts n g twn tis n w. t(,w): lts g (,w). pplition-spii t ssoit with gs n/o tis. ont xmpls: in minimm-wight g in th pth twn
More informationChapter 3 Higher Order Linear ODEs
ht High Od i ODEs. Hoogous i ODEs A li qutio: is lld ohoogous. is lld hoogous. Tho. Sus d ostt ultils of solutios of o so o itvl I gi solutios of o I. Dfiitio. futios lld lil iddt o so itvl I if th qutio
More informationCalculus Cheat Sheet. ( x) Relationship between the limit and one-sided limits. lim f ( x ) Does Not Exist
Clulus Cht Sht Limits Dfiitios Pris Dfiitio : W sy lim f L if Limit t Ifiity : W sy lim f L if w for vry ε > 0 thr is δ > 0 suh tht mk f ( ) s los to L s w wt y whvr 0 < < δ th f L < ε. tkig lrg ough positiv.
More informationDUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski
Dut with Dimons Brlt DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Lsli Roglski Photo y Anrw Wirth Supruo DUETS TM from BSmith rt olor shifting fft tht mks your work tk on lif of its own s you mov! This
More informationASSERTION AND REASON
ASSERTION AND REASON Som qustios (Assrtio Rso typ) r giv low. Ech qustio cotis Sttmt (Assrtio) d Sttmt (Rso). Ech qustio hs choics (A), (B), (C) d (D) out of which ONLY ONE is corrct. So slct th corrct
More informationIX. Ordinary Differential Equations
IX. Orir Diffrtil Equtios A iffrtil qutio is qutio tht iclus t lst o rivtiv of uow fuctio. Ths qutios m iclu th uow fuctio s wll s ow fuctios of th sm vribl. Th rivtiv m b of orr thr m b svrl rivtivs prst.
More informationP a g e 5 1 of R e p o r t P B 4 / 0 9
P a g e 5 1 of R e p o r t P B 4 / 0 9 J A R T a l s o c o n c l u d e d t h a t a l t h o u g h t h e i n t e n t o f N e l s o n s r e h a b i l i t a t i o n p l a n i s t o e n h a n c e c o n n e
More informationUsing the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas
SnNCutCnvs Using th Printl Stikr Funtion On-o--kin stikrs n sily rt y using your inkjt printr n th Dirt Cut untion o th SnNCut mhin. For inormtion on si oprtions o th SnNCutCnvs, rr to th Hlp. To viw th
More informationOn Gaussian Distribution
Prpr b Çğt C MTU ltril gi. Dpt. 30 Sprig 0089 oumt vrio. Gui itributio i i ollow O Gui Ditributio π Th utio i lrl poitiv vlu. Bor llig thi utio probbilit it utio w houl h whthr th r ur th urv i qul to
More informationProblem solving by search
Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming
More informationSection 3: Antiderivatives of Formulas
Chptr Th Intgrl Appli Clculus 96 Sction : Antirivtivs of Formuls Now w cn put th is of rs n ntirivtivs togthr to gt wy of vluting finit intgrls tht is ct n oftn sy. To vlut finit intgrl f(t) t, w cn fin
More informationNational Quali cations
PRINT COPY OF BRAILLE Ntiol Quli ctios AH08 X747/77/ Mthmtics THURSDAY, MAY INSTRUCTIONS TO CANDIDATES Cdidts should tr thir surm, form(s), dt of birth, Scottish cdidt umbr d th m d Lvl of th subjct t
More informationFundamental Algorithms for System Modeling, Analysis, and Optimization
Fundmntl Algorithms for Sstm Modling, Anlsis, nd Optimiztion Edwrd A. L, Jijt Rohowdhur, Snjit A. Sshi UC Brkl EECS 144/244 Fll 2011 Copright 2010-11, E. A. L, J. Rohowdhur, S. A. Sshi, All rights rsrvd
More informationA L A BA M A L A W R E V IE W
A L A BA M A L A W R E V IE W Volume 52 Fall 2000 Number 1 B E F O R E D I S A B I L I T Y C I V I L R I G HT S : C I V I L W A R P E N S I O N S A N D TH E P O L I T I C S O F D I S A B I L I T Y I N
More informationExtension Formulas of Lauricella s Functions by Applications of Dixon s Summation Theorem
Avll t http:pvu.u Appl. Appl. Mth. ISSN: 9-9466 Vol. 0 Issu Dr 05 pp. 007-08 Appltos Appl Mthts: A Itrtol Jourl AAM Etso oruls of Lurll s utos Appltos of Do s Suto Thor Ah Al Atsh Dprtt of Mthts A Uvrst
More informationProject 3: Using Identities to Rewrite Expressions
MAT 5 Projet 3: Usig Idetities to Rewrite Expressios Wldis I lger, equtios tht desrie properties or ptters re ofte lled idetities. Idetities desrie expressio e repled with equl or equivlet expressio tht
More informationImproving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)
POW CSE 36: Dt Struturs Top #10 T Dynm (Equvln) Duo: Unon-y-Sz & Pt Comprsson Wk!! Luk MDowll Summr Qurtr 003 M! ZING Wt s Goo Mz? Mz Construton lortm Gvn: ollton o rooms V Conntons twn t rooms (ntlly
More informationChem 104A, Fall 2016, Midterm 1 Key
hm 104A, ll 2016, Mitrm 1 Ky 1) onstruct microstt tl for p 4 configurtion. Pls numrt th ms n ml for ch lctron in ch microstt in th tl. (Us th formt ml m s. Tht is spin -½ lctron in n s oritl woul writtn
More informationWeighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths
Dt Strutur LECTURE Shortt pth lgorithm Proprti of hortt pth Bllmn-For lgorithm Dijktr lgorithm Chptr in th txtook (pp ). Wight grph -- rminr A wight grph i grph in whih g hv wight (ot) w(v i, v j ) >.
More informationV={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn
More information12 - M G P L Z - M9BW. Port type. Bore size ø12, ø16 20/25/32/40/50/ MPa 10 C to 60 C (With no condensation) 50 to 400 mm/s +1.
ris - MP - Compt gui ylinr ø, ø, ø, ø, ø, ø, ø, ø ow to Orr Cln sris lif typ (with spilly trt sliing prts) Vuum sution typ (with spilly trt sliing prts) ir ylinr otry tutor - M P - - MW ll ushing ring
More informationV={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous
More informationNational Quali cations
Ntiol Quli ctios AH07 X77/77/ Mthmtics FRIDAY, 5 MAY 9:00 AM :00 NOON Totl mrks 00 Attmpt ALL qustios. You my us clcultor. Full crdit will b giv oly to solutios which coti pproprit workig. Stt th uits
More informationCOMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS
OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson
More informationPaths. Connectivity. Euler and Hamilton Paths. Planar graphs.
Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,
More informationCOLLECTION OF SUPPLEMENTARY PROBLEMS CALCULUS II
COLLECTION OF SUPPLEMENTARY PROBLEMS I. CHAPTER 6 --- Trscdtl Fuctios CALCULUS II A. FROM CALCULUS BY J. STEWART:. ( How is th umbr dfid? ( Wht is pproimt vlu for? (c ) Sktch th grph of th turl potil fuctios.
More informationT h e C S E T I P r o j e c t
T h e P r o j e c t T H E P R O J E C T T A B L E O F C O N T E N T S A r t i c l e P a g e C o m p r e h e n s i v e A s s es s m e n t o f t h e U F O / E T I P h e n o m e n o n M a y 1 9 9 1 1 E T
More informationBinomials and Pascal s Triangle
Binomils n Psl s Tringl Binomils n Psl s Tringl Curriulum R AC: 0, 0, 08 ACS: 00 www.mthltis.om Binomils n Psl s Tringl Bsis 0. Intif th prts of th polnomil: 8. (i) Th gr. Th gr is. (Sin is th highst
More informationPolygons POLYGONS.
Polgons PLYGNS www.mthltis.o.uk ow os it work? Solutions Polgons Pg qustions Polgons Polgon Not polgon Polgon Not polgon Polgon Not polgon Polgon Not polgon f g h Polgon Not polgon Polgon Not polgon Polgon
More information12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)
12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr
More informationQuantum Mechanics & Spectroscopy Prof. Jason Goodpaster. Problem Set #2 ANSWER KEY (5 questions, 10 points)
Chm 5 Problm St # ANSWER KEY 5 qustios, poits Qutum Mchics & Spctroscopy Prof. Jso Goodpstr Du ridy, b. 6 S th lst pgs for possibly usful costts, qutios d itgrls. Ths will lso b icludd o our futur ms..
More information(a) v 1. v a. v i. v s. (b)
Outlin RETIMING Struturl optimiztion mthods. Gionni D Mihli Stnford Unirsity Rtiming. { Modling. { Rtiming for minimum dly. { Rtiming for minimum r. Synhronous Logi Ntwork Synhronous Logi Ntwork Synhronous
More informationCS September 2018
Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o
More information5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs
Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl
More informationExecutive Committee and Officers ( )
Gifted and Talented International V o l u m e 2 4, N u m b e r 2, D e c e m b e r, 2 0 0 9. G i f t e d a n d T a l e n t e d I n t e r n a t i o n a2 l 4 ( 2), D e c e m b e r, 2 0 0 9. 1 T h e W o r
More informationPage 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.
ConTst Clikr ustions Chtr 19 Physis, 4 th Eition Jms S. Wlkr ustion 19.1 Two hrg blls r rlling h othr s thy hng from th iling. Wht n you sy bout thir hrgs? Eltri Chrg I on is ositiv, th othr is ngtiv both
More informationDesigning A Concrete Arch Bridge
This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr
More informationP a g e 3 6 of R e p o r t P B 4 / 0 9
P a g e 3 6 of R e p o r t P B 4 / 0 9 p r o t e c t h um a n h e a l t h a n d p r o p e r t y fr om t h e d a n g e rs i n h e r e n t i n m i n i n g o p e r a t i o n s s u c h a s a q u a r r y. J
More informationEE Control Systems LECTURE 11
Up: Moy, Ocor 5, 7 EE 434 - Corol Sy LECTUE Copyrigh FL Lwi 999 All righ rrv POLE PLACEMET A STEA-STATE EO Uig fc, o c ov h clo-loop pol o h h y prforc iprov O c lo lc uil copor o oi goo y- rcig y uyig
More informationLINEAR 2 nd ORDER DIFFERENTIAL EQUATIONS WITH CONSTANT COEFFICIENTS
Diol Bgyoko (0) I.INTRODUCTION LINEAR d ORDER DIFFERENTIAL EQUATIONS WITH CONSTANT COEFFICIENTS I. Dfiiio All suh diffril quios s i h sdrd or oil form: y + y + y Q( x) dy d y wih y d y d dx dx whr,, d
More informationCONIC SECTIONS. MODULE-IV Co-ordinate Geometry OBJECTIVES. Conic Sections
Conic Sctions 16 MODULE-IV Co-ordint CONIC SECTIONS Whil cutting crrot ou might hv noticd diffrnt shps shown th dgs of th cut. Anlticll ou m cut it in thr diffrnt ws, nml (i) (ii) (iii) Cut is prlll to
More informationSOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan
LOCUS 58 SOLVED EXAMPLES Empl Lt F n F th foci of n llips with ccntricit. For n point P on th llips, prov tht tn PF F tn PF F Assum th llips to, n lt P th point (, sin ). P(, sin ) F F F = (-, 0) F = (,
More informationCH 20 SOLVING FORMULAS
CH 20 SOLVING FORMULAS 179 Itrodutio S olvig equtios suh s 2 + 7 20 is oviousl the orerstoe of lger. But i siee, usiess, d omputers it is lso eessr to solve equtios tht might hve vriet of letters i them.
More information176 5 t h Fl oo r. 337 P o ly me r Ma te ri al s
A g la di ou s F. L. 462 E l ec tr on ic D ev el op me nt A i ng er A.W.S. 371 C. A. M. A l ex an de r 236 A d mi ni st ra ti on R. H. (M rs ) A n dr ew s P. V. 326 O p ti ca l Tr an sm is si on A p ps
More information4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.
Cptr 4 4 Intrvl Suln Gry Alortms Sls y Kvn Wyn Copyrt 005 Prson-Ason Wsly All rts rsrv Intrvl Suln Intrvl Suln: Gry Alortms Intrvl suln! Jo strts t s n nss t! Two os omptl ty on't ovrlp! Gol: n mxmum sust
More information8Algebraic UNCORRECTED SAMPLE PAGES. techniques. What you will learn. Australian curriculum. Chapter 8A 8B 8C 8D 8E 8F
8A 8B 8C 8D 8E 8F 8G 8H 8I 8J 8K Chptr Wht you will lrn 8Algri thniqus Epning inomil prouts Prt squrs n irn o prt squrs Ftorising lgri prssions Ftorising th irn o two squrs Ftoristion y grouping Ftorising
More informationWhat do you know? Listen and find. Listen and circle. Listen and chant. Listen and say. Lesson 1. sheep. horse
Animls shp T h i nk Wht o you know? 2 2:29 Listn n fin. hors Wht s this? Wht s this? It s got ig nos. It s ig n gry. It s hors! YES! 2 Wht r ths? Wht r ths? Thy v got two lgs. Thy r smll n rown. Thy r
More informationCIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7
CIVL / -D Boundr Vlu Prolms - Rctngulr Elmnts / RECANGULAR ELEMENS - In som pplictions, it m mor dsirl to us n lmntl rprsnttion of th domin tht hs four sids, ithr rctngulr or qudriltrl in shp. Considr
More informationa b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...
Progrssiv Printing T.M. CPITLS g 4½+ Th sy, fun (n FR!) wy to tch cpitl lttrs. ook : C o - For Kinrgrtn or First Gr (not for pr-school). - Tchs tht cpitl lttrs mk th sm souns s th littl lttrs. - Tchs th
More informationSome Common Fixed Point Theorems for a Pair of Non expansive Mappings in Generalized Exponential Convex Metric Space
Mish Kumr Mishr D.B.OhU Ktoch It. J. Comp. Tch. Appl. Vol ( 33-37 Som Commo Fi Poit Thorms for Pir of No psiv Mppigs i Grliz Epotil Cov Mtric Spc D.B.Oh Mish Kumr Mishr U Ktoch (Rsrch scholr Drvii Uivrsit
More information