IEEE ASIC/SOC Conference, September 2000, Washington, D.C.

Size: px
Start display at page:

Download "IEEE ASIC/SOC Conference, September 2000, Washington, D.C."

Transcription

1 DESIGN AND SYNTHESIS OF BUILTIN SELFTESTABLE TWODIMENSIONAL DISCRETE COSINE TRANSFORM CIRCUITS Hn Bin Kim Sun Microsystms, Inc. 90 Sn Antonio Ro Plo Alto, CA 940 Emil: Don Sm H Virini Tch VLSI for Tlcommunictions (VTVT) Brly Dpt. of Elctricl n Computr En. Virini Tch, Blcksbur VA 406 Emil: h@vt.u Wb: ABSTRACT W prsnt sin of twoimnsionl (D) iscrt cosin trnsform (DCT) circuit with builtin slftst (BIST) cpbility. Aftr moifyin n xistin fst D DCT lorithm to mk it mor flxibl, w synthsiz th t pth n th controllr usin our hihlvl BIST synthsis tool n incorport scn sin to othr mouls. Our sin chivs hih fult covr t smll cost of r ovrh n systm prformnc rtion. I. INTRODUCTION Builtin slftst (BIST) mbs tst pttrn nrtor () n sintur ristr (SR). BIST hs bcom populr for loic circuit tstin s wll s mb mmory tstin. A hihlvl BIST synthsis tool nrts t pth n controllr in th ristrtrnsfr (RT) lvl with BIST cpbility by rconfiurin xistin ristrs. A hihlvl BIST synthsis is ffctiv for tstin t intnsiv circuits, spcilly DSP (Diitl Sinl Procssin) circuits. In this ppr, w prsnt sin of twoimnsionl ( D) iscrt cosin trnsform (DCT) circuit with builtin slftst (BIST) cpbility. Th DCT lorithm is wily us to comprss ims. It is, for xmpl, mploy in JPEC n MPEC. Our sin procur is s follows: W moifi n xistin onimnsionl (D) DCT lorithm first n thn ppli our hihlvl BIST synthsis tool [] to nrt t pth n controllr with BIST. W sin othr mouls (such s I/O intrfc mouls n mmory trnsposition moul) mnully to implmnt D DCT circuit n thn incorport scn sin to th mouls. II. BACKGROUND A. OnDimnsionl DCT Alorithm Sinc DCT is sprbl trnsformtion procss, th D DCT cn b prform by two sprt D DCT procsss: D DCT in th row irction follow by D DCT in th column irction. Svrl implmnttions opt this pproch u to its simpl structur n low hrwr complxity [],[]. Howvr, th pproch rquirs trnsposition mmory to stor n to rrrn th squnc of t for th scon D DCT; this rs of th prformnc in sp. A iffrnt D DCT implmnttion, prsnt in [4], limints th n for trnsposition mmory. It improvs th prformnc t th cost of hihr circuit complxity. W us th formr pproch to implmnt th D DCT, which prforms in thr stps: D DCT, n thn mmory trnsposition follow by nothr D DCT. Th formul for th D DCT is ivn blow: N X (0) = x( n) () N n=0 N (n ) kπ X ( k) = x( n) cos, k=,, 7 () N n= 0 N whr x(n) rprsnts pixl vlu, X(k) rprsnts th trnsform vlu, n N is 8 for th 8 8 block siz. B. Fst DCT Alorithm Chn t l. propos mtho to improv th oriinl DCT formul scrib bov [5]. Th improv on hs fwr oprtions to incrs th sp n to ruc th circuit complxity. Chn t l s mtho is known to b on of th fstst DCT lorithms n is prtly mploy in our implmnttion. W scrib Chn's lorithm brifly blow. An Npoint D DCT lorithm involvs N N mtrix clcultions. Th N N mtrix clcultions in qutions () n () cn b compos into th two sts of qutions shown in () n (4) for N=8 by inspction [],[5]. Th first st contins vn inx trms n th scon st th o inx trms. Th composition rucs th numbr of multiplictions from N to N /, which rucs 64 multiplictions to multiplictions for N=8. It is importnt to not tht th composition proucs th sm rsult s th oriinl formul fin in [] n []. i

2 X = ( ( (0 4) ) X ) c X X (6) f X = ( ( ( 5) ) b X ) X X (7) f c b f c b x(0) x(7) c x() x(6) x() x(5) f x() x(4) x(0) x(7) x() x(6) x() x(5) b x() x(4) If th twolvl multiply structur is convrt to multipllvl on by rrrnin oprtions, th numbr of multiplictions is furthr ruc to. Rfr to [5] for tils of th mtho. III. DESIGN OF D DCT A. Optimiztion of D DCT Alorithm Th fst DCT lorithm scrib in th prvious sction rquirs mtch invrs DCT (IDCT) lorithm. Tht is, if t r comprss usin th nrl D DCT lorithm fin in qutions () n (), th fst IDCT lorithms cnnot b us for comprssion. To voi th incomptibility problm, w moifi th lorithm in our sin, which incrss th numbr of oprtions slihtly. Th t flow rph shown in Fi. is th moifi DCT lorithm mploy in our implmnttion. It hs th sm structur s Chn s lorithm only for vninx trms, which rquir iht multiplictions. Th numbr of multiplictions rquir for oinx trms rmins th sm (which is ) s spcifi in qution () n (4). Th totl numbr of multiplictions ncssry for our implmnttion is 4, whrs it is for Chn s lorithm. x X b b b f c c f b () (4) W ppli our hihlvl BIST synthsis tool cll ADVBIST_h to th t flow rph in Fi. n nrt RTlvl t pth n controllr []. B. Structur n Oprtion of D DCT Circuit Fi. shows th block irm of D DCT circuit. Ech row of n 8 8 im block is lo srilly throuh DIN port of sriltoprlll (srpr) convrsion moul, n D DCT oprtion is prform for th row. Th rsult is stor in th trnsposition mmory. Upon compltly procssin th iht rows, D DCT oprtions r prform column by column in th trnsposition mmory. Th rsult of ch column D DCT oprtion is outputt srilly throuh DOUT port of prllltosril (prsr) convrsion moul. SEN DIN Controllr SEN PEN ISEL SEL REN srpr 8x ISEL Trns. Mmory D DCT SEL REN PEN 8x prsr Fiur : Block irm of our D DCT circuit DOUT Fi. shows th rchitctur for our D DCT t pth n th controllr. Th multiplxrbs rchitctur is mploy for th t pth, n finit stt mchin (FSM) is us for th controllr. Th systm is clock by sinl systm clock. CLK TEST BIST ctlm rn Controllr (FSM) in[0:5] out[0:5] R R BIST Moul Moul Dt Pth Fiur : Architctur for our D DCT circuit B[0:] S[0:] SIN SOUT Fiur : Dt flow rph of D DCT lorithm ii

