ECEN620: Network Theory Broadband Circuit Design Fall 2018

Size: px
Start display at page:

Download "ECEN620: Network Theory Broadband Circuit Design Fall 2018"

Transcription

1 ECE60: etwork Theory Broadbad Circuit Deig Fall 08 Lecture 3: Phae-Locked Loop Sytem Sam Palermo Aalog & Mixed-Sigal Ceter Texa A&M Uiverity

2 Aoucemet & Readig/Referece HW due Sept. 0 Chapter, 3, 5, & of Phaelock Techique, F. Garder, Joh Wiley & So, Chapter -3.4 of Low-Power Low-Jitter O-Chip Clock Geeratio, M. Mauri, Ph.D. thei, UCLA, 003. Poted o webite Other referece M. Perrott, High Speed Commuicatio Circuit ad Sytem Coure, MIT Ope Coureware Chapter of Phae-Locked Loop, 3rd Ed., R. Bet, McGraw-Hill, 997. Chapter 4 of Phae-Locked Loop for Wirele Commuicatio, D. Stephe, luwer, 00.

3 Ageda PLL Overview PLL Liear Model PLL Stability PLL Uit PLL oie Trafer Fuctio PLL Traiet Behavior 3

4 PLL Block Diagram [Perrott] A phae-locked loop (PLL) i a egative feedback ytem where a ocillator-geerated igal i phae AD frequecy locked to a referece igal 4

5 PLL Applicatio PLL applicatio Frequecy ythei Multiplyig a 00MHz referece clock to 0GHz Skew cacellatio Phae aligig a iteral clock to a I/O clock Clock recovery Extract from icomig data tream the clock frequecy ad optimum phae of high-peed amplig clock Modulatio/De-modulatio Wirele ytem Spread-pectrum clockig 5

6 Forward Clock I/O Circuit TX PLL TX Clock Ditributio Replica TX Clock Driver Chael Forward Clock Amplifier RX Clock Ditributio De-Skew Circuit DLL/PI Ijectio-Locked Ocillator 6

7 Embedded Clock I/O Circuit TX PLL TX Clock Ditributio CDR Per-chael PLL-baed Dual-loop w/ Global PLL & Local DLL/PI Local Phae-Rotator PLL Global PLL require RX clock ditributio to idividual chael 7

8 Ageda PLL Overview PLL Liear Model PLL Stability PLL Uit PLL oie Trafer Fuctio PLL Traiet Behavior 8

9 Liear PLL Model Phae i geerally the key variable of iteret Liear mall-igal aalyi i ueful for udertad PLL dyamic if PLL i locked (or ear lock) Iput phae deviatio amplitude i mall eough to maitai operatio i lock rage 9

10 Phae Detector ref e fb Detect phae differece betwee feedback clock ad referece clock The loop filter will filter the phae detector output, thu to characterize phae detector gai, extract average output voltage (or curret for charge-pump PLL) 0

11 Loop Filter VDD I Chargig Cotrol Voltage I VSS Dichargig C R C F() Lowpa filter extract average of phae detector error pule

12 Voltage-Cotrolled Ocillator 0 0 VDD/ VDD Time-domai phae relatiohip t t dt v t out out c dt out t t v t 0 out 0 Laplace Domai Model c out (t)

13 Loop Divider out (t) fb (t) [Perrott] Time-domai model fb t out t fb t t dt t out out 3

14 Phae & Frequecy Relatiohip Agular Frequecy i the firt derivative (rate of chage v time) of phae d dt t t Coider a iuoid Phae Step u t t u t t u t i u t t d o t with agular frequecy t ad phae t u t i t t t [Bet] o chage i frequecy 4

15 Phae & Frequecy Relatiohip Frequecy Step u t t i t t i t t 0 where 0 t t 0 A frequecy tep produce a ramp i phae [Bet] t t 5

16 quadratic chage i phae a A frequecy ramp produce where i i i t t t t t t d t u t t t Phae & Frequecy Relatiohip 6 [Bet] Frequecy Ramp 0 t 0 t t

17 Udertadig PLL Frequecy Repoe Liear mall-igal aalyi i ueful for udertad PLL dyamic if PLL i locked (or ear lock) Iput phae deviatio amplitude i mall eough to maitai operatio i lock rage Frequecy domai aalyi ca tell u how well the PLL track the iput phae a it chage at a certai frequecy PLL trafer fuctio i differet depedig o which poit i the loop the output i repodig to Iput phae repoe output repoe [Fichette] 7

18 Ope-Loop PLL Trafer Fuctio G out e F Ope-loop repoe geerally decreae with frequecy 8

19 Cloed-Loop PLL Trafer Fuctio Sytem Determiat l Forward Path Gai G Loop Gai F Forward Path Determiat G G 0 G 0 H out ref G G F Low-pa repoe whoe overall order i et by F() F 9

20 PLL Error Trafer Fuctio l Sytem Determiat Forward Path Gai Loop Gai F Forward Path Determiat G G 0 G 0 E e ref G F Ideally, we wat thi to be zero Phae error geerally icreae with frequecy due to thi high-pa repoe 0

21 PLL Order ad Type The PLL order refer to the umber of pole i the cloed-loop trafer fuctio Thi i typically oe greater tha the umber of loop filter pole The PLL type refer to the umber of itegrator withi the loop A PLL i alway at leae Type due to the itegrator ote, the order ca ever be le tha the type

22 Firt-Order PLL Simple firt-order low-pa trafer fuctio Cloed-loop badwidth i equal to the loop gai magitude ote, the Loop Gai Magitude i ot imply the PLL ope-loop gai evaluated at =0. It i lim 0. G F Forward Path Gai : G G Loop Gai Magitude : lim 0 3dB Trafer Fuctio : H 3dB Cloed - Loop Badwidth : 3dB Error Fuctio : E 3dB Thi expreio cacel the pole ad allow a compario betwee PLL of differet order ad type. It i ueful to predict the teady-tate phae error. See Garder..3 ad 5...