3 IN0 IN IN7 0,0 0, 0,7,0,,7 7,0 7, 7,7 Fiur 4: Schmtic of th trnsposition mmory OUT0 OUT OUT7 Th structur of trnsposition mmory is shown in Fi. 4. A trnsposition mmory consists of n 8 8 ristr rry in which ch ristr is bit lon. Dt r fill into th rry in rowwis from top, n r mpti in columnwis in th riht si. Two control sinls, n, trmin th irction of th t movmnt. IV. DESIGNFORTEST TECHNIQUES APPLIED A. s n SRs W implmnt s shown in Fi. 5 by moifyin builtin loic block obsrvr (BILBO) [6]. Our hs thr mninful functions such tht norml oprtion, scn, n tst pttrn nrtion s shown in Tbl. Th mjor iffrnc btwn our n th oriinl BILBO is tht th inputs Z 5 Z 0 r block for our in tst pttrn nrtion mo; this is ncssry for psuornom pttrn nrtion. W us th oriinl BILBO for sintur nlysis. B B 0 S i 0 MUX Z 5 Z 4 Z Z Z Z 0 Q 5 Q 4 Q Q Q Q 0 S o B. Tstin of th Dt Pth W fr scription on tstin of t pth mouls to Sction V, which lso covrs xprimntl rsults msur from th lyout. C. Tstin of th Trnsposition Mmory W im to tst stuckt fults of th ristrs in th trnsposition mmory. Our pproch is to mrch throuh ll0pttrns to tct stuckt fults n thn ll pttrns to tct stuckt 0 fults. Aftr tst pttrns r scnn into th ristrs in th rihtmost column, ristr (i, j) copis from its lft nihbor ristr (i, j) on vry clock in th mmory tstin mo; th ristrs in th rihtmost column r copi into scn ristrs in th t pth moul. Th oprtion of th tstin procss is s follows. First, ll0pttrns r scnn into th ristrs in th trnsposition mmory moul, whos ristrs r sh in Fi. 4. Nxt, iht clocks r ppli to th moul in th mmory tstin mo. Th pttrns mrch throuh th rry n r cptur in th output ristrs. Aftr switchin to th scn mo, th contnts of th output ristrs r scnn out for xmintion. Th schm chivs 00 % stuckt fult covr. D. Tstin of th Controllr Th controllr circuit consists of 9bit countr n n ssocit combintionl loic. Th combintionl loic rcivs th contnt of th countr n nrts 66 control sinls. Th countr srvs s in our BIST mo. Tst rsponss on th control sinls r compct in spc to outputs n thn comprss in tim usin two xistin SRs in th t pth. Fi. 6 shows th structur of th controllr ftr incorportion of BIST. Th XOR ts in th lft MISR (Multipl Input Sintur Ristr) compcts tst rsponss in spc. Th fult covr rchs 97.0 % for 50 pttrns n rmins th sm ftr th 50 pttrns. Hnc, w pply 50 tst pttrns (nrt by th countr) to tst th controllr. CLB REN Fiur 5: Schmtic of moifi bit Tbl : Oprtin mos of our bit B0 B Mos Norml function 0 0 Shift ristr 0 Tst pttrn nrtion CLK RST Countr MISR MISR Fiur 6: Schmtic of th controllr E. Tstin of th I/O Convrsion Mouls. W pply n ll0tst pttrn to primry inputs INS(0:5), which r inputs of th sriltoprlll convrtr. Thn w pply iht clocks to mrch th ll0 iii