23 Firt-Order PLL Trackig Repoe The PLL trackig behavior, or how the phae error repod to a iput phae chage, varie with the PLL type Phae Step Repoe [Bet] u t t t t u t i u o chage i frequecy The fial value theorem ca be ued to fid the teady-tate phae error lim 0 E lim 0 0 All PLL hould have o teady-tate phae error with a phae tep error ote, thi aume that the frequecy of operatio i the ame a the ceter frequecy (V ctrl =0). Workig at a frequecy other tha the ceter frequecy i coidered havig a frequecy offet (tep). 3

24 Firt-Order PLL Trackig Repoe Frequecy Offet (Step) u t t i t t i t t 0 where 0 t t 0 [Bet] A frequecy tep produce a ramp i phae The fial value theorem ca be ued to fid the teadytate phae error lim E 0 0 lim With a frequecy offet (tep), a firt-order PLL will lock with a teady-tate phae error that i iverely proportioal to the loop gai 4

25 Firt-Order PLL Iue The loop gai directly et the PLL badwidth o degree of freedom I order to have low phae error, a large loop gai i eceary, which implie a wide badwidth Thi may ot be deired i applicatio where we would like to filter iput referece clock phae oie Firt-order PLL offer o filterig of the phae detector output Without thi filterig, the may ot be well approximated by a imple factor Multiplier have a ecod-harmoic term Digital output quare pule that eed to be filtered 5

26 Secod-Order Type- PLL w/ Paive Lag-Lead Filter Paive Lag-Lead Loop Filter [Alle] F R C R C 6

27 7 R C R C F Secod-Order Type- PLL w/ Paive Lag-Lead Filter 0 Error Fuctio : Dampig Factor : Frequecy : atural Trafer Fuctio : lim Loop Gai Magitude : Forward Path Gai : E H G G Q : ote

28 Secod-Order Type- PLL Trackig Repoe Phae Step Repoe lim lim E Agai, phae error hould be zero with a phae tep Frequecy Offet (Step) lim E lim 0 0 A ecod-order type- PLL will till lock with a phae error if there i a frequecy offet! 8

29 Secod-Order Type- PLL Propertie While the ecod-order type- PLL will till lock with a phae error with a frequecy offet, it i much more ueful tha a firt-order PLL There are ufficiet deig parameter (degree of freedom) to idepedetly et,, ad The loop filter coditio the phae detector output for proper cotrol Loop tability eed to be coidered for the ecod-order ytem 9

30 Secod-Order Type- PLL w/ Paive Serie- Lag-Lead Filter Paive Serie- Loop Filter F R ote, thi type of loop filter i typically ued with a chargepump drivig it. Thu, the filter trafer fuctio i equal to the impedace. 30

31 Secod-Order Type- PLL w/ Paive Serie- Lag-Lead Filter F R Trafer Fuctio : H Forward Path Gai : G Error Fuctio : E Loop Gai Magitude : R R C atural Frequecy: C Dampig Factor : R G lim 0 3

32 Secod-Order Type- PLL Trackig Repoe Phae Step Repoe lim E lim Agai, phae error hould be zero with a phae tep Frequecy Offet (Step) lim 0 0 E lim 0 A ecod-order type- PLL will lock with o phae error with a frequecy offet! 3

33 Secod-Order Type- PLL Propertie A big advatage of the type- PLL i that it ha zero phae error eve with a frequecy offet Thi i why type- PLL are very popular A type- PLL require a zero i the loop filter for tability. ote, thi i ot required i a type- PLL Thi zero ca caue extra peakig i the frequecy repoe Importat to miimize thi i ome applicatio, uch a cacaded CDR ytem 33

34 Ageda PLL Overview PLL Liear Model PLL Stability PLL Uit PLL oie Trafer Fuctio PLL Traiet Behavior 34

35 Feedback Cofiguratio [arilaya] Here f = feedback factor (B() i previou lide) A CL () If a 0 i large : A 0 f CL p 0 a p f 35

36 ote: a() ca have higher-order pole [arilaya] 36

37 [arilaya] 37

38 [arilaya] 38

39 Firt-Order PLL Trafer Fuctio : H Error Fuctio : E F Forward Path Gai : G Loop Gai Magitude : Cloed - Loop Badwidth : 3dB G lim 0 3dB 3dB 3dB 39

40 Firt-Order PLL Stability Ope-loop Bode plot are ueful for checkig tability via 0log0 G j (db) G the phae margi A firt-order PLL i iheretly table ad alway ha 90 phae margi 40

41 4 0 Error Fuctio : Dampig Factor : Frequecy : atural Trafer Fuctio : lim Loop Gai Magitude : Forward Path Gai : E H G G R C R C F Secod-Order Type- PLL w/ Paive Lag-Lead Filter

42 0log0 Secod-Order Type- PLL w/ Lag-Lead Filter Stability Aumig a decade pacig betwee filter pole ad zero G j (db) G ormalizig for = orm. Zeta PM A larger provide a more table ytem 4

43 Secod-Order Type- PLL w/ Lag-Lead Filter Output Repoe w/ Phae Step orm. Zeta PM ote, time axi i caled by qrt( ) i order to view the phae tep plot o oe graph 43

44 Root Locu A Root-Locu Plot i a plot of the cloed-loop pole i the complex -plae a the loop gai chage from zero to very large Ueful i viualizig ytem tability ad eitivity to variatio i loop gai For tability, all pole hould lie withi the left-half plae, i.e o pole hould be i the right-half plae A good deig eure that the pole have ufficiet margi from the imagiary axi for proper tability, dampig, ad acceptable gai peakig 44