4 pttrn throuh th iht bit ristrs in th convrtr. Th rsult is ltch into scn ristr in th t pth moul n scnn out for xmintion. W rpt th sm procss for th lltst pttrn. Tstin of th prllltosril moul is similr. W scn in tst pttrn into scn ristr in th moul n pply 7 clocks. Th tst rspons is xmin on primry outputs DOUT(0:5). Th schm chivs 00 % stuckt fult covr. F. Ovrll Tst Schul Th six ict control sinls, TEST, B[0:], n S[0:], r us to control tn iffrnt mos of oprtions. (Rfr to Fi..) Four BIST sssions r lloct. to tst six rithmtic mouls (two rs, two subtrctors, n two multiplirs) in th t pth. Four othr tst sssions inclu controllr tst mo, th trnsposition mmory tst mo, sriltoprlll convrtr tst mo, n prllltosril convrtr tst mo. Th rminin two mos r norml mo n th scn mo. V. EXPERIMENTAL RESULTS A. Appliction of HihLvl BIST Synthsis 5 control stps wr schul for th compltion of th D DCT oprtion, n 6 rithmtic mouls wr ssin for th oprtions. Our hihlvl BIST synthsis tool ADVBIST_h ws ppli in which th numbr of tst sssions ws st to 4 []. Th t pth nrt by ADVBIST_h ws builtin slftstbl with four s n two SRs. B. Tstin of Dt Pth Fi. 7 shows BIST confiurtions for tstin of th t pth. (Only rsourcs tht r rlt to BIST r shown in th fiur.) All th BIST ristrs r connct throuh sinl scn chin to initiliz s n to scn out sinturs of th tst rsponss cptur in SRs. Four BIST tst sssions r us for tstin six rithmtic mouls s scrib rlir, n th mouls n BIST ristrs r shown in Tbl. For ch tst sssion, initil tst pttrns r scnn in, th trt mouls r tst, n tst rsponss r scnn out. All rlt control sinls r nrt from th controllr. Th fult covr of rs n th subtrctors rchs 00 % with 40 n 50 tst pttrns, rspctivly. Th fult covr of th multiplirs rchs 99.0 % for 50 tst pttrns n incrss to % for 00 tst pttrns. W us 50 tst pttrns for th multiplirs; This chivs 99.6 % of fult covr. SCAN_IN R 0 R R R 4 S M M 4 S 5 A 6 A 7 SCAN_OUT SR R SR R Fiur 7: BIST confiurtions for th tstin of DCT t pths Tbl : Tst schul Sssion Moul SR 0 S5 R R4 R S R0 R R M R0 R R M4 R R0 R A6 R R R A7 R R0 R C. Loic & Lyout Dsin Th rsultnt BIST t pth n th control unit wr scrib in VHDL n wr synthsiz to obtin t lvl circuit. Th circuit ws plc n rout usin n HP 0.5 µm CMOS stnr cll librry with tripl mtl lyrs. W lso implmnt circuit without BIST in similr mnnr to msur th ovrh of th BIST sin. Th chrctristics of th two circuits r summriz in Tbl. Fi. 8 shows finl lyout of D DCT circuit with BIST. Tbl : Chrctristics of two chips Dscription w/o BIST w/ BIST Ar of th cor loic 0.84 mm.9 mm Mx. oprbl clock rt.4 MHz 0.8 MHz Ar ovrh 9.95 % Clock sp rtion 5. % Equiv. NAND t counts of th t pth of th control unit 7 55 of th mmory unit 0,00 45 Totl,6 7,0 iv

5 Fiur 8: Lyout of D DCT circuit with BIST VI. CONCLUSION In this ppr, w scrib sin of D DCT circuit. Our hihlvl BIST synthsis tool ws ppli to implmnt th t pth n th controllr. Scn sin ws ppli to othr mouls. Th r ovrh of th DFT incluin BIST is 9.95%, which is tolrbl in inustry. REFERENCES [] H.B. Kim n D.S. H, A HihLvl BIST Synthsis Mtho Bs on Rionwis Huristic for n Intr Linr Prormmin, IEEE Intrntionl Tst Confrnc, pp. 909, Spt [] A. Mistti n A.N. Wilson, Jr., "A 00 MHz D 8x8 DCT/IDCT Procssor For HDTV Applictions, " IEEE Trns. Circuits n Systms for Vio Tchnoloy, vol. 5, pp 585, Apr [] T. Xnthopoulos n A.P. Chnrksn, A Low Powr IDCT Mcrocll for MPEG MP@ML Exploitin Dt Distribution Proprtis for Miniml Activity, IEEE Journl of SoliStt Circuits, vol. 4, no. 5, pp. 6970, My 999. [4] V. Srinivsn n K.J.R. Liu, "VLSI Dsin of Hih Sp TimRcursiv D DCT/IDCT Procssor for Vio Appliction", IEEE Trns. on Circuits n Systms for Vio Tchnoloy, vol. 6, no, pp.8796, Fb. 996 [5] W.H. Chn, C.H. Smith, n S.C. Frlick, A Fst Computtionl Alorithm for th Discrt Cosin Trnsform, IEEE Trns. Commun., vol. COM5, pp , Spt [6] M. Abrmovici, M.A. Brur n A.D. Frimn, Diitl Systms Tstin n Tstbl Dsin, IEEE, Jn v

Walk Like a Mathematician Learning Task:

Walk Like a Mathematician Learning Task: Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics

More information

Overview. Usages of Fault Simulators. Problem and Motivation. Alternatives and Their Limitations. VLSI Design Verification and Testing

Overview. Usages of Fault Simulators. Problem and Motivation. Alternatives and Their Limitations. VLSI Design Verification and Testing VLSI Dsin Vriiction n Tstin Fult Simultion Mohmm Thrnipoor Elctricl n Computr Eninrin Univrsity o Conncticut Ovrviw Prolm n motivtion Fult simultion lorithms Sril Prlll Ductiv Concurrnt Othr lorithms Rnom

More information

EE1000 Project 4 Digital Volt Meter

EE1000 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 information

1 Introduction to Modulo 7 Arithmetic

1 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 information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt of Computr n Informtion Sins CSCI 710 (Trnoff) Disrt Struturs TEST for Fll Smstr, 00 R this for strtin! This tst is los ook

More information

Present state Next state Q + M N

Present 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 information

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

CSE 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 information

Ch 1.2: Solutions of Some Differential Equations

Ch 1.2: Solutions of Some Differential Equations Ch 1.2: Solutions of Som Diffrntil Equtions Rcll th fr fll nd owl/mic diffrntil qutions: v 9.8.2v, p.5 p 45 Ths qutions hv th gnrl form y' = y - b W cn us mthods of clculus to solv diffrntil qutions of

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook

More information

Multi-Section Coupled Line Couplers

Multi-Section Coupled Line Couplers /0/009 MultiSction Coupld Lin Couplrs /8 Multi-Sction Coupld Lin Couplrs W cn dd multipl coupld lins in sris to incrs couplr ndwidth. Figur 7.5 (p. 6) An N-sction coupld lin l W typiclly dsign th couplr