45 Secod-Order Type- PLL w/ Paive Lag-Lead Filter Root Locu G Ope - Loop : =, =9 Cloed - Loop : H Iitial pole value with zero loop gai are the ope-loop pole p 0 p 0. Fial pole value with ifiite loop gai are the ope-loop zero p p 45

46 46 Secod-Order Type- PLL w/ Paive Lag-Lead Filter Root Locu Cloed - Loop : Ope - Loop : H G =, =9 for = 0.* =0.38 0* =3.09 For

47 Secod-Order Type- PLL w/ Paive Lag-Lead Filter Cloed-Loop Repoe 0*log 0 H(j) G Ope - Loop : Cloed - Loop : H ormalized Phae Step Repoe orm. Zeta PM / t*qrt( ) A larger provide a more table ytem ad wider loop badwidth 47

48 Secod-Order Type- PLL w/ Paive Serie- Lag-Lead Filter F R Defie a loop gai factor Forward Path Gai : G R R Trafer Fuctio : H R R C atural Frequecy: C Dampig Factor : Error Fuctio : E 48

49 Secod-Order Type- PLL w/ Paive Serie- Lag-Lead Filter Root Locu R=, C= G Ope - Loop : Cloed - Loop : H Iitial pole value with zero loop gai are the ope-loop pole p 0 p 0 Fial pole value with ifiite loop gai are the ope-loop zero p p 49

50 Secod-Order Type- PLL w/ Paive Serie- Lag-Lead Filter Root Locu R=, C= G Ope - Loop : Cloed - Loop : H for = 0.* =0.38 0* =

51 Secod-Order Type- PLL w/ Paive Serie- Lag-Lead Filter Stability 0log0 G j (db) G ormalizig for = orm. Zeta PM A larger provide a more table ytem 5

52 Secod-Order Type- PLL w/ Paive Serie- Lag-Lead Filter Cloed-Loop Repoe 0*log 0 H(j) G Ope - Loop: Cloed - Loop: H ormalized Phae Step Repoe orm. Zeta PM / t*qrt( ) A larger provide a more table ytem ad wider loop badwidth 5

53 Typical Charge-Pump PLL Loop Filter VDD w/o C I Chargig Cotrol Voltage F R I VSS Dichargig C R C F() A ecodary capacitor C i ofte added for additioal filterig to reduce referece pur Thi itroduce a extra pole ad potetial tability cocer 53 F w/ C C C C C

54 Dampig Factor : Frequecy: atural high frequecy, ca approximate a a ecod - order ytem with the third - pole i at a If Error Fuctio : Trafer Fuctio : Forward Path Gai : loop gai factor Defie a C C C C C C C C C C C C C C C E C C C C C C C C C H C C C C C C C G R Third-Order Type- PLL w/ Paive Serie- Lag-Lead Filter & Additioal Pole C C C C F

55 Third-Order Type- PLL w/ Paive Serie- Lag-Lead Filter & Additioal Pole Root Locu G Ope - Loop: C C C R=, C =, C =0. Cloed - Loop: H C C 3 C Iitial pole value with zero loop gai are the ope-loop pole C C p 0 p 0 p3 C Fial pole value with ifiite loop gai p p,3 5 j 55

56 Third-Order Type- PLL w/ Paive Serie- Lag-Lead Filter & Additioal Pole Root Locu G Ope - Loop: C C C R=, C =, C =0. Cloed - Loop: H C C 3 C for = 0.* =

57 Secod-Order Type- PLL w/ Paive Serie- Lag-Lead Filter Stability 0log0 G j (db) G ormalizig for = orm. Zeta PM A larger provide a more table ytem 57

58 Third-Order Type- PLL w/ Paive Serie- Lag-Lead Filter & Additioal Pole Stability 0log0 G j (db) G C C C ormalizig for = A larger may ot provide a more table ytem 58

59 Third-Order Type- PLL Cloed-Loop Repoe 0*log 0 H(j) G Ope - Loop: C C C Cloed - Loop: H 3 C C C ormalized Phae Step Repoe / t*qrt( ) If i icreaed too high frequecy peakig ad traiet rigig occur! 59

60 Itability ad the yquit Criterio [arilaya] For a PLL T i the forward gai G T multiplied by the feedback factor G 60

61 For a PLL : T G Frequecy Sweep of Loop Gai, T() [arilaya] 6

62 Ageda PLL Overview PLL Liear Model PLL Stability PLL Uit PLL oie Trafer Fuctio PLL Traiet Behavior 6

63 PLL Uit w/ Dimeiole Filter (o-charge-pump PLL) 63

64 Phae Detector Detect phae differece betwee feedback clock ad referece clock The loop filter will filter the phae detector output, thu to characterize phae detector gai, extract average output voltage The factor ca chage depedig o the pecific phae detector circuit PLL w/ dimeio uit - le are V/rad loop filter : 64

65 Dimeio-Le Loop Filter Example: Paive Lag-Lead Loop Filter [Alle] F R C Lowpa filter extract average of phae detector igal o uit for the dimeio-le loop filter R C 65

66 Voltage-Cotrolled Ocillator 0 0 VDD/ VDD Time-domai phae relatiohip t t dt v t out out rad uit are V MHz 6 rad 0 V V c dt out t t v t 0 out 0 Laplace Domai Model c out (t) 66

67 Loop Divider out (t) fb (t) [Perrott] Time-domai model fb t out t The loop divider i dimeio-le i the PLL liear model fb t t dt t out out 67

68 PLL Uit w/ Dimeiole Filter (o-charge-pump PLL) uit are V/rad Loop Filter i uit - le rad uit are V Loop Divider i uit - le 68

69 PLL Uit w/ Impedace Filter (Charge-Pump PLL) [Mauri] D ICP 69

70 Phae Frequecy Detector (PFD) Phae Frequecy Detector allow for wide frequecy lockig rage, potetially etire tuig rage 3-tage operatio with UP ad DOW output et differece i pule width repreet phae error UP loger = Poitive D loger = egative Edge-triggered reult i duty cycle ieitivity The u-averaged PFD gai (ratio of et output pule time width with iput phae error time) i typically ad dimeio-le 70

71 Averaged PFD Trafer Characteritic UP= & D=- [Perrott] Cotat lope ad polarity aymmetry about zero phae allow for wide frequecy rage operatio The averaged PFD gai i typically /(*pi) with uit of rad - 7

72 Charge Pump Covert PFD output igal to charge Charge i proportioal to PFD pule width U - Averaged Charge - Pump Gai I ICP Amp Averaged Charge - Pump Gai rad ICP Amp Total PFD & Charge - Pump Gai rad Thi gai ca vary if a differet phae detector i ued CP Amp 7

73 Loop Filter VDD w/o C I Chargig Cotrol Voltage F R I VSS Dichargig C R C F() F w/ C C C C C Lowpa filter extract average of phae detector error pule The uit of the filter are ohm 73

74 PLL Uit w/ Impedace Filter (Charge-Pump PLL) [Mauri] D ICP i uit - le if u - averaged, uit of Charge Pump Gai uit are A if Total Phae Detector & Charge - Pump combied gai ha uit of Loop Filter ha uit of, u - averaged, Loop divider i uit - le rad - if A rad if rad uit are V averaged averaged A rad Oly Average Oce 74

75 Ageda PLL Overview PLL Liear Model PLL Stability PLL Uit PLL oie Trafer Fuctio PLL Traiet Behavior 75

76 PLL oie Trafer Fuctio [Mauri] 76

77 Iput oie Trafer Fuctio [Mauri] o Iput Phae oie: Voltage oie o Iput Clock Source: ICPR w/ a loop gai factor : (aume ) H I T I out I v out I o out o I 77

78 Iput oie Trafer Fuctio 78 out H I I v T o o out out I I I Iput Phae oie: Voltage oie o Iput Clock Source: 0, 0,.6, 53,, rad 0 *0,, * Simulatio Parameter buf delay V p V MHz k R pf C V GHz A GHz MHz

79 oie Trafer Fuctio [Mauri] i differet if the iput i at the V ctrl iput ( ) or upply ( Vdd ) Phae oie: H out Voltage oie o Iput: T v out out 79

80 oie Trafer Fuctio 80 out H v T out out Phae oie: Voltage oie o Iput: 0, 0,.6, 53,, rad 0 *0,, * Simulatio Parameter buf delay V p V MHz k R pf C V GHz A GHz MHz

81 Clock Buffer oie Trafer Fuctio [Mauri] delay uit = (/V) delay buf Output Phae oie: Voltage oie o Buffer Iput: out out delay T buf v buf buf buf H buf out buf delay buf delay 8

82 Clock Buffer oie Trafer Fuctio 8 out H buf buf v T delay buf delay buf delay out out buf buf buf Output Phae oie: Voltage oie o Buffer Iput: 0, 0,.6, 53,, rad 0 *0,, * Simulatio Parameter buf delay V p V MHz k R pf C V GHz A GHz MHz

83 PLL oie Trafer Fuctio Take-Away Poit The way a PLL hape phae oie deped o where the oie i itroduced i the loop Optimizig the loop badwidth for oe oie ource may ehace other oie ource Geerally, the PLL low-pa hape iput phae oie, bad-pa hape iput voltage oie, ad high-pa hape /clock buffer output phae oie 83

84 Ageda PLL Overview PLL Liear Model PLL Stability PLL Uit PLL oie Trafer Fuctio PLL Traiet Behavior 84

85 Liear PLL Model If the phae iput amplitude i mall, the the liear model ca be ued to predict the traiet repoe E e ref G F Ideally, we wat thi to be zero Phae error geerally icreae with frequecy due to thi high-pa repoe 85

86 Firt-Order PLL Trackig Repoe F, E, 3dB 3dB Phae Step Repoe Uig the Fial Value Theorem : lim 0 E lim 0 0 Phae error hould be zero with a phae tep Traiet Repoe : L e t Traiet Repoe i a expoetialy decayig tep 86

87 Firt-Order PLL Trackig Repoe F, E, 3dB 3dB Frequecy Offet (Step) Repoe Uig the Fial Value Theorem : lim 0 E lim 0 The phae error i iverely proporitioal to the loop gai with a frequecy offet Traiet Repoe : L e t Traiet Repoe i a expoetialy riig tep 87

88 Firt-Order PLL Trackig Repoe F, E, 3dB 3dB Frequecy Ramp Repoe Aume that the iput frequecy i chagig liearly with time at a rate of rad/ec ref t t Uig the Fial Value Theorem : lim 0 3 E lim 0 3 The phae error will grow to ifiity if i fiite Traiet Repoe : L 3 t e t 88

89 E F,, 89 Phae Step Repoe yourelf thi Try to compute Traiet Repoe : phae tep Phae error hould be zero with a 0 lim lim Value Theorem : the Fial Uig 0 0 E L Secod-Order Type- PLL Trackig Repoe

90 E F,, 90 Frequecy Offet (Step) Repoe yourelf thi Try to compute Traiet Repoe : frequecy offet to the loop gai with a phae error i iverely proporitioal The lim lim Value Theorem : the Fial Uig 0 0 E L Secod-Order Type- PLL Trackig Repoe

91 E F,, 9 Frequecy Ramp Repoe yourelf thi Try to compute Traiet Repoe : fiite i grow to ifiity if phae error will The lim lim Value Theorem : the Fial Uig E L Secod-Order Type- PLL Trackig Repoe

92 Secod-Order Type- PLL Trackig Repoe F R, Phae Step Repoe E, R Uig the Fial Value Theorem : lim E 0 lim Phae error hould be zero with a phae tep Traiet Repoe : L 9

93 Secod-Order Type- PLL Phae Step Repoe Traiet Repoe : L 93