More information

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

CSE 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

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Cycles 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 information

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

ECE 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 information

Lecture contents. Bloch theorem k-vector Brillouin zone Almost free-electron model Bands Effective mass Holes. NNSE 508 EM Lecture #9

Lecture contents. Bloch theorem k-vector Brillouin zone Almost free-electron model Bands Effective mass Holes. NNSE 508 EM Lecture #9 Lctur contnts Bloch thorm -vctor Brillouin zon Almost fr-lctron modl Bnds ffctiv mss Hols Trnsltionl symmtry: Bloch thorm On-lctron Schrödingr qution ch stt cn ccommo up to lctrons: If Vr is priodic function:

More information

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören ME 522 PINCIPLES OF OBOTICS FIST MIDTEM EXAMINATION April 9, 202 Nm Lst Nm M. Kml Özgörn 2 4 60 40 40 0 80 250 USEFUL FOMULAS cos( ) cos cos sin sin sin( ) sin cos cos sin sin y/ r, cos x/ r, r 0 tn 2(

More information

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

, 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 information

VLSI Testing Assignment 2

VLSI Testing Assignment 2 1. 5-vlu D-clculus trut tbl or t XOR unction: XOR 0 1 X D ~D 0 0 1 X D ~D 1 1 0 X ~D D X X X X X X D D ~D X 0 1 ~D ~D D X 1 0 Tbl 1: 5-vlu D-clculus Trut Tbl or t XOR Function Sinc 2-input XOR t wors s

More information

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Outline. 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 information

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl

More information

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture: Lctur 11 Wvs in Priodic Potntils Tody: 1. Invrs lttic dfinition in 1D.. rphicl rprsnttion of priodic nd -priodic functions using th -xis nd invrs lttic vctors. 3. Sris solutions to th priodic potntil Hmiltonin

More information

Slide 1. Slide 2. Slide 3 DIGITAL SIGNAL PROCESSING CLASSIFICATION OF SIGNALS

Slide 1. Slide 2. Slide 3 DIGITAL SIGNAL PROCESSING CLASSIFICATION OF SIGNALS Slid DIGITAL SIGAL PROCESSIG UIT I DISCRETE TIME SIGALS AD SYSTEM Slid Rviw of discrt-tim signals & systms Signal:- A signal is dfind as any physical quantity that varis with tim, spac or any othr indpndnt

More information

Seven-Segment Display Driver

Seven-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 information

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016 Wintr 2016 COMP-250: Introduction to Computr Scinc Lctur 23, April 5, 2016 Commnt out input siz 2) Writ ny lgorithm tht runs in tim Θ(n 2 log 2 n) in wors cs. Explin why this is its running tim. I don

More information

Instructions for Section 1

Instructions for Section 1 Instructions for Sction 1 Choos th rspons tht is corrct for th qustion. A corrct nswr scors 1, n incorrct nswr scors 0. Mrks will not b dductd for incorrct nswrs. You should ttmpt vry qustion. No mrks

More information

Chem 104A, Fall 2016, Midterm 1 Key

Chem 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 information

Minimum Spanning Trees

Minimum 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 information

Relation between Fourier Series and Transform

Relation between Fourier Series and Transform EE 37-3 8 Ch. II: Inro. o Sinls Lcur 5 Dr. Wih Abu-Al-Su Rlion bwn ourir Sris n Trnsform Th ourir Trnsform T is riv from h finiion of h ourir Sris S. Consir, for xmpl, h prioic complx sinl To wih prio

More information

Floating Point Number System -(1.3)

Floating Point Number System -(1.3) Floting Point Numbr Sstm -(.3). Floting Point Numbr Sstm: Comutrs rrsnt rl numbrs in loting oint numbr sstm: F,k,m,M 0. 3... k ;0, 0 i, i,...,k, m M. Nottions: th bs 0, k th numbr o igts in th bs xnsion

More information

Floating Point Number System -(1.3)

Floating Point Number System -(1.3) Floting Point Numbr Sstm -(.3). Floting Point Numbr Sstm: Comutrs rrsnt rl numbrs in loting oint numbr sstm: F,k,m,M 0. 3... k ;0, 0 i, i,...,k, m M. Nottions: th bs 0, k th numbr o igits in th bs xnsion

More information

The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function

The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function A gnraliation of th frquncy rsons function Th convolution sum scrition of an LTI iscrt-tim systm with an imuls rsons h[n] is givn by h y [ n] [ ] x[ n ] Taing th -transforms of both sis w gt n n h n n

More information

Case Study VI Answers PHA 5127 Fall 2006

Case Study VI Answers PHA 5127 Fall 2006 Qustion. A ptint is givn 250 mg immit-rls thophyllin tblt (Tblt A). A wk ltr, th sm ptint is givn 250 mg sustin-rls thophyllin tblt (Tblt B). Th tblts follow on-comprtmntl mol n hv first-orr bsorption

More information

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1 Prctic qustions W now tht th prmtr p is dirctl rltd to th mplitud; thrfor, w cn find tht p. cos d [ sin ] sin sin Not: Evn though ou might not now how to find th prmtr in prt, it is lws dvisl to procd

More information

Mathematics. Mathematics 3. hsn.uk.net. Higher HSN23000

Mathematics. Mathematics 3. hsn.uk.net. Higher HSN23000 Highr Mthmtics UNIT Mthmtics HSN000 This documnt ws producd spcilly for th HSN.uk.nt wbsit, nd w rquir tht ny copis or drivtiv works ttribut th work to Highr Still Nots. For mor dtils bout th copyright

More information

ECE Experiment #6 Kitchen Timer

ECE Experiment #6 Kitchen Timer ECE 367 - Exprimnt #6 Kithn Timr Sprin 2006 Smstr Introution This xprimnt hs you onstrut iruit intrfin nin I/O lins from th 68HC11 with two svn smnt isplys n mtrix kyp, n writ ssmbly lnu o to rliz prormmbl

More information

TOPIC 5: INTEGRATION

TOPIC 5: INTEGRATION TOPIC 5: INTEGRATION. Th indfinit intgrl In mny rspcts, th oprtion of intgrtion tht w r studying hr is th invrs oprtion of drivtion. Dfinition.. Th function F is n ntidrivtiv (or primitiv) of th function

More information

Section 3: Antiderivatives of Formulas

Section 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 information

Jin-Fu Li. Department of Electrical Engineering National Central University Jhongli, Taiwan

Jin-Fu Li. Department of Electrical Engineering National Central University Jhongli, Taiwan Trnsprent BIST for RAMs Jin-Fu Li Advnced d Relible Systems (ARES) Lb. Deprtment of Electricl Engineering Ntionl Centrl University Jhongli, Tiwn Outline Introduction Concept of Trnsprent Test Trnsprent

More information

Point Processing of Images. Point Processing of Images. EECE/CS 253 Image Processing. Point Processing

Point Processing of Images. Point Processing of Images. EECE/CS 253 Image Processing. Point Processing EECE/CS 253 me Processin Lecture Notes: Lecture Notes: The Point Processin of mes Richrd Aln Peters Deprtment of Electricl Enineerin nd Computer Science Fll Semester 2007 Point Processin of mes n diitl

More information

Designing A Concrete Arch Bridge

Designing 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 information

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Module 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 information

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

CSC 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 information

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

SOLVED 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 information

CS September 2018

CS 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 information

Outline. Binary Tree

Outline. Binary Tree Outlin Similrity Srh Th Binry Brnh Distn Nikolus Austn nikolus.ustn@s..t Dpt. o Computr Sins Univrsity o Slzur http://rsrh.uni-slzur.t 1 Binry Brnh Distn Binry Rprsnttion o Tr Binry Brnhs Lowr Boun or

More information

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Similarity Search. The Binary Branch Distance. Nikolaus Augsten. Similrity Srh Th Binry Brnh Distn Nikolus Augstn nikolus.ugstn@sg..t Dpt. of Computr Sins Univrsity of Slzurg http://rsrh.uni-slzurg.t Vrsion Jnury 11, 2017 Wintrsmstr 2016/2017 Augstn (Univ. Slzurg) Similrity

More information

Examples and applications on SSSP and MST

Examples and applications on SSSP and MST Exampls an applications on SSSP an MST Dan (Doris) H & Junhao Gan ITEE Univrsity of Qunslan COMP3506/7505, Uni of Qunslan Exampls an applications on SSSP an MST Dijkstra s Algorithm Th algorithm solvs

More information

UNIT # 08 (PART - I)

UNIT # 08 (PART - I) . r. d[h d[h.5 7.5 mol L S d[o d[so UNIT # 8 (PRT - I CHEMICL INETICS EXERCISE # 6. d[ x [ x [ x. r [X[C ' [X [[B r '[ [B [C. r [NO [Cl. d[so d[h.5 5 mol L S d[nh d[nh. 5. 6. r [ [B r [x [y r' [x [y r'

More information

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

An 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 information

a 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...

a 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 information

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