94 Secod-Order Type- PLL Trackig Repoe F R, E, R Frequecy Offet (Step) Repoe Uig the Fial Value Theorem : lim E 0 lim 0 The phae error goe to zero with a Type - PLL 3 0 Traiet Repoe : L 94

95 Secod-Order Type- PLL Frequecy Step Repoe Traiet Repoe : L 95

96 96 Frequecy Ramp Repoe E Traiet Repoe : dyamic phae lag frequecy ramp with a A ecod - order type - PLL ca track a lim lim Value Theorem : the Fial Uig L Secod-Order Type- PLL Trackig Repoe R E R F,,

97 Secod-Order Type- PLL Frequecy Ramp Repoe Traiet Repoe : L 3 97

98 Ideal Phae Detector A ideal phae detector ha the ame gai (lope) over a rage Thi allow the liear PLL model to be ued for all phae relatiohip 98

99 Real Phae Detector May phae detector are oliear ad do ot diplay the ame gai for a give phae relatiohip Thi implie that the PLL caot be decribed by the liear model for large iput phae deviatio 99

100 PLL Frequecy Step Repoe: Liear v Behavioral Model Frequecy Step Iput: ref ()= = Mrad/ec 3 o Cycle Slip Oberved with Liear Model Cycle Slip Due to o-liearitie i loop compoet (primarily the ), a real PLL repoe ca vary igificatly from the liear model 00

101 PLL Hold Rage (Siuoidal ) A PLL Hold Rage i the iput frequecy rage over which the PLL ca maitai tatic lock w/ Liear Model the Steady -State Phae Error i e Firt - Order : Secod - Order Type -: Secod - Order Type - : With a iuoidal phae detector, the phae error i i e Sice ie caot exceed, the lock frequecy i cotraied to Hold Rage : H rad/ec The hold rage i fiite for a type- PLL, ad theoretically ifiite for a type- PLL. However i practice it will be limited by aother PLL block, uch a the tuig rage. 0

102 Firt-Order PLL Phaelock Acquiitio (Siuoidal ) Aumig a imple firt - order PLL with a iuoidal F Itataeou Frequecy : Siuoidal Phae Detector Output : o v c i t e Aume the iput igal i at a frequecy differet from, uch that the o iput phae i ref t ad ref o 0

103 Firt-Order PLL Phaelock Acquiitio (Siuoidal ) out t t t v d 0 t i d 0 o o c The PLL output phae i out o t o The PLL phae error i e out e ref out t ref o t i e o d 0 out Differetiatig thi w.r.t. time yield the followig oliear differetial equatio de dt t i e t where 03

104 Firt-Order PLL Hold Rage (Siuoidal ) de dt If the PLL i locked, t e i i e 0 Sice ie caot exceed, the lock frequecy i cotraied to Hold Rage : H rad/ec 04

105 Firt-Order PLL Phaelock Acquiitio (Siuoidal ) ormalizig the firt - order PLL differetial equatio by e ormalized Frequecy Error, e i e I the phae - plae plot, there are ull where egative - lope ull are table lock poit, d e dt 0 Phae Error, e while poitive - lope ull are utable Every cycle ( iterval) cotai a table ull, thu e caot chage by more tha oe cycle before lockig There i o cycle lippig i the lockig proce A cycle lip occur whe the phae error chage by more tha without lockig 05

106 Firt-Order PLL Phaelock Acquiitio Time (Siuoidal ) I order to fid the phaelock acquitio time, we eed to formally olve If e t t i zero ad t o e i d 0 e out 0i mall, uch that i e, e the approximate olutio i the liear model phae tep repoe However, if e 0 e t 0 i large, the repoe will deviate from thi liear approximatio ad ca icreae igificatly out e t 06

107 Firt-Order PLL Lock Failure (Siuoidal ) Firt-Order PLL Cotrol Voltage Hold Rage : H rad/ec If the frequecy offet exceed the PLL hold rage, the phae error will ocillate aymmetrically a the PLL udergoe cycle lip 07

108 Secod-Order Type- PLL Phaelock Acquiitio (Siuoidal ) 08 0 i i 0 PLL output phae i The i i time - domai ca be expreed a The filter repoe i the Aumig a ecod - order type - PLL with a iuoidal out t t e t e o out t o c o out t e e t e e c d d d t d v t t d d v t v t v F

109 Secod-Order Type- PLL Phaelock Acquiitio (Siuoidal ) The PLL phae error i e ref out t ref o t i e e 0 co d i d d 0 Differetiatig thi twice w.r.t. time yield the followig oliear differetial equatio i e e t e t 0 0 e out 09

110 Secod-Order Type- PLL Phaelock Acquiitio (Siuoidal ) For thi Secod - Order Type - PLL, the atural frequecy ad dampig factor are, 4 Subtitutig thi ito the oliear differetial equatio yield the followig e co i 0 e e e o cloed form olutio exit, ad umerical techique are required to olve 0

111 Secod-Order Type- PLL Phaelock Acquiitio (Siuoidal ) co e i 0 e e e Acquiitio with a phae error ad e e v time Phae Plae Plot : v e e

112 Secod-Order PLL Phae Plae Plot (Siuoidal ) A utable igularity i called a Saddle Poit A trajectory that termiate o a addle poit i called a Separatrix e co i 0 e e e If a trajectory lie betwee the eparatrice, it will lock without cycle lippig If a trajectory lie outide the eparatrice, it will cycle lipplig oe or more time before lockig (if at all)

113 Secod-Order PLL Pull-Out Rage ad Lock Time (Siuoidal ) The Pull-Out Rage i the maximum frequecy tep that ca occur before the loop lock without cycle lippig PO.8 for betwee 0.5 ad.4 If a frequecy tep i le tha the pull - out rage, the PLL acquitio t acq t phae t freq for phae error le tha 0% 4 4. f 3 B L time ca be approximated a Here, B L i the PLL oie badwidth B L 0 H f df (Hz) Aumig F, B L 4 (Hz) 3