(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 information

Weighted Matching and Linear Programming

Weighted Matching and Linear Programming Wightd Mtching nd Linr Progrmming Jonthn Turnr Mrch 19, 01 W v sn tht mximum siz mtchings cn b found in gnrl grphs using ugmnting pths. In principl, this sm pproch cn b pplid to mximum wight mtchings.

More information

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt

More information

Tangram Fractions Overview: Students will analyze standard and nonstandard

Tangram 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 information

Introduction to the Fourier transform. Computer Vision & Digital Image Processing. The Fourier transform (continued) The Fourier transform (continued)

Introduction to the Fourier transform. Computer Vision & Digital Image Processing. The Fourier transform (continued) The Fourier transform (continued) Introduction to th Fourir transform Computr Vision & Digital Imag Procssing Fourir Transform Lt f(x) b a continuous function of a ral variabl x Th Fourir transform of f(x), dnotd by I {f(x)} is givn by:

More information

Last time: introduced our first computational model the DFA.

Last time: introduced our first computational model the DFA. Lctur 7 Homwork #7: 2.2.1, 2.2.2, 2.2.3 (hnd in c nd d), Misc: Givn: M, NFA Prov: (q,xy) * (p,y) iff (q,x) * (p,) (follow proof don in clss tody) Lst tim: introducd our first computtionl modl th DFA. Tody

More information

Elements of Statistical Thermodynamics

Elements of Statistical Thermodynamics 24 Elmnts of Statistical Thrmodynamics Statistical thrmodynamics is a branch of knowldg that has its own postulats and tchniqus. W do not attmpt to giv hr vn an introduction to th fild. In this chaptr,

More information

Errata for Second Edition, First Printing

Errata for Second Edition, First Printing Errt for Scond Edition, First Printing pg 68, lin 1: z=.67 should b z=.44 pg 1: Eqution (.63) should rd B( R) = x= R = θ ( x R) p( x) R 1 x= [1 G( x)] = θp( R) + ( θ R)[1 G( R)] pg 15, problm 6: dmnd of

More information

Multipoint Alternate Marking method for passive and hybrid performance monitoring

Multipoint Alternate Marking method for passive and hybrid performance monitoring Multipoint Altrnt Mrkin mtho or pssiv n hyri prormn monitorin rt-iool-ippm-multipoint-lt-mrk-00 Pru, Jul 2017, IETF 99 Giuspp Fiool (Tlom Itli) Muro Coilio (Tlom Itli) Amo Spio (Politnio i Torino) Riro

More information

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x,

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x, Clculus for Businss nd Socil Scincs - Prof D Yun Finl Em Rviw vrsion 5/9/7 Chck wbsit for ny postd typos nd updts Pls rport ny typos This rviw sht contins summris of nw topics only (This rviw sht dos hv

More information

Liqiong Wei, Zhanping Chen, and Kaushik Roy. Yibin Ye and Vivek De. logic circuits more feasible.

Liqiong Wei, Zhanping Chen, and Kaushik Roy. Yibin Ye and Vivek De. logic circuits more feasible. _ Mix-V th (MVT) CMOS Ciruit Dsin Mthooloy or Low Powr Applitions Liqion Wi, Zhnpin Chn, n Kushik Roy Shool o Eltril n Computr Eninrin Puru Univrsity, W. Lytt, IN 47907-1285 Yiin Y n Vivk D Intl Corp.,

More information

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Integration 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 information

Theoretical Study on the While Drilling Electromagnetic Signal Transmission of Horizontal Well

Theoretical Study on the While Drilling Electromagnetic Signal Transmission of Horizontal Well 7 nd ntrntionl Confrnc on Softwr, Multimdi nd Communiction Enginring (SMCE 7) SBN: 978--6595-458-5 Thorticl Study on th Whil Drilling Elctromgntic Signl Trnsmission of Horizontl Wll Y-huo FAN,,*, Zi-ping

More information

Implementation of large dictionary automata The condensed wisdom of the Tarjans, Daciuks, Mihovs and Watsons of this world WORK IN PROGRESS!!!

Implementation of large dictionary automata The condensed wisdom of the Tarjans, Daciuks, Mihovs and Watsons of this world WORK IN PROGRESS!!! Implmnttion of lrg ictionry utomt Th conns wisom of th Trjns, Dciuks, Mihovs n Wtsons of this worl WORK IN PROGRESS!!! Uli Rffl July 20, 2010 Contnts Contnts 1 1 Introuction 2 2 Prliminry: Dtrministic

More information

Errata for Second Edition, First Printing

Errata for Second Edition, First Printing Errt for Scond Edition, First Printing pg 68, lin 1: z=.67 should b z=.44 pg 71: Eqution (.3) should rd B( R) = θ R 1 x= [1 G( x)] pg 1: Eqution (.63) should rd B( R) = x= R = θ ( x R) p( x) R 1 x= [1

More information

This Week. Computer Graphics. Introduction. Introduction. Graphics Maths by Example. Graphics Maths by Example

This Week. Computer Graphics. Introduction. Introduction. Graphics Maths by Example. Graphics Maths by Example This Wk Computr Grphics Vctors nd Oprtions Vctor Arithmtic Gomtric Concpts Points, Lins nd Plns Eploiting Dot Products CSC 470 Computr Grphics 1 CSC 470 Computr Grphics 2 Introduction Introduction Wh do

More information

Limits Indeterminate Forms and L Hospital s Rule

Limits Indeterminate Forms and L Hospital s Rule Limits Indtrmint Forms nd L Hospitl s Rul I Indtrmint Form o th Tp W hv prviousl studid its with th indtrmint orm s shown in th ollowin mpls: Empl : Empl : tn [Not: W us th ivn it ] Empl : 8 h 8 [Not:

More information

10/30/12. Today. CS/ENGRD 2110 Object- Oriented Programming and Data Structures Fall 2012 Doug James. DFS algorithm. Reachability Algorithms

10/30/12. Today. CS/ENGRD 2110 Object- Oriented Programming and Data Structures Fall 2012 Doug James. DFS algorithm. Reachability Algorithms 0/0/ CS/ENGRD 0 Ojt- Orint Prormmin n Dt Strutur Fll 0 Dou Jm Ltur 9: DFS, BFS & Shortt Pth Toy Rhility Dpth-Firt Srh Brth-Firt Srh Shortt Pth Unwiht rph Wiht rph Dijktr lorithm Rhility Alorithm Dpth Firt

More information

SIGNIFICANCE OF SMITH CHART IN ANTENNA TECHNOLOGY

SIGNIFICANCE OF SMITH CHART IN ANTENNA TECHNOLOGY SIGNIFICANCE OF SMITH CHART IN ANTENNA TECHNOLOGY P. Poornima¹, Santosh Kumar Jha² 1 Associat Profssor, 2 Profssor, ECE Dpt., Sphoorthy Enginring Collg Tlangana, Hyraba (Inia) ABSTRACT This papr prsnts

More information

Push trolley capacities from 1 2 through 10 Ton Geared trolley capacities from 1 2 through 100 Ton

Push trolley capacities from 1 2 through 10 Ton Geared trolley capacities from 1 2 through 100 Ton H o i s t n T r o l l y C o m i n t i o n s Push trolly cpcitis from 2 through 0 Ton Gr trolly cpcitis from 2 through 00 Ton CB n CF hn chin hoists cn suspn from ithr PT push trollys or GT gr trollys.

More information

Analysis of Algorithms - Elementary graphs algorithms -

Analysis of Algorithms - Elementary graphs algorithms - Analysis of Algorithms - Elmntary graphs algorithms - Anras Ermahl MRTC (Mälaralns Ral-Tim Rsach Cntr) anras.rmahl@mh.s Autumn 00 Graphs Graphs ar important mathmatical ntitis in computr scinc an nginring

More information

Analysis of Algorithms - Elementary graphs algorithms -

Analysis of Algorithms - Elementary graphs algorithms - Analysis of Algorithms - Elmntary graphs algorithms - Anras Ermahl MRTC (Mälaralns Ral-Tim Rsarch Cntr) anras.rmahl@mh.s Autumn 004 Graphs Graphs ar important mathmatical ntitis in computr scinc an nginring

More information

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am 16.unii Introution to Computrs n Prormmin SOLUTIONS to Exmintion /30/0 9:05m - 10:00m Pro. I. Kristin Lunqvist Sprin 00 Grin Stion: Qustion 1 (5) Qustion (15) Qustion 3 (10) Qustion (35) Qustion 5 (10)

More information

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula 7. Intgration by Parts Each drivativ formula givs ris to a corrsponding intgral formula, as w v sn many tims. Th drivativ product rul yilds a vry usful intgration tchniqu calld intgration by parts. Starting

More information

Minimum Spanning Trees

Minimum Spanning Trees Yufi Tao ITEE Univrsity of Qunslan In tis lctur, w will stuy anotr classic prolm: finin a minimum spannin tr of an unirct wit rap. Intrstinly, vn tou t prolm appars ratr iffrnt from SSSP (sinl sourc sortst

More information

1 Minimum Cut Problem

1 Minimum Cut Problem CS 6 Lctur 6 Min Cut and argr s Algorithm Scribs: Png Hui How (05), Virginia Dat: May 4, 06 Minimum Cut Problm Today, w introduc th minimum cut problm. This problm has many motivations, on of which coms

More information

EECE 301 Signals & Systems Prof. Mark Fowler

EECE 301 Signals & Systems Prof. Mark Fowler EECE 301 Signals & Systms Prof. Mark Fowlr ot St #21 D-T Signals: Rlation btwn DFT, DTFT, & CTFT 1/16 W can us th DFT to implmnt numrical FT procssing This nabls us to numrically analyz a signal to find

More information

Oppgavesett kap. 6 (1 av..)

Oppgavesett kap. 6 (1 av..) Oppgvstt kp. 6 (1 v..) hns.brnn@go.uio.no Problm 1 () Wht is homognous nucltion? Why dos Figur 6.2 in th book show tht w won't gt homognous nucltion in th tmosphr? ˆ Homognous nucltion crts cloud droplts

More information

2. Finite Impulse Response Filters (FIR)

2. Finite Impulse Response Filters (FIR) .. Mthos for FIR filtrs implmntation. Finit Impuls Rspons Filtrs (FIR. Th winow mtho.. Frquncy charactristic uniform sampling. 3. Maximum rror minimizing. 4. Last-squars rror minimizing.. Mthos for FIR

More information

Curing Regular Expressions Matching Algorithms from Insomnia, Amnesia, and Acalulia

Curing Regular Expressions Matching Algorithms from Insomnia, Amnesia, and Acalulia Dprtmnt of Computr Scinc & Enginring 27-25 Curing Rgulr Exprssions Mtching Algorithms from Insomni, Amnsi, n Acluli Authors: Silsh Kumr, Blkrishnn Chnrskrn, Jonthn Turnr, Gorg Vrghs Corrsponing Author:

More information

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

b. 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 information

The second condition says that a node α of the tree has exactly n children if the arity of its label is n.

The second condition says that a node α of the tree has exactly n children if the arity of its label is n. CS 6110 S14 Hanout 2 Proof of Conflunc 27 January 2014 In this supplmntary lctur w prov that th λ-calculus is conflunt. This is rsult is u to lonzo Church (1903 1995) an J. arkly Rossr (1907 1989) an is

More information

The Derivative of the Natural Logarithmic Function. Derivative of the Natural Exponential Function. Let u be a differentiable function of x.

The Derivative of the Natural Logarithmic Function. Derivative of the Natural Exponential Function. Let u be a differentiable function of x. Th Ntrl Logrithmic n Eponntil Fnctions: : Diffrntition n Intgrtion Objctiv: Fin rivtivs of fnctions involving th ntrl logrithmic fnction. Th Drivtiv of th Ntrl Logrithmic Fnction Lt b iffrntibl fnction

More information

10. The Discrete-Time Fourier Transform (DTFT)

10. The Discrete-Time Fourier Transform (DTFT) Th Discrt-Tim Fourir Transform (DTFT Dfinition of th discrt-tim Fourir transform Th Fourir rprsntation of signals plays an important rol in both continuous and discrt signal procssing In this sction w

More information

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Why 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 information

the output is Thus, the output lags in phase by θ( ωo) radians Rewriting the above equation we get

the output is Thus, the output lags in phase by θ( ωo) radians Rewriting the above equation we get Th output y[ of a frquncy-sctiv LTI iscrt-tim systm with a frquncy rspons H ( xhibits som ay rativ to th input caus by th nonro phas rspons θ( ω arg{ H ( } of th systm For an input A cos( ωo n + φ, < n

More information

Fractions. Mathletics Instant Workbooks. Simplify. Copyright

Fractions. Mathletics Instant Workbooks. Simplify. Copyright Frctons Stunt Book - Srs H- Smplfy + Mthltcs Instnt Workbooks Copyrht Frctons Stunt Book - Srs H Contnts Topcs Topc - Equvlnt frctons Topc - Smplfyn frctons Topc - Propr frctons, mpropr frctons n mx numbrs

More information

OSDM Proceedings of the First International Workshop on Open Source Data Mining. Frequent Pattern Mining Implementations

OSDM Proceedings of the First International Workshop on Open Source Data Mining. Frequent Pattern Mining Implementations OSDM 2005 Procins of th First Intrntionl Workshop on Opn Sourc Dt Minin Frqunt Pttrn Minin Implmnttions hl in conjunction with th Elvnth ACM SIGKDD Intrntionl Confrnc on Knowl Discovry n Dt Minin Eit y:

More information

Logic Redundancy Identication. September 14, target specic faults and are sometimes referred to as. \fault-independent methods.

Logic Redundancy Identication. September 14, target specic faults and are sometimes referred to as. \fault-independent methods. Fix-Vlu n Stm Unosrvility Thorms or Loi Runny Intition Sptmr 14, 2003 Astrt { Thr is lss o implition-s mthos tht intiy loi runny rom iruit topoloy n without ny primry input ssinmnt. Ths mthos r lss omplx

More information

Thermodynamic Analyses for Optimizing the Design of HTGR s Helium Brayton Cycles

Thermodynamic Analyses for Optimizing the Design of HTGR s Helium Brayton Cycles WSEAS TRANSACTIONS on ENVIRONMENT n DEVELOPMENT Florin Alx, Victor Cnus Thrmoynmic Anlyss for Optimiin th Dsin of HTGR s Hlium Bryton Cycls FLORIN ALEXE, n VICTOR CENUSA Powr Eninrin Dprtmnt, Powr Gnrtion

More information

ECE 407 Computer Aided Design for Electronic Systems. Instructor: Maria K. Michael. Overview. CAD tools for multi-level logic synthesis:

ECE 407 Computer Aided Design for Electronic Systems. Instructor: Maria K. Michael. Overview. CAD tools for multi-level logic synthesis: 407 Computr Aidd Dsign for Elctronic Systms Multi-lvl Logic Synthsis Instructor: Maria K. Michal 1 Ovrviw Major Synthsis Phass Logic Synthsis: 2-lvl Multi-lvl FSM CAD tools for multi-lvl logic synthsis:

More information

An Effective Heuristic for Simple Offset Assignment with Variable Coalescing

An Effective Heuristic for Simple Offset Assignment with Variable Coalescing An Etiv Huristi or Simpl Ost Assinmnt with Vribl Colsin Hssn Slmy n J. Rmnujm Dprtmnt o Eltril n Computr Eninrin n Cntr or Computtion n Thnoloy Louisin Stt Univrsity, Bton Rou, LA 7080, USA {hslm,jxr}@.lsu.u

More information

A Prey-Predator Model with an Alternative Food for the Predator, Harvesting of Both the Species and with A Gestation Period for Interaction

A Prey-Predator Model with an Alternative Food for the Predator, Harvesting of Both the Species and with A Gestation Period for Interaction Int. J. Opn Problms Compt. Math., Vol., o., Jun 008 A Pry-Prdator Modl with an Altrnativ Food for th Prdator, Harvsting of Both th Spcis and with A Gstation Priod for Intraction K. L. arayan and. CH. P.

More information

CS 461, Lecture 17. Today s Outline. Example Run

CS 461, Lecture 17. Today s Outline. Example Run Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h

More information

REAL-TIME ESTIMATION OF O-D MATRICES WITH PARTIAL TRAJECTORIES FROM ETC TAG DATA

REAL-TIME ESTIMATION OF O-D MATRICES WITH PARTIAL TRAJECTORIES FROM ETC TAG DATA REAL-TIME ESTIMATION OF O-D MATRICES WITH PARTIAL TRAJECTORIES FROM ETC TAG DATA Jimyoung Kwon 1 Institut of Trnsporttion Stuis Univrsity of Cliforni, Brkly 6 Evns Hll, Brkly, CA 940-60 Tl: (510)64-1;

More information

EEO 401 Digital Signal Processing Prof. Mark Fowler

EEO 401 Digital Signal Processing Prof. Mark Fowler EEO 401 Digital Signal Procssing Prof. Mark Fowlr Dtails of th ot St #19 Rading Assignmnt: Sct. 7.1.2, 7.1.3, & 7.2 of Proakis & Manolakis Dfinition of th So Givn signal data points x[n] for n = 0,, -1

More information

AIR FORCE STANDARD DESIGN MILITARY WORKING DOG FACILITY

AIR FORCE STANDARD DESIGN MILITARY WORKING DOG FACILITY 1. NRL NOTS US THS OUMNTS IN ONJUTION WITH TH STNR SIN OUMNT N INTRTIV PRORMMIN WORKSHT. NUMR RWIN LIST NM -1 OVR SHT -1 STNR SIN PLN - 1-2 STNR SIN PLN - 2-3 MOULS,, & PLNS & XONS -4 MOULS PLNS & XONS

More information

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Using 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 information

ECE 407 Computer Aided Design for Electronic Systems. Circuit Modeling and Basic Graph Concepts/Algorithms. Instructor: Maria K. Michael.

ECE 407 Computer Aided Design for Electronic Systems. Circuit Modeling and Basic Graph Concepts/Algorithms. Instructor: Maria K. Michael. 0 Computr i Dsign or Eltroni Systms Ciruit Moling n si Grph Conptslgorithms Instrutor: Mri K. Mihl MKM - Ovrviw hviorl vs. Struturl mols Extrnl vs. Intrnl rprsnttions Funtionl moling t Logi lvl Struturl

More information

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12 Aministrivi: CS61B Ltur #33 Autogrr will run this vning. Toy s Rings: Grph Struturs: DSIJ, Chptr 12 Lst moifi: W Nov 8 00:39:28 2017 CS61B: Ltur #33 1 Why Grphs? For xprssing non-hirrhilly rlt itms Exmpls:

More information

TURFGRASS DISEASE RESEARCH REPORT J. M. Vargas, Jr. and R. Detweiler Department of Botany and Plant Pathology Michigan State University

TURFGRASS DISEASE RESEARCH REPORT J. M. Vargas, Jr. and R. Detweiler Department of Botany and Plant Pathology Michigan State University I TURFGRASS DISEASE RESEARCH REPORT 9 J. M. Vrgs, Jr. n R. Dtwilr Dprtmnt f Btny n Plnt Pthlgy Mihign Stt Univrsity. Snw Ml Th 9 snw ml fungii vlutin trils wr nut t th Byn Highln Rsrt, Hrr Springs, Mihign

More information