114 Secod-Order PLL Lockig Outide of the Pull-Out Rage (Siuoidal ) Multiple cycle lip are oberved before the loop lock 4

115 ext Time Phae Detector Circuit 5

So we find a sample mean but what can we say about the General Education Statistics

So we find a sample mean but what can we say about the General Education Statistics So we fid a ample mea but what ca we ay about the Geeral Educatio Statitic populatio? Cla Note Cofidece Iterval for Populatio Mea (Sectio 9.) We will be doig early the ame tuff a we did i the firt ectio

More information

Math 167 Review for Test 4 Chapters 7, 8 & 9

Math 167 Review for Test 4 Chapters 7, 8 & 9 Math 167 Review for Tet 4 Chapter 7, 8 & 9 Vocabulary 1. A ordered pair (a, b) i a of a equatio i term of x ad y if the equatio become a true tatemet whe a i ubtituted for x ad b i ubtituted for y. 2.

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Using the Keyboard. Using the Wireless Keyboard. > Using the Keyboard

Using the Keyboard. Using the Wireless Keyboard. > Using the Keyboard 1 A wireless keyboard is supplied with your computer. The wireless keyboard uses a stadard key arragemet with additioal keys that perform specific fuctios. Usig the Wireless Keyboard Two AA alkalie batteries

More information

The following algorithms have been tested as a method of converting an I.F. from 16 to 512 MHz to 31 real 16 MHz USB channels:

The following algorithms have been tested as a method of converting an I.F. from 16 to 512 MHz to 31 real 16 MHz USB channels: DBE Memo#1 MARK 5 MEMO #18 MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS 1886 November 19, 24 Telephoe: 978-692-4764 Fax: 781-981-59 To: From: Mark 5 Developmet Group

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

Chapter 4 The Datapath

Chapter 4 The Datapath The Ageda Chapter 4 The Datapath Based o slides McGraw-Hill Additioal material 24/25/26 Lewis/Marti Additioal material 28 Roth Additioal material 2 Taylor Additioal material 2 Farmer Tae the elemets that

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD) FINIT DIFFRNC TIM DOMAIN MTOD (FDTD) The FDTD method, proposed b Yee, 1966, is aother umerical method, used widel for the solutio of M problems. It is used to solve ope-regio scatterig, radiatio, diffusio,

More information

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS) CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

SRx. HD/SD Dual Input Diversity COFDM Receiver. Features. Options

SRx. HD/SD Dual Input Diversity COFDM Receiver. Features. Options HD/SD Dual Iput Diversity COFDM Receiver Features Dual iput maximum ratio combiig diversity receiver Umatched adjacet chael performace Superior broadcast grade video MPEG4 Part-10/H.264 2 moo audio chaels

More information

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation The Nature of Light Chapter Reflectio ad Refractio of Light Sectios: 5, 8 Problems: 6, 7, 4, 30, 34, 38 Particles of light are called photos Each photo has a particular eergy E = h ƒ h is Plack s costat

More information

Intro to Scientific Computing: Solutions

Intro to Scientific Computing: Solutions Itro to Scietific Computig: Solutios Dr. David M. Goulet. How may steps does it take to separate 3 objects ito groups of 4? We start with 5 objects ad apply 3 steps of the algorithm to reduce the pile

More information

Orientation. Orientation 10/28/15

Orientation. Orientation 10/28/15 Orietatio Orietatio We will defie orietatio to mea a object s istataeous rotatioal cofiguratio Thik of it as the rotatioal equivalet of positio 1 Represetig Positios Cartesia coordiates (x,y,z) are a easy

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

1. SWITCHING FUNDAMENTALS

1. SWITCHING FUNDAMENTALS . SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

More information

How do we evaluate algorithms?

How do we evaluate algorithms? F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:

More information

K-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns

K-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns K-NET bus The K-Net bus is based o the SPI bus but it allows to addressig may differet turrets like the I 2 C bus. The K-Net is 6 a wires bus (4 for SPI wires ad 2 additioal wires for request ad ackowledge

More information

EE 435. Lecture 26. Data Converters. Architectures. Characterization

EE 435. Lecture 26. Data Converters. Architectures. Characterization EE 435 Lecture 26 Data Coverters Architectures Characterizatio . Review from last lecture. Data Coverters Types: A/D (Aalog to Digital) Coverts Aalog Iput to a Digital Output D/A (Digital to Aalog) Coverts

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters. SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that

More information

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

Outline. Applications of FFT in Communications. Fundamental FFT Algorithms. FFT Circuit Design Architectures. Conclusions

Outline. Applications of FFT in Communications. Fundamental FFT Algorithms. FFT Circuit Design Architectures. Conclusions FFT Circuit Desig Outlie Applicatios of FFT i Commuicatios Fudametal FFT Algorithms FFT Circuit Desig Architectures Coclusios DAB Receiver Tuer OFDM Demodulator Chael Decoder Mpeg Audio Decoder 56/5/ 4/48

More information

EE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control

EE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,

More information

APPLICATION NOTE. Automated Gain Flattening. 1. Experimental Setup. Scope and Overview

APPLICATION NOTE. Automated Gain Flattening. 1. Experimental Setup. Scope and Overview APPLICATION NOTE Automated Gai Flatteig Scope ad Overview A flat optical power spectrum is essetial for optical telecommuicatio sigals. This stems from a eed to balace the chael powers across large distaces.

More information

Math Section 2.2 Polynomial Functions

Math Section 2.2 Polynomial Functions Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably

More information

System Overview. Hardware Concept. s Introduction to the Features of MicroAutoBox t

System Overview. Hardware Concept. s Introduction to the Features of MicroAutoBox t s Itroductio to the Features of MicroAutoBox t System Overview Objective Where to go from here dspace provides the MicroAutoBox i differet variats. This sectio gives you a overview o the MicroAutoBox's

More information

Civil Engineering Computation

Civil Engineering Computation Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso

More information

Section 7.2: Direction Fields and Euler s Methods

Section 7.2: Direction Fields and Euler s Methods Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will

More information

Announcements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components

Announcements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components Aoucemets Readig Chapter 4 (4.1-4.2) Project #4 is o the web ote policy about project #3 missig compoets Homework #1 Due 11/6/01 Chapter 6: 4, 12, 24, 37 Midterm #2 11/8/01 i class 1 Project #4 otes IPv6Iit,

More information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful

More information

Quality of Service. Spring 2018 CS 438 Staff - University of Illinois 1

Quality of Service. Spring 2018 CS 438 Staff - University of Illinois 1 Quality of Service Sprig 2018 CS 438 Staff - Uiversity of Illiois 1 Quality of Service How good are late data ad lowthroughput chaels? It depeds o the applicatio. Do you care if... Your e-mail takes 1/2

More information

ELEG 5173L Digital Signal Processing Introduction to TMS320C6713 DSK

ELEG 5173L Digital Signal Processing Introduction to TMS320C6713 DSK Departmet of Electrical Egieerig Uiversity of Arasas ELEG 5173L Digital Sigal Processig Itroductio to TMS320C6713 DSK Dr. Jigia Wu wuj@uar.edu ANALOG V.S DIGITAL 2 Aalog sigal processig ASP Aalog sigal

More information

NTH, GEOMETRIC, AND TELESCOPING TEST

NTH, GEOMETRIC, AND TELESCOPING TEST NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few

More information

EE123 Digital Signal Processing

EE123 Digital Signal Processing Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add

More information

Fuzzy Membership Function Optimization for System Identification Using an Extended Kalman Filter

Fuzzy Membership Function Optimization for System Identification Using an Extended Kalman Filter Fuzzy Membership Fuctio Optimizatio for System Idetificatio Usig a Eteded Kalma Filter Srikira Kosaam ad Da Simo Clevelad State Uiversity NAFIPS Coferece Jue 4, 2006 Embedded Cotrol Systems Research Lab

More information

Normal Distributions

Normal Distributions Normal Distributios Stacey Hacock Look at these three differet data sets Each histogram is overlaid with a curve : A B C A) Weights (g) of ewly bor lab rat pups B) Mea aual temperatures ( F ) i A Arbor,

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

COMP 558 lecture 6 Sept. 27, 2010

COMP 558 lecture 6 Sept. 27, 2010 Radiometry We have discussed how light travels i straight lies through space. We would like to be able to talk about how bright differet light rays are. Imagie a thi cylidrical tube ad cosider the amout

More information

ECE4050 Data Structures and Algorithms. Lecture 6: Searching

ECE4050 Data Structures and Algorithms. Lecture 6: Searching ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated

More information

Learning to Shoot a Goal Lecture 8: Learning Models and Skills

Learning to Shoot a Goal Lecture 8: Learning Models and Skills Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.

More information

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000. 5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator

More information

Designing a learning system

Designing a learning system CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try

More information

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

More information

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4 1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:

More information

Filter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design

Filter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of

More information

Term Project Report. This component works to detect gesture from the patient as a sign of emergency message and send it to the emergency manager.

Term Project Report. This component works to detect gesture from the patient as a sign of emergency message and send it to the emergency manager. CS2310 Fial Project Loghao Li Term Project Report Itroductio I this project, I worked o expadig exercise 4. What I focused o is makig the real gesture recogizig sesor ad desig proper gestures ad recogizig

More information

Quantitative Analysis to the Impacts of IMU Quality in GPS/INS Deep Integration

Quantitative Analysis to the Impacts of IMU Quality in GPS/INS Deep Integration Micromachie 5, 6, 8-99; doi:.339/mi688 Article OP ACCSS micromachie ISS 7-666X www.mdpi.com/joural/micromachie Quatitative Aalyi to the Impact of IMU Quality i GPS/IS Deep Itegratio Xiaoji iu, Yalog Ba,

More information

Avid Interplay Bundle

Avid Interplay Bundle Avid Iterplay Budle Versio 2.5 Cofigurator ReadMe Overview This documet provides a overview of Iterplay Budle v2.5 ad describes how to ru the Iterplay Budle cofiguratio tool. Iterplay Budle v2.5 refers

More information

Physics 11b Lecture #19

Physics 11b Lecture #19 Physics b Lecture #9 Geometrical Optics S&J Chapter 34, 35 What We Did Last Time Itesity (power/area) of EM waves is give by the Poytig vector See slide #5 of Lecture #8 for a summary EM waves are produced

More information

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION 397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio

More information

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms

More information

Lower Bounds for Sorting

Lower Bounds for Sorting Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig

More information

Computers and Scientific Thinking

Computers and Scientific Thinking Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput

More information

1 Graph Sparsfication

1 Graph Sparsfication CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider

More information

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 ) EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

Computational Geometry

Computational Geometry Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed

More information

Fuzzy C-Means Clustering of Web Users for Educational Sites

Fuzzy C-Means Clustering of Web Users for Educational Sites Fuzzy C-Mea Cluterig of Web Uer for Educatioal Site Pawa Ligra, Rui Ya, ad Chad Wet Departmet of Mathematic ad Computig Sciece Sait Mary' Uiverity, Halifax, Nova Scotia, Caada, B3H 3C3 Abtract. Characterizatio

More information

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical

More information

How to Select the Best Refractive Index

How to Select the Best Refractive Index How to Select the Best Refractive Idex Jeffrey Bodycomb, Ph.D. HORIBA Scietific www.horiba.com/us/particle 2013HORIBA, Ltd. All rights reserved. Outlie Laser Diffractio Calculatios Importace of Refractive

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

Data diverse software fault tolerance techniques

Data diverse software fault tolerance techniques Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

Parabolic Path to a Best Best-Fit Line:

Parabolic Path to a Best Best-Fit Line: Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be

More information

FURTHER INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)

FURTHER INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS) Mathematics Revisio Guides More Trigoometric ad Log Itegrals Page of 7 MK HOME TUITION Mathematics Revisio Guides Level: AS / A Level AQA : C Edexcel: C OCR: C OCR MEI: C FURTHER INTEGRATION TECHNIQUES

More information

Message Integrity and Hash Functions. TELE3119: Week4

Message Integrity and Hash Functions. TELE3119: Week4 Message Itegrity ad Hash Fuctios TELE3119: Week4 Outlie Message Itegrity Hash fuctios ad applicatios Hash Structure Popular Hash fuctios 4-2 Message Itegrity Goal: itegrity (ot secrecy) Allows commuicatig

More information

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used

More information

The number n of subintervals times the length h of subintervals gives length of interval (b-a).

The number n of subintervals times the length h of subintervals gives length of interval (b-a). Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's

More information

Reliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1

Reliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1 Reliable Trasmissio Sprig 2018 CS 438 Staff - Uiversity of Illiois 1 Reliable Trasmissio Hello! My computer s ame is Alice. Alice Bob Hello! Alice. Sprig 2018 CS 438 Staff - Uiversity of Illiois 2 Reliable

More information

CMPT 125 Assignment 2 Solutions

CMPT 125 Assignment 2 Solutions CMPT 25 Assigmet 2 Solutios Questio (20 marks total) a) Let s cosider a iteger array of size 0. (0 marks, each part is 2 marks) it a[0]; I. How would you assig a poiter, called pa, to store the address

More information

Spectral leakage and windowing

Spectral leakage and windowing EEL33: Discrete-Time Sigals ad Systems Spectral leakage ad widowig. Itroductio Spectral leakage ad widowig I these otes, we itroduce the idea of widowig for reducig the effects of spectral leakage, ad

More information

EE 505. CMOS and BiCMOS Data Conversion Circuits

EE 505. CMOS and BiCMOS Data Conversion Circuits EE 505 CMOS ad BiCMOS Data Coversio Circuits Course Iformatio: Lecture Istructor: Rady Geiger 2133 Coover Voice: 294-7745 e-mail: rlgeiger@iastate.edu WEB: www.radygeiger.org Laboratory Istructor: TBD

More information

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics

More information

Apparent Depth. B' l'

Apparent Depth. B' l' REFRACTION by PLANE SURFACES Apparet Depth Suppose we have a object B i a medium of idex which is viewed from a medium of idex '. If '

More information

One advantage that SONAR has over any other music-sequencing product I ve worked

One advantage that SONAR has over any other music-sequencing product I ve worked *gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig

More information

Fast Fourier Transform (FFT) Algorithms

Fast Fourier Transform (FFT) Algorithms Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform

More information

Ch 9.3 Geometric Sequences and Series Lessons

Ch 9.3 Geometric Sequences and Series Lessons Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric

More information

Image Segmentation EEE 508

Image Segmentation EEE 508 Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.

More information

ICS Regent. Communications Modules. Module Operation. RS-232, RS-422 and RS-485 (T3150A) PD-6002

ICS Regent. Communications Modules. Module Operation. RS-232, RS-422 and RS-485 (T3150A) PD-6002 ICS Reget Commuicatios Modules RS-232, RS-422 ad RS-485 (T3150A) Issue 1, March, 06 Commuicatios modules provide a serial commuicatios iterface betwee the cotroller ad exteral equipmet. Commuicatios modules

More information

Project 2.5 Improved Euler Implementation

Project 2.5 Improved Euler Implementation Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,

More information

Vision & Perception. Simple model: simple reflectance/illumination model. image: x(n 1,n 2 )=i(n 1,n 2 )r(n 1,n 2 ) 0 < r(n 1,n 2 ) < 1

Vision & Perception. Simple model: simple reflectance/illumination model. image: x(n 1,n 2 )=i(n 1,n 2 )r(n 1,n 2 ) 0 < r(n 1,n 2 ) < 1 Visio & Perceptio Simple model: simple reflectace/illumiatio model Eye illumiatio source i( 1, 2 ) image: x( 1, 2 )=i( 1, 2 )r( 1, 2 ) reflectace term r( 1, 2 ) where 0 < i( 1, 2 ) < 0 < r( 1, 2 ) < 1

More information

AP B mirrors and lenses websheet 23.2

AP B mirrors and lenses websheet 23.2 Name: Class: _ Date: _ ID: A AP B mirrors ad leses websheet 232 Multiple Choice Idetify the choice that best completes the statemet or aswers the questio 1 The of light ca chage whe light is refracted

More information

Security of Bluetooth: An overview of Bluetooth Security

Security of Bluetooth: An overview of Bluetooth Security Versio 2 Security of Bluetooth: A overview of Bluetooth Security Marjaaa Träskbäck Departmet of Electrical ad Commuicatios Egieerig mtraskba@cc.hut.fi 52655H ABSTRACT The purpose of this paper is to give

More information

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure

More information

Data Structures and Algorithms. Analysis of Algorithms

Data Structures and Algorithms. Analysis of Algorithms Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output

More information

SAMPLE VERSUS POPULATION. Population - consists of all possible measurements that can be made on a particular item or procedure.

SAMPLE VERSUS POPULATION. Population - consists of all possible measurements that can be made on a particular item or procedure. SAMPLE VERSUS POPULATION Populatio - cosists of all possible measuremets that ca be made o a particular item or procedure. Ofte a populatio has a ifiite umber of data elemets Geerally expese to determie

More information

Math 10C Long Range Plans

Math 10C Long Range Plans Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will

More information