Discrete-Time Signal Processing
|
|
- Gordon Park
- 5 years ago
- Views:
Transcription
1 Discrt-Tim Signal Procssing Hnry D. Pfistr March 3, 07 Th Discrt-Tim Fourir Transform. Dfinition Th discrt-tim Fourir transform DTFT) maps an apriodic discrt-tim signal x[n] to th frquncy-domain function X jω ) F {x[n]}. Likwis, w writ x[n] F { X jω ) }. F Th DTFT pair x[n] X jω ) satisfis: x[n] X jω ) jωn dω π π X jω ) x[n] jωn synthsis quation) analysis quation) Rmarks: Not that jω+π)n jωn jπn jωn for any intgr n. So, in th synthsis quation, rprsnts intgration ovr any π intrval [a, a + π) of lngth π. On th othr hand, x[n] is assumd to b apriodic, so th summation in th analysis quation is ovr all n. Thus, th DTFT X jω ) is always priodic with priod π. Th frquncy rspons of a DT LTI systm with unit impuls rspons h[n] H jω ) h[n] jωn is prcisly th DTFT of h[n], so th rspons y[n] that corrsponds to th input x[n] jωn is givn by y[n] H jω ) jωn.
2 Convrgnc. If x[n] is absolutly summabl, i.., x[n] < thn X jω ) is wll-dfind i.., finit) for all Ω R. Thus, thr is a uniqu X jω ) for ach absolutly summabl x[n]. Invrsion. If X jω ) is th DTFT of an absolutly summabl DT signal x[n], thn X jω ) jωn dω ) x[m] jωm jωn dω π π π π m x[m] jωn m) dω π m π }{{} πδ[n m] x[m]δ[n m] m x[n]. Thus, thr is a on-to-on corrspondnc btwn an absolutly summabl x[n] and its DTFT X jω ). Priodic Signals. For a priodic DT signal, x[n] x[n + N], lt a k b th discrt-tim Fourir sris cofficints a k N N n0 x[n] jkω 0n, whr Ω 0 π/n. Thn, th DTFT consists is a sum of Dirac dlta functions:. DTFT Exampls X jω ) π k a k δω kω 0 ). Thr ar a fw important DTFT pairs that ar usd rgularly. Exampl. Considr th discrt-tim rctangular puls x[n] M δ[n k]. k0
3 Th DTFT of this signal is givn by X jω ) M k0 x[n] jωn jωn jωm+) jω jωm+)/ jωm+)/ ) jωm+)/ jω/ jω/ ) jω/ sinωm + )/) jωm/. sinω/) Th first trm is th discrt-tim analog of th sinc function and th scond trm is th phas shift associatd with th fact that th puls is not cntrd about n 0. If M is vn, w can advanc th pul by M/ sampls to rmov this trm. Exampl. An idal discrt-tim low-pass filtr passing Ω < Ω c π has th DTFT frquncy-rspons { H jω if Ω < Ω c ) 0 if Ω c < Ω π. Thus, th invrs DTFT implis that h[n] H jω ) jωn dω π π Ωc jωn dω π Ω c [ ] jωn Ω c πjn Ω c πn sinω cn). This impuls rspons is not absolutly summabl du to th discontinuity in H jω ). To undrstand th DTFT in this cas, lt H M jω ) b th frquncy rspons of th truncatd impuls rspons { h[n] if n M h M [n] 0 if n > M. Du to th Gibb s phnomnon, H M jω ) dos not convrg uniformly to H jω ). But, sinc h[n] <, th frquncy rspons instad convrgs in th man-squar sns π lim H jω ) H M jω ) dω 0. M π 3
4 .3 Proprtis of th DTFT Th canonical proprtis of th DTFT ar vry similar to th canonical proprtis of th F continuous-tim Fourir transform CTFS). For x[n] X jω F ) and y[n] Y jω ), w obsrv that: ) Linarity: ax[n] + by[n] ) Tim shift: x[n n 0 ] 3) Frquncy shift: jω 0n x[n] 4) Conjugation: x [n] 5) Tim flip: x[ n] 6) Convolution: x[n] y[n] 7) Multiplication: x[n]y[n] 8) Symmtry: F ax jω ) + by jω ) F jωn 0 X jω ) F X jω Ω 0) ) F X jω ) F X jω) F X jω )Y jω ) F X jω ) Y jω ) π π Xjθ )Y jω θ) )dθ x[n] ral R{X jω )} vn, Im{X jω )} odd, X jω ) vn, X jω ) odd x[n] ral & vn X jω ) ral & vn x[n] ral & odd X jω ) pur imaginary & odd 9) Parsval s rlation: x[n] X jω ) dω π π.4 Frquncy-Domain Charactrization of DT LTI Systms Th tim-domain charactrization of DT LTI systms is givn by y[n] x[n] h[n], whr h[n] is th unit impuls rspons of th systm. Taking th DTFT of this quation givs th frquncy-domain charactrization of DT LTI systms, Y jω ) X jω )H jω ). Th DTFT, H jω ), of h[n] is calld th frquncy rspons of th systm. 4
5 .5 Spctral Dnsity For an nrgy-typ signal x[n], th nrgy spctral dnsity is dfind to b R xx jω ) X jω ). This notation is usd bcaus R xx jω ) is th DTFT of th autocorrlation signal r xx [l]. To s this, w first not that r xx [l] x[n] y[n] for y[n] x [ n]. Thn, th convolution thorm implis that R xx jω ) F {x[n]} F {x [ n]} X jω )X jω ) X jω ). For a powr-typ signal.g., a priodic signal), on considrs a squnc in M) of normalizd nrgy spctral dnsitis for th windowd signals x M [n] x[n]w[n] with w[n] u[n + M] u[n M + ]. Using this, th powr spctral dnsity is dfind to b R xx jω ) lim XM jω ) M M + lim M M + F {x M[n]} F {x M[ n]} M+min0,l) lim F x[n]x [n l] M M + n M+max0,l) M+min0,l) F lim x[n]x [n l] M M + n M+max0,l) { } M F lim x[n]x [n l] M M + F {r xx [l]}, n M whr r xx [l] is th tim-avrag autocorrlation function of x[n]. Th oprational maning of ths dfinitions is that th total nrgy or powr) signal nrgy containd in th frquncy band [Ω, Ω ] is givn by E [Ω,Ω ] π whr th π scal factor is chosn so that E [ π,π] π π π Ω Ω R xx jω )dω π R xx jω )dω, π π X jω ) dω x[n] follows from Parsval s rlation. If th signal is ral, thn conjugat symmtry implis that R xx jω ) R xx jω ). Thus, on typically assums 0 Ω Ω π and says th total nrgy in th positiv frquncy band [Ω, Ω ] is E E [ Ω, Ω ] + E [Ω,Ω ] E [Ω,Ω ]. Thus, on must b carful to distinguish btwn ths two convntions. 5
6 .6 Th Discrt Fourir Transform Th DTFT maps a discrt-tim signal x[n] to a continuous but priodic) frquncy domain X jω ). Th discrt Fourir transform DFT) of lngth-n maps a discrt-tim squnc x[n] supportd on 0 n N ) to a discrt st of frquncis X[k] supportd on 0 k N ) using th rul X[k] N n0 x[n] πjkn/n. It is asy to vrify that th invrs DFT is givn by x[n] N N k0 X[k] πjkn/n. This DFT is closly rlatd to computing valus of th DTFT on a rgularly spacd grid. For xampl, lt Ω k πk and obsrv that N X[k] X πjk/n ) X jω k ). If th DT signal x[n] is priodic, thn this transform ariss naturally bcaus th DTFT consists of Dirac dlta functions supportd on a discrt st of harmonic frquncis Ω k πk N for k 0,,..., N. For ral signals, conjugat symmtry i.., X[k] X [N k]) implis that th signal information is containd compltly in th first N + )/ valus of X[k]. Th output X[k 0 ] is calld th DFT for frquncy bin k 0 bcaus th DFT can b sn to transform N tim-domain sampls into N frquncy-domain sampls. Morovr, this transform is unitary xcpt for an ovrall scal factor) and prsrvs th nrgy in th sns that E x N n0 N n0 N N x[n] N N i0 N N ) X[i] πjin/n N X [i]x[k] N i0 k0 N N N n0 X [i]x[k]δ[k i] i0 k0 N X[k]. N k0 N k0 πjk i)n/n X[k] πjkn/n ) Thus, th DFT dcomposs th signal nrgy E x into N frquncy bins that xpos th signal s nrgy distribution ovr frquncy. 6
7 For a short duration signal x[n] supportd on 0 n M ), on can comput th DFT on a dnsr st of frquncis by zro padding th signal up to lngth N > M. In practic, this computation can b don quickly by zro padding th squnc up to a powr of lngth N m and applying th fast Fourir transform FFT). On can also us th DFT to numrically approximat th nrgy or powr) spctral dnsity of a DT signal x[n]. Using a lngth-n DFT, th ida is to approximat th intgrals in th prvious sction. For th nrgy spctral dnsity, on gts E [Ω,Ω ] N Ω N/π) k Ω N/π) X[k] and an additional scal factor of /N is usd for th powr spctral dnsity. FIR Filtr Dsign via th Window Mthod As w saw in th last sction, th impuls rspons of an idal DT low-pass filtr can b computd in closd form. This filtr cannot b implmntd, howvr, bcaus its impuls rspons xtnds to n. To fix this, on can truncat impuls rspons to gt h M [n] { sinω πn cn) if n M 0 if n > M. To undrstand th ffct of this truncation, w rwrit this as h M [n] πn sinω cn)v M [n], whr v M [n] M k M δ[n k]. From this, w obsrv that th frquncy rspons is givn by H M jω ) H jω ) V M jω ). From th DTFT xampls, it is asy to s that V M jω ) sinωm + )/). sinω/) Th portion of this function satisfying Ω Ω 0 π/m + ) is calld th main lob of th window rspons. Th sction from Ω 0 Ω Ω 0 is calld th first sidlob of th window rspons. This figur shows th rspons for two M valus. 7
8 80 60 M 0 M 40 VM jω ) Ω In th window mthod of filtr dsign, th main lob of th window smars th cutoff frquncy into a transition band whos width approximatly quals th width of th window s main lob. Likwis, th hight of th first sid lob typically limits th stop-band rjction. Choosing th window function to optimiz this trad-off is known as th window mthod of filtr dsign. If dlay and complxity ar not a problm, on can always choos a long nough window so that th rror is quit small. To achiv bttr stop-band rjction, on nds to choos a smoothr window function. For xampl, th Hann window function w[n] πn )) + cos M for n M, M +,..., M) provids rasonabl prformanc. For th Hann window, this filtr dsign mthod is implmntd by th MATLAB function hfir*m,wc/pi,hann*m+)). 3 From Discrt Tim to Continuous Tim Th procss of filling in th signal wavform btwn sampl points is calld intrpolation. From a purly discrt-tim prspctiv, th procss of intrpolation consists of dsigning a filtr that rsults in a non-intgr tim dlay. Exampl 3. An idal dlay of n 0 sampls maps jωn to jωn n 0). Thus, it can b rprsntd by an LTI systm whos DTFT frquncy rspons is H jπk+ω)) jωn 0, 8
9 for Ω π, π] and intgr k. From this, th invrs DTFT implis that h[n] H jω ) jωn dω π π π π π πjn n 0 ) jωn 0 jωn dω sinπn n 0)). πn n 0 ) [ jωn n 0 ) ] π Sinc y[n] x[n] h[n] implis that y[0] is qual to th signal valu at tim t n 0, th gnral intrpolation formula is givn by sinπn t)) xt) x[n]. πn t) In practic, on nds to window this filtr to mak its duration finit. Th sam intrpolation formula can also b drivd as th rsult of filtring th CT signal xt) k x[k]δt k) with th idal CT low-pass filtr ht) π π 4 Sampl Rat Convrsion π jωt sinπt). πt To achiv sampl rat convrsion by a rational factor R L/M, th dirct approach is to upsampl by L, filtr, and thn downsampl by M. Th complxity of this approach can b quit high and thr ar a varity of ways to rduc th complxity. Exampl 4 Upsampling by L). Considr th signal { x[n/l] if L divids n y[n] 0 othrwis, whr y[n] is formd by insrting L zros btwn ach sampl of x[n]. Th DTFT of y[n] is givn by Y jω ) y[n] jωn X jlω ). y[nl] jωnl x[n] LjΩn π 9
10 Sinc X jω ) is priodic with priod π, th DTFT of Y jω ) is priodic with priod π/l and it contains L aliasd copis or imags) of X jω ). Passing y[n] through an idal low-pass filtr with cutoff frquncy Ω c π/l lavs only a singl low-pass vrsion and rmovs th xtra imags. Th rsult is a signal with th sam frquncy contnt as x[n] but sampld L tims fastr. Exampl 5 Downsampling by M). Considr th signal y[n] x[nm] whr y[n] is formd by taking only vry M-th sampl. In th frquncy domain, this opration is bst undrstood as th combination of two stps. First, w lt v[n] k δ[n km] and dfin z[n] x[n]v[n]. Thn, w lt y[n] z[nm]. Sinc th DTFT tabl shows that V jω ) π δ Ω πk ), M M k th ffct of th first stp in th frquncy domain is givn by Z jω ) X jω ) V jω ) M M k0 X jω πk/m)). From this, w s that th DTFT Z jω ) is priodic with priod π/m. Nxt, w s that th DTFT of y[n] z[nm] is givn by Y jω ) y[n] jωn Thus, w find that Y jω ) M Z jω/m ). M k0 z[nm] jωnm/m z[n] jω/m)n X jω/m πk/m)). Finally, if X jω ) 0 for π M Ω π, thn Y jω ) M XjΩ/M ). 5 Th Z-Transform 5. Introduction Th Z-transform is a gnralization of th discrt-tim Fourir transform DTFT) that can b applid to a largr class of signals. It is also th discrt-tim analog of th Laplac 0
11 transform. For a DT signal x[n], th Z-transform Xz) Z {x[n]} is dfind by Xz) x[n]z n. Th rgion of convrgnc ROC) for a signal x[n] is th st of complx) z-valus for which th sum is absolutly convrgnt { } R {x[n]} z C x[n]z n <. Z Th rlationship btwn x[n] and Xz) is dnotd by x[n] Xz). Ignoring th ROC, th Z-transform can b sn as a gnralization of th DTFT bcaus choosing z jw rcovrs th dfinition of th DTFT. Lt x[n] b a finit-duration signal whr x[n] 0 for n < n and n > n. Thn, Xz) n nn x[n]z n and z n Xz ) is a polynomial. Considr th cas of x[n] {, 3,, 4, 7}, whr th undrlin dnots th location associatd with tim n 0. In this cas, w hav Xz) z + 3z + + 4z + 7z and th ROC is 0 < z <. From this, w s that th Z-transform simply uss th powr of th indtrminat, z, to kp track of th tim indx associatd with a signal valu. This rprsntation is particularly usful for convolution bcaus ) Z {h[n] x[n]} h[k]x[n k] z n k k h[k]z k Hz)Xz). x[n k]z n+k Exampl 6. Lt h[n] {, 0, }and obsrv that Hz) z z. Thus, Z {h[n] x[n]} Hz)Xz). z z ) z + 3z + + 4z + 7z ) z 3 + 3z + z z ) z z + 4z + 7z 3) z 3 + 3z + z + + 5z 4z 7z 3. Thus, it is asy to s that h[n] x[n] {, 3,,, 5, 4, 7}.
12 5. Th Rgion of Convrgnc To undrstand th importanc of th ROC, w considr two simpl xampls. Exampl 7. Considr th signal x[n] a n u[n] whos Z-transform is givn by Xz) a n z n n0 a n u[n]z n, if z > a. az Th last stp follows from th gomtric sum formula and th ROC is z > a. Exampl 8. Considr th signal x[n] a n u[ n ] whos Z-transform is givn by Xz) a z a n u[ n ]z n a n z n a n z n n0 a z, if z < a a z, if z < a. az Although th signals in ths two xampls ar quit diffrnt, th only diffrnc btwn thir Z-transforms is th ROC. Thus, if on ignors th ROC, thn thr ar multipl signals with th sam Z-transform. Exampl 9. Considr th signal x[n] a n u[n] + b n u[ n ]. By linarity, w can comput th Z-transform using th two prvious xampls and w gt Xz) az, if a < z < b. bz In this cas, th ROC is mpty if b a and is a donut shapd rgion othrwis. Dfinition 0. A signal x[n] is right-sidd if thr is an n 0 such that x[n] 0 for all n < n 0. For this n 0, it follows that th shiftd signal y[n] x[n + n 0 ] is causal. Similarly, a signal is lft-sidd if thr is an n 0 such that x[n] 0 for all n > n 0. Any signal that is nithr right-sidd nor lft-sidd is calld two-sidd.
13 Th ROC of a right-sidd squnc is of th form z > r for som r [0, ]. Similarly, th ROC of a lft-sidd squnc is of th form z < r for som r [0, ]. In gnral, th ROC of a two-sidd squnc is of th form r < z < r for som r, r [0, ]. This matchs xactly what w saw in th prvious xampls. 5.3 Block Diagrams 5.4 Proprtis of th Z-Transform Th following proprtis of th Z-transform ar analogous to similar proprtis of th DTFT: ) Linarity: ax[n] + by[n] ) Tim shift: x[n n 0 ] 3) Frquncy shift: a n x[n] 4) Conjugation: x [n] 5) Tim flip: x[ n] 6) Convolution: x[n] y[n] 7) Diffrntiation: n x[n] Z axz) + by z), ROC givn by intrsction Z z n 0 Xz), ROC unchangd xcpt possibly {0, } Z Xa z), nw ROC is a r < z < a r Z X z ), ROC unchangd Z X z ), nw ROC /r < z < /r Z Xz)Y z), ROC includs intrsction Z z d Xz), ROC unchangd dz In gnral, th invrs of th Z-transform can b computd using a contour intgral. In practic, on typically uss partial fraction xpansion to obtain a sum of simpl trms and thn tabl lookup is usd to invrt ach trm. 6 Filtr Implmntation 6. Block Diagrams x[n] b 0 + v[n] v[n] + y[n] z z b a Considr th systm y[n] b 0 x[n] + b x[n ] a y[n ] and notic that it can b implmntd as th cascad of th block diagrams shown abov: 3
14 v[n] b 0 x[n] + b x[n ] y[n] a y[n ] + v[n]. Taking th Z-transform of ths systms, on gts Ths can b rwrittn as V z) b 0 Xz) + b Xz)z Y z) a Y z)z V z). V z) b 0 + b z )Xz) V z) a 0 + a z )Y z), with a 0. Thus, th Z-transform of th impuls rspons is givn by Hz) Y z) Xz) b 0 + b z Bz) a 0 + a z Az) and it is a rational function of z. Currntly, this systm rquirs two dlays. Can it b implmntd with only on dlay? 6. Rational Z-Transforms Th signals with rational Z-transforms, Hz) Bz) Az) b[0] + b[]z + + b[m]z M a[0] + a[]z + + a[n]z N, ar a vry important class of signals. If w factor th numrator and dnominator, thn w can rwrit this as Hz) b[0] M a[0] zn M k z z k) N k z p k), whr z,..., z M ar th zros of Bz) and p,..., p N ar th zros of Az) i.., th pols of /Az)). It is worth noting that, up to an ovrall constant, th magnitud of th frquncy rspons H jω ) b[0] a[0] M k jω z k N k jω p k has a graphical intrprtation as th product of th distancs from jω to th zros dividd by th product of th distancs from jω to th pols. Th pol-zro rprsntation of a Z-transform, Hz), is particularly usful whn th signal h[n] is th impuls rspons of a filtr. This is bcaus th zros idntify th signals.g., of th form x[n] zk n ) that ar mappd to th zro signal and th pols idntify th signals.g., of th form x[n] p n k ) that xprinc infinit gain. 4
15 Exampl. Considr x[n] a n u[n] shows that has zro at z 0 and a pol at p a. Z Xz) az. Th pol-zro dcomposition Xz) z 0) z a) Exampl. Considr a finit impuls rspons FIR) filtr dfind by y[n] M b[k]x[n k]. k0 Thus, th output satisfis Y z) k0 y[n]z n M b[k]z k k0 Bz)Xz), M b[k]x[n k]z n x[n k]z n+k whr Bz) z M M k z z k) is a filtr with M zros and M trivial pols at z 0. Exampl 3. Considr an all-pol filtr dfind by y[n] x[n] N a[k]y[n k]. k Similarly, th output satisfis Y z) Xz)/Az) whr /Az) / z ) N N k z p k) is a filtr with N pols and N trivial zros at z 0. Exampl 4. Considr th linar constant-cofficint diffrnc quation LCCDE) dfind by N M a[k]y[n k] b[k]x[n k]. k0 In this cas, th Z-transform Az)Y z) Bz)Xz) implis that Hz) Y z)/xz) Bz)/Az) has a rational Z-transform. W not that solving an LCCDE using th Z- transform implicitly assums that th systm was initially at rst. k0 5
16 Exampl 5. Dtrmin th impuls rspons of Th Z-transform implis that y[n] y[n ] + x[n]. Hz) Y z) Xz) z. Basd on our prvious calculations, this implis that ) n h[n] u[n]. 6.3 Undrstanding Filtrs via Pol-Zro Plots A filtr, h[n], with a rational Z-transform, Hz), is compltly dfind by th locations of its pols and zros in th complx plan. A pol-zro plot shows ths locations in th complx plan with zros rprsntd by circls and pols ar rprsntd by x s. If thr is a zro at som location z, thn th filtr maps th input signal, x[n] z n, mappd to th zro signal. If thr is a pol at som point z, thn th filtr maps th input signal, x[n] z n, to an unboundd output and th ROC dos not includ z. Sinc y[n] Hz)x[n] for x[n] z n, w s that th unit circl corrsponds to z and x[n] jωn for som ω [ π, π]. For z insid th unit circl i.., z < ), th signal x[n] is dcaying xponntially in n whil, z outsid th unit circl i.., z > ), th signal x[n] is growing xponntially in n. Rcall that a filtr, h[n], is boundd-input boundd-output BIBO) stabl iff h[n]. From th dfinition of th ROC, it follows that h[n] is BIBO stabl iff only th ROC of its Z-transform, Hz), includs z. Thus, for a right-sidd BIBO-stabl filtr, this implis th ROC must includ z and th Z-transform must hav all its pols insid th unit circl. 6.4 First-Ordr FIR Filtrs Considr a first-ordr FIR filtr dfind by th input-output rlationship y[n] b 0 x[n] + b x[n ], whr b 0, b ar ral cofficints. It has a zro at z b /b 0 and a pol at z 0. Th magnitud of th frquncy rspons satisfis H jω ) b 0 + b jω) b 0 + b jω) b 0 + b 0 b cosω) + b. ) 6
17 To gt a low-pass filtr, on can rquir unity gain at DC i.., H jω) if Ω 0) and zro gain at Nyquist i.., H jω) 0 if Ω π). Ths quations imply that Thus, w find that b 0 b and b 0 + b b 0 b 0. ) HLP jω + cosω). To gt a high-pass filtr, on can rquir unity gain at Nyquist i.., H jω) if Ω π) and zro gain at DC i.., H jω) 0 if Ω 0). Ths quations imply that Thus, w find that b 0, b, and 6.5 First-Ordr IIR Filtrs b 0 b b 0 + b 0. ) HHP jω cosω). Considr th first-ordr FIR filtr dfind by th input-output rlationship y[n] b 0 x[n] + b x[n ] a y[n ], whr b 0, b, a ar ral cofficints. It has a zro at z b /b 0 and a pol at z a. From ), w s that th magnitud of th frquncy rspons satisfis ) H jω b 0 + b 0 b cosω) + b. + a cosω) + a To gt a low-pass filtr, on can rquir unity gain at DC i.., H jω) if Ω 0) and zro gain at Nyquist i.., H jω) 0 if Ω π). Ths quations imply that b 0 + b + a b 0 b a 0. Thus, w find that b 0 b +a and th magnitud of th frquncy rspons satisfis H ) ) LP jω + a + cosω). ) + a cosω) + a 7
18 To dtrmin a, a standard approach is to dfin th cutoff frquncy Ω 0 whr HLP jω 0 ). Using th quadratic formula to solv for a, on can show that a sinω 0). cosω 0 ) To vrify this, on can start with ), us th abov formula for a and substitut Ω Ω 0. Th following figur shows an xampl with Ω 0 tan 3/4) 0.π whr a implis b 0 b Im{z} 0 H jω ) R{z} Normalizd Frquncy f Ω/π To dsign a high-pass filtr, a similar argumnt shows that b 0 a, b a, and 6.6 All-Pass Filtrs a sinω 0). cosω 0 ) Anothr typ of filtr is an all-pass filtr. By dfinition, an all-pass filtr must satisfy H jω ) for all ral Ω. For a filtr with a rational Z-transform, a sufficint condition is that N M and Bz) z N A z ) bcaus this implis that ) H jω B jω) B jω) B jω) A jω ) A jω ) A jω ) jωn A ) jω jωn A jω). A jω ) A jω ) Th gnral form of a first-ordr all-pass filtr is givn by y[n] a x[n] x[n ] a y[n ], 8
19 whr a is a complx cofficint. Highr ordr all-pass filtrs can b implmntd by cascading first ordr sctions. Th Z-transform is givn by H AP z) a + z + a z and w obsrv that th filtr has a zro at z /a and a pol at z a. Now, w can comput th phas rspons, H AP jω ), using H AP jω ) arg a + jω ) + a jω ) ) arg a + jω ) + a jω ) ) arg R{a } + jω + a jω) atan a ) sinω), R{a } + a + ) cosω) ). Thus, th phas rangs from 0 at Ω 0 to π at Ω π. Th following figur shows an xampl pol-zro diagram and phas rspons for th cas of a 0.5. Im{z} 0 HAP jω ) dgrs) R{z} Normalizd Frquncy f Ω/π All-pass filtrs can also b usd to dsign low-pass and high-pass) filtrs. For th low-pass cas, th ida is to implmnt a filtr with Z-transform Hz) + H AP z)). Frquncis whr H AP jω ) 0 will hav a magnitud rspons clos to whil frquncis whr H AP jω ) ±π will hav a magnitud rspons clos to 0. Basd on this, th cutoff frquncy Ω 0 of an all-pass filtr is typically dfind by H AP jω 0 ) π/. In audio procssing, thr is a common block, calld a low-pass) shlving filtr, that has th Z-transform H S z) + H 0 + H AP z)). 9
20 In this cas, frquncis whr H AP jω ) 0 will hav a magnitud rspons clos to + H 0 whil frquncis whr H AP jω ) ±π will hav a magnitud rspons clos to. Choosing H 0 > givs a filtr that amplifis low frquncis. Choosing H 0 givs a filtr that attntuats low frquncis. 6.7 Notch Filtrs Notch filtrs ar band-stop filtrs with a vry narrow stop band. For xampl, analog notch filtrs ar commonly usd to rmov th 60 Hz hum from audio amplifirs that can lak into audio systms from th powr supply. In trms of th pol-zro diagram, on can dsign a digital FIR notch filtr that maps x[n] cosω 0 n + φ) to zro by placing filtr zros at z ±jω Im{z} 0 H jω ) R{z} Normalizd Frquncy f Ω/π For xampl, th first plot in th abov figur shows th pol-zro diagram of th filtr H z) z z j/ )z j/ ) cos )z + z, with zros at ±j/ and two pols at 0. Th frquncy rspons of this filtr is givn by H jω ) jω jω cos ) + jω ) cosω) cos ))jω. Th scond plot shows th magnitud of this rspons. Notic that th rspons at Ω is zro. Th main problm with FIR notch filtrs is that th rspons is vry flat in th pass band. This problm can b rctifid by dsigning an IIR notch filtr that includs pols that ar clos to th zros.g., at z r ±jω 0 for som r < ). For th input signal x[n] cosωn+φ) whr Ω is not too clos to Ω 0, ths pols cancl th ffct of th zros. 0
21 0 Im{z} 0 H jω ) R{z} Normalizd Frquncy f Ω/π Th first plot in th abov figur show th pol-zro plot of th filtr H z) z z j/ )z j/ ) z z 3 4 j/ )z 3 4 j/ ) cos )z + z 3 cos )z + 9, 6 z with zros at ±j/ and pols at 3 4 ±j/. Th magnitud-squard frquncy rspons of this filtr is givn by H jω ) cosω) cos )) jω 3 cos ) jω jω ) 3 cos )jω jω ) 4 cosω) cos )) cos ) cos 8 ) cosω) + cosω) Th scond plot in th abov figur shows th magnitud of th frquncy rspons. Notic that th rspons at Ω is still zro but matching th zros with pols maks th ovrall rspons much flattr. On can also dsign digital IIR notch filtrs by first dsigning an optimal analog notch filtr and thn transforming it into th digital domain via th bilinar transform. In this class, w will not covr this mthod. But, that is th approach takn by th MATLAB function iirnotch. 6.8 Gnral Scond-Ordr IIR Filtrs Considr th scond-ordr FIR filtr dfind by th input-output rlationship y[n] b 0 x[n] + b x[n ] + b x[n ] a y[n ] a y[n ], whr b 0, b, b, a, a ar ral cofficints. Such a filtr will hav two pols and two zros. Sinc th cofficints ar ral, th zros and pols) will ithr b ral or will appar in
22 complx conjugat pairs. A littl algbra shows that th magnitud of th frquncy rspons satisfis H jω ) b 0 + b + b + b b 0 + b ) cosω) + b 0 b cosω) + a + a + a + a ) cosω) + a cosω). Howvr, th dirct dsign of digital IIR filtrs with ordr gratr than on can b somwhat cumbrsom. Instad, on typically starts with th Laplac transform H c s) of an optimal continuous-tim filtr.g., Chbyshv, Buttrworth, Elliptical) and maps it to th Z-transform Hz) of a digital filtr using th bilinar transform s T z )/ + z ). Thus, th Z-transform of th digital filtr is givn by ) z Hz) H c, T + z whr T is a paramtr with units sconds pr sampl that can b viwd as th sampling rat associatd with this convrsion. A ky proprty of this transform is that it prsrvs th ordr of th filtr. Stting z jω and s jω, w s that jω T z )/ + z ) j tanω/)/t. Thus, th discrt-tim filtr xprincs th frquncy-domain rmapping Ω tan T ω/) of th continuous-tim filtr and a littl work shows that H jω) H c j ) ) Ω T tan. }{{} ω For xampl, considr th scond-ordr Buttrworth low-pass filtr with Laplac transform ωc H c s). s + sω c + ω c If w choos th cutoff frquncy to b ω c T Ω c and apply th bilinar transform, thn w gt Hz) T Ω T c) ) z +z + z Ω T +z T c + Ω T c) Ω c 4 ) z +z + z Ω +z c + Ω c Ω + z ) c 4 z ) + 8 z )Ω c + + z ) Ω c Ω + z + z c 4 + Ω c 8 + Ω c ) + Ω c 8)z + 4 Ω c 8 + Ω c )z. For sufficintly small T, this is a digital low-pass filtr whos cutoff frquncy is clos to Ω c. Us Matlab to plot th frquncy rspons of this filtr for Ω c 0.π.
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 informationProblem Set #2 Due: Friday April 20, 2018 at 5 PM.
1 EE102B Spring 2018 Signal Procssing and Linar Systms II Goldsmith Problm St #2 Du: Friday April 20, 2018 at 5 PM. 1. Non-idal sampling and rcovry of idal sampls by discrt-tim filtring 30 pts) Considr
More informationEEO 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 informationTypes of Transfer Functions. Types of Transfer Functions. Types of Transfer Functions. Ideal Filters. Ideal Filters
Typs of Transfr Typs of Transfr x[n] X( LTI h[n] H( y[n] Y( y [ n] h[ k] x[ n k] k Y ( H ( X ( Th tim-domain classification of an LTI digital transfr function is basd on th lngth of its impuls rspons h[n]:
More informationTypes of Transfer Functions. Types of Transfer Functions. Ideal Filters. Ideal Filters. Ideal Filters
Typs of Transfr Typs of Transfr Th tim-domain classification of an LTI digital transfr function squnc is basd on th lngth of its impuls rspons: - Finit impuls rspons (FIR) transfr function - Infinit impuls
More informationCOMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, April 04, 2005, 8:35 AM) PART I: CHAPTER TWO COMB MATH.
C:\Dallas\0_Courss\03A_OpSci_67\0 Cgh_Book\0_athmaticalPrliminaris\0_0 Combath.doc of 8 COPUTER GENERATED HOLOGRAS Optical Scincs 67 W.J. Dallas (onday, April 04, 005, 8:35 A) PART I: CHAPTER TWO COB ATH
More informationLecture 2: Discrete-Time Signals & Systems. Reza Mohammadkhani, Digital Signal Processing, 2015 University of Kurdistan eng.uok.ac.
Lctur 2: Discrt-Tim Signals & Systms Rza Mohammadkhani, Digital Signal Procssing, 2015 Univrsity of Kurdistan ng.uok.ac.ir/mohammadkhani 1 Signal Dfinition and Exampls 2 Signal: any physical quantity that
More informationSlide 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 informationEE140 Introduction to Communication Systems Lecture 2
EE40 Introduction to Communication Systms Lctur 2 Instructor: Prof. Xiliang Luo ShanghaiTch Univrsity, Spring 208 Architctur of a Digital Communication Systm Transmittr Sourc A/D convrtr Sourc ncodr Channl
More informationLinear-Phase FIR Transfer Functions. Functions. Functions. Functions. Functions. Functions. Let
It is impossibl to dsign an IIR transfr function with an xact linar-phas It is always possibl to dsign an FIR transfr function with an xact linar-phas rspons W now dvlop th forms of th linarphas FIR transfr
More informationANALYSIS IN THE FREQUENCY DOMAIN
ANALYSIS IN THE FREQUENCY DOMAIN SPECTRAL DENSITY Dfinition Th spctral dnsit of a S.S.P. t also calld th spctrum of t is dfind as: + { γ }. jτ γ τ F τ τ In othr words, of th covarianc function. is dfind
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Procssing Prof. Mark Fowlr ot St #18 Introduction to DFT (via th DTFT) Rading Assignmnt: Sct. 7.1 of Proakis & Manolakis 1/24 Discrt Fourir Transform (DFT) W v sn that th DTFT is
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!
More informationSECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero.
SETION 6. 57 6. Evaluation of Dfinit Intgrals Exampl 6.6 W hav usd dfinit intgrals to valuat contour intgrals. It may com as a surpris to larn that contour intgrals and rsidus can b usd to valuat crtain
More informationChapter 6. The Discrete Fourier Transform and The Fast Fourier Transform
Pusan ational Univrsity Chaptr 6. Th Discrt Fourir Transform and Th Fast Fourir Transform 6. Introduction Frquncy rsponss of discrt linar tim invariant systms ar rprsntd by Fourir transform or z-transforms.
More informationFourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation.
Lur 7 Fourir Transforms and th Wav Euation Ovrviw and Motivation: W first discuss a fw faturs of th Fourir transform (FT), and thn w solv th initial-valu problm for th wav uation using th Fourir transform
More informationCOHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.
MTH rviw part b Lucian Mitroiu Th LOG and EXP functions Th ponntial function p : R, dfind as Proprtis: lim > lim p Eponntial function Y 8 6 - -8-6 - - X Th natural logarithm function ln in US- log: function
More information5 Transform Analysis of LTI Systems
5 Transform Analysis of LTI Systms ² For an LTI systm with input x [n], output y [n], and impuls rspons h [n]: Fig. 48-F1 ² Nots: 1. y [n] = h [n] x [n]. 2. Y ( jω ) = H ( jω ) X ( jω ). 3. From th Convolution
More informationEECE 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 informationA Propagating Wave Packet Group Velocity Dispersion
Lctur 8 Phys 375 A Propagating Wav Packt Group Vlocity Disprsion Ovrviw and Motivation: In th last lctur w lookd at a localizd solution t) to th 1D fr-particl Schrödingr quation (SE) that corrsponds to
More informationExercise 1. Sketch the graph of the following function. (x 2
Writtn tst: Fbruary 9th, 06 Exrcis. Sktch th graph of th following function fx = x + x, spcifying: domain, possibl asymptots, monotonicity, continuity, local and global maxima or minima, and non-drivability
More informationRecall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1
Chaptr 11 Th singular sris Rcall that by Thorms 10 and 104 togthr provid us th stimat 9 4 n 2 111 Rn = SnΓ 2 + on2, whr th singular sris Sn was dfind in Chaptr 10 as Sn = q=1 Sq q 9, with Sq = 1 a q gcda,q=1
More information10. Limits involving infinity
. Limits involving infinity It is known from th it ruls for fundamntal arithmtic oprations (+,-,, ) that if two functions hav finit its at a (finit or infinit) point, that is, thy ar convrgnt, th it of
More informationCalculus II (MAC )
Calculus II (MAC232-2) Tst 2 (25/6/25) Nam (PRINT): Plas show your work. An answr with no work rcivs no crdit. You may us th back of a pag if you nd mor spac for a problm. You may not us any calculators.
More informationECE602 Exam 1 April 5, You must show ALL of your work for full credit.
ECE62 Exam April 5, 27 Nam: Solution Scor: / This xam is closd-book. You must show ALL of your work for full crdit. Plas rad th qustions carfully. Plas chck your answrs carfully. Calculators may NOT b
More informationDiscrete Hilbert Transform. Numeric Algorithms
Volum 49, umbr 4, 8 485 Discrt Hilbrt Transform. umric Algorithms Ghorgh TODORA, Rodica HOLOEC and Ciprian IAKAB Abstract - Th Hilbrt and Fourir transforms ar tools usd for signal analysis in th tim/frquncy
More information2F1120 Spektrala transformer för Media Solutions to Steiglitz, Chapter 1
F110 Spktrala transformr för Mdia Solutions to Stiglitz, Chaptr 1 Prfac This documnt contains solutions to slctd problms from Kn Stiglitz s book: A Digital Signal Procssing Primr publishd by Addison-Wsly.
More informationcycle that does not cross any edges (including its own), then it has at least
W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th
More informationQuasi-Classical States of the Simple Harmonic Oscillator
Quasi-Classical Stats of th Simpl Harmonic Oscillator (Draft Vrsion) Introduction: Why Look for Eignstats of th Annihilation Oprator? Excpt for th ground stat, th corrspondnc btwn th quantum nrgy ignstats
More informationSolution: APPM 1360 Final (150 pts) Spring (60 pts total) The following parts are not related, justify your answers:
APPM 6 Final 5 pts) Spring 4. 6 pts total) Th following parts ar not rlatd, justify your answrs: a) Considr th curv rprsntd by th paramtric quations, t and y t + for t. i) 6 pts) Writ down th corrsponding
More informationu 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 informationIntroduction 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 informationHigher order derivatives
Robrto s Nots on Diffrntial Calculus Chaptr 4: Basic diffrntiation ruls Sction 7 Highr ordr drivativs What you nd to know alrady: Basic diffrntiation ruls. What you can larn hr: How to rpat th procss of
More informationDigital Signal Processing, Fall 2006
Digital Signal Prossing, Fall 006 Ltur 7: Filtr Dsign Zhng-ua an Dpartmnt of Eltroni Systms Aalborg Univrsity, Dnmar t@om.aau. Cours at a glan MM Disrt-tim signals an systms Systm MM Fourir-omain rprsntation
More informationJNTU World JNTU World DSP NOTES PREPARED BY 1 Downloaded From JNTU World (http://(http:// )(http:// )JNTU World )
JTU World JTU World DSP OTES PREPARED BY Downloadd From JTU World (http://(http:// )JTU World JTU World JTU World DIGITAL SIGAL PROCESSIG A signal is dfind as any physical quantity that varis with tim,
More information1 Isoparametric Concept
UNIVERSITY OF CALIFORNIA BERKELEY Dpartmnt of Civil Enginring Spring 06 Structural Enginring, Mchanics and Matrials Profssor: S. Govindj Nots on D isoparamtric lmnts Isoparamtric Concpt Th isoparamtric
More informationSupplementary Materials
6 Supplmntary Matrials APPENDIX A PHYSICAL INTERPRETATION OF FUEL-RATE-SPEED FUNCTION A truck running on a road with grad/slop θ positiv if moving up and ngativ if moving down facs thr rsistancs: arodynamic
More informationProblem Set 6 Solutions
6.04/18.06J Mathmatics for Computr Scinc March 15, 005 Srini Dvadas and Eric Lhman Problm St 6 Solutions Du: Monday, March 8 at 9 PM in Room 3-044 Problm 1. Sammy th Shark is a financial srvic providr
More informationCapturing. Fig. 1: Transform. transform. of two time. series. series of the. Fig. 2:
Appndix: Nots on signal procssing Capturing th Spctrum: Transform analysis: Th discrt Fourir transform A digital spch signal such as th on shown in Fig. 1 is a squnc of numbrs. Fig. 1: Transform analysis
More informationChapter 10. The singular integral Introducing S(n) and J(n)
Chaptr Th singular intgral Our aim in this chaptr is to rplac th functions S (n) and J (n) by mor convnint xprssions; ths will b calld th singular sris S(n) and th singular intgral J(n). This will b don
More information(Upside-Down o Direct Rotation) β - Numbers
Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg
More informationDerangements and Applications
2 3 47 6 23 Journal of Intgr Squncs, Vol. 6 (2003), Articl 03..2 Drangmnts and Applications Mhdi Hassani Dpartmnt of Mathmatics Institut for Advancd Studis in Basic Scincs Zanjan, Iran mhassani@iasbs.ac.ir
More informationSelf-Adjointness and Its Relationship to Quantum Mechanics. Ronald I. Frank 2016
Ronald I. Frank 06 Adjoint https://n.wikipdia.org/wiki/adjoint In gnral thr is an oprator and a procss that dfin its adjoint *. It is thn slf-adjoint if *. Innr product spac https://n.wikipdia.org/wiki/innr_product_spac
More informationDSP-First, 2/e. LECTURE # CH2-3 Complex Exponentials & Complex Numbers TLH MODIFIED. Aug , JH McClellan & RW Schafer
DSP-First, / TLH MODIFIED LECTURE # CH-3 Complx Exponntials & Complx Numbrs Aug 016 1 READING ASSIGNMENTS This Lctur: Chaptr, Scts. -3 to -5 Appndix A: Complx Numbrs Complx Exponntials Aug 016 LECTURE
More informationINTRODUCTION TO AUTOMATIC CONTROLS INDEX LAPLACE TRANSFORMS
adjoint...6 block diagram...4 clod loop ytm... 5, 0 E()...6 (t)...6 rror tady tat tracking...6 tracking...6...6 gloary... 0 impul function...3 input...5 invr Laplac tranform, INTRODUCTION TO AUTOMATIC
More informationProbability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.
Probability and Stochastic Procsss: A Frindly Introduction for Elctrical and Computr Enginrs Roy D. Yats and David J. Goodman Problm Solutions : Yats and Goodman,4.3. 4.3.4 4.3. 4.4. 4.4.4 4.4.6 4.. 4..7
More informationThe graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the
Copyright itutcom 005 Fr download & print from wwwitutcom Do not rproduc by othr mans Functions and graphs Powr functions Th graph of n y, for n Q (st of rational numbrs) y is a straight lin through th
More information1 General boundary conditions in diffusion
Gnral boundary conditions in diffusion Πρόβλημα 4.8 : Δίνεται μονοδιάτατη πλάκα πάχους, που το ένα άκρο της κρατιέται ε θερμοκραία T t και το άλλο ε θερμοκραία T 2 t. Αν η αρχική θερμοκραία της πλάκας
More informationRandom Process Part 1
Random Procss Part A random procss t (, ζ is a signal or wavform in tim. t : tim ζ : outcom in th sampl spac Each tim w rapat th xprimnt, a nw wavform is gnratd. ( W will adopt t for short. Tim sampls
More informationMathematics. Complex Number rectangular form. Quadratic equation. Quadratic equation. Complex number Functions: sinusoids. Differentiation Integration
Mathmatics Compl numbr Functions: sinusoids Sin function, cosin function Diffrntiation Intgration Quadratic quation Quadratic quations: a b c 0 Solution: b b 4ac a Eampl: 1 0 a= b=- c=1 4 1 1or 1 1 Quadratic
More informationPropositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018
Propositional Logic Combinatorial Problm Solving (CPS) Albrt Olivras Enric Rodríguz-Carbonll May 17, 2018 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs
More information[ ] [ ] DFT: Discrete Fourier Transform ( ) ( ) ( ) ( ) Congruence (Integer modulo m) N-point signal
Congrunc (Intgr modulo m) : Discrt Fourir Transform In this sction, all lttrs stand for intgrs. gcd ( nm, ) th gratst common divisor of n and m Lt d gcd(n,m) All th linar combinations r n+ s m of n and
More informationEinstein Equations for Tetrad Fields
Apiron, Vol 13, No, Octobr 006 6 Einstin Equations for Ttrad Filds Ali Rıza ŞAHİN, R T L Istanbul (Turky) Evry mtric tnsor can b xprssd by th innr product of ttrad filds W prov that Einstin quations for
More informationLimiting value of higher Mahler measure
Limiting valu of highr Mahlr masur Arunabha Biswas a, Chris Monico a, a Dpartmnt of Mathmatics & Statistics, Txas Tch Univrsity, Lubbock, TX 7949, USA Abstract W considr th k-highr Mahlr masur m k P )
More informationECE Department Univ. of Maryland, College Park
EEE63 Part- Tr-basd Filtr Banks and Multirsolution Analysis ECE Dpartmnt Univ. of Maryland, Collg Park Updatd / by Prof. Min Wu. bb.ng.umd.du d slct EEE63); minwu@ng.umd.du md d M. Wu: EEE63 Advancd Signal
More information2.3 Matrix Formulation
23 Matrix Formulation 43 A mor complicatd xampl ariss for a nonlinar systm of diffrntial quations Considr th following xampl Exampl 23 x y + x( x 2 y 2 y x + y( x 2 y 2 (233 Transforming to polar coordinats,
More informationBrief Introduction to Statistical Mechanics
Brif Introduction to Statistical Mchanics. Purpos: Ths nots ar intndd to provid a vry quick introduction to Statistical Mchanics. Th fild is of cours far mor vast than could b containd in ths fw pags.
More informationComplex Powers and Logs (5A) Young Won Lim 10/17/13
Complx Powrs and Logs (5A) Copyright (c) 202, 203 Young W. Lim. Prmission is grantd to copy, distribut and/or modify this documnt undr th trms of th GNU Fr Documntation Licns, Vrsion.2 or any latr vrsion
More informationThe 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 informationu r du = ur+1 r + 1 du = ln u + C u sin u du = cos u + C cos u du = sin u + C sec u tan u du = sec u + C e u du = e u + C
Tchniqus of Intgration c Donald Kridr and Dwight Lahr In this sction w ar going to introduc th first approachs to valuating an indfinit intgral whos intgrand dos not hav an immdiat antidrivativ. W bgin
More informationCramér-Rao Inequality: Let f(x; θ) be a probability density function with continuous parameter
WHEN THE CRAMÉR-RAO INEQUALITY PROVIDES NO INFORMATION STEVEN J. MILLER Abstract. W invstigat a on-paramtr family of probability dnsitis (rlatd to th Parto distribution, which dscribs many natural phnomna)
More informationFirst derivative analysis
Robrto s Nots on Dirntial Calculus Chaptr 8: Graphical analysis Sction First drivativ analysis What you nd to know alrady: How to us drivativs to idntiy th critical valus o a unction and its trm points
More information2008 AP Calculus BC Multiple Choice Exam
008 AP Multipl Choic Eam Nam 008 AP Calculus BC Multipl Choic Eam Sction No Calculator Activ AP Calculus 008 BC Multipl Choic. At tim t 0, a particl moving in th -plan is th acclration vctor of th particl
More informationMath 34A. Final Review
Math A Final Rviw 1) Us th graph of y10 to find approimat valus: a) 50 0. b) y (0.65) solution for part a) first writ an quation: 50 0. now tak th logarithm of both sids: log() log(50 0. ) pand th right
More informationElements 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 informationAddition of angular momentum
Addition of angular momntum April, 07 Oftn w nd to combin diffrnt sourcs of angular momntum to charactriz th total angular momntum of a systm, or to divid th total angular momntum into parts to valuat
More information2. Background Material
S. Blair Sptmbr 3, 003 4. Background Matrial Th rst of this cours dals with th gnration, modulation, propagation, and ction of optical radiation. As such, bic background in lctromagntics and optics nds
More informationSundials and Linear Algebra
Sundials and Linar Algbra M. Scot Swan July 2, 25 Most txts on crating sundials ar dirctd towards thos who ar solly intrstd in making and using sundials and usually assums minimal mathmatical background.
More informationIntroduction to Medical Imaging. Lecture 4: Fourier Theory = = ( ) 2sin(2 ) Introduction
Introduction Introduction to Mdical aging Lctur 4: Fourir Thory Thory dvlopd by Josph Fourir (768-83) Th Fourir transform of a signal s() yilds its frquncy spctrum S(k) Klaus Mullr s() forward transform
More informationNumbering Systems Basic Building Blocks Scaling and Round-off Noise. Number Representation. Floating vs. Fixed point. DSP Design.
Numbring Systms Basic Building Blocks Scaling and Round-off Nois Numbr Rprsntation Viktor Öwall viktor.owall@it.lth.s Floating vs. Fixd point In floating point a valu is rprsntd by mantissa dtrmining th
More informationDeift/Zhou Steepest descent, Part I
Lctur 9 Dift/Zhou Stpst dscnt, Part I W now focus on th cas of orthogonal polynomials for th wight w(x) = NV (x), V (x) = t x2 2 + x4 4. Sinc th wight dpnds on th paramtr N N w will writ π n,n, a n,n,
More informationHydrogen Atom and One Electron Ions
Hydrogn Atom and On Elctron Ions Th Schrödingr quation for this two-body problm starts out th sam as th gnral two-body Schrödingr quation. First w sparat out th motion of th cntr of mass. Th intrnal potntial
More informationMATH 319, WEEK 15: The Fundamental Matrix, Non-Homogeneous Systems of Differential Equations
MATH 39, WEEK 5: Th Fundamntal Matrix, Non-Homognous Systms of Diffrntial Equations Fundamntal Matrics Considr th problm of dtrmining th particular solution for an nsmbl of initial conditions For instanc,
More informationSliding Mode Flow Rate Observer Design
Sliding Mod Flow Rat Obsrvr Dsign Song Liu and Bin Yao School of Mchanical Enginring, Purdu Univrsity, Wst Lafaytt, IN797, USA liu(byao)@purdudu Abstract Dynamic flow rat information is ndd in a lot of
More information5.80 Small-Molecule Spectroscopy and Dynamics
MIT OpnCoursWar http://ocw.mit.du 5.80 Small-Molcul Spctroscopy and Dynamics Fall 008 For information about citing ths matrials or our Trms of Us, visit: http://ocw.mit.du/trms. Lctur # 3 Supplmnt Contnts
More informationBINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results
BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim and n a positiv intgr, lt ν p (n dnot th xponnt of p in n, and u p (n n/p νp(n th unit part of n. If α
More informationHomework #3. 1 x. dx. It therefore follows that a sum of the
Danil Cannon CS 62 / Luan March 5, 2009 Homwork # 1. Th natural logarithm is dfind by ln n = n 1 dx. It thrfor follows that a sum of th 1 x sam addnd ovr th sam intrval should b both asymptotically uppr-
More informationSearch sequence databases 3 10/25/2016
Sarch squnc databass 3 10/25/2016 Etrm valu distribution Ø Suppos X is a random variabl with probability dnsity function p(, w sampl a larg numbr S of indpndnt valus of X from this distribution for an
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013
18.782 Introduction to Arithmtic Gomtry Fall 2013 Lctur #20 11/14/2013 20.1 Dgr thorm for morphisms of curvs Lt us rstat th thorm givn at th nd of th last lctur, which w will now prov. Thorm 20.1. Lt φ:
More information(1) Then we could wave our hands over this and it would become:
MAT* K285 Spring 28 Anthony Bnoit 4/17/28 Wk 12: Laplac Tranform Rading: Kohlr & Johnon, Chaptr 5 to p. 35 HW: 5.1: 3, 7, 1*, 19 5.2: 1, 5*, 13*, 19, 45* 5.3: 1, 11*, 19 * Pla writ-up th problm natly and
More informationAbstract Interpretation: concrete and abstract semantics
Abstract Intrprtation: concrt and abstract smantics Concrt smantics W considr a vry tiny languag that manags arithmtic oprations on intgrs valus. Th (concrt) smantics of th languags cab b dfind by th funzcion
More information1973 AP Calculus AB: Section I
97 AP Calculus AB: Sction I 9 Minuts No Calculator Not: In this amination, ln dnots th natural logarithm of (that is, logarithm to th bas ).. ( ) d= + C 6 + C + C + C + C. If f ( ) = + + + and ( ), g=
More informationCommunication Technologies
Communication Tchnologis. Principls of Digital Transmission. Structur of Data Transmission.2 Spctrum of a Data Signal 2. Digital Modulation 2. Linar Modulation Mthods 2.2 Nonlinar Modulations (CPM-Signals)
More informationBifurcation Theory. , a stationary point, depends on the value of α. At certain values
Dnamic Macroconomic Thor Prof. Thomas Lux Bifurcation Thor Bifurcation: qualitativ chang in th natur of th solution occurs if a paramtr passs through a critical point bifurcation or branch valu. Local
More informationCalculus concepts derivatives
All rasonabl fforts hav bn mad to mak sur th nots ar accurat. Th author cannot b hld rsponsibl for any damags arising from th us of ths nots in any fashion. Calculus concpts drivativs Concpts involving
More informationMATH 1080 Test 2-SOLUTIONS Spring
MATH Tst -SOLUTIONS Spring 5. Considr th curv dfind by x = ln( 3y + 7) on th intrval y. a. (5 points) St up but do not simplify or valuat an intgral rprsnting th lngth of th curv on th givn intrval. =
More information22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches.
Subjct Chmistry Papr No and Titl Modul No and Titl Modul Tag 8/ Physical Spctroscopy / Brakdown of th Born-Oppnhimr approximation. Slction ruls for rotational-vibrational transitions. P, R branchs. CHE_P8_M
More informationINTEGRATION BY PARTS
Mathmatics Rvision Guids Intgration by Parts Pag of 7 MK HOME TUITION Mathmatics Rvision Guids Lvl: AS / A Lvl AQA : C Edcl: C OCR: C OCR MEI: C INTEGRATION BY PARTS Vrsion : Dat: --5 Eampls - 6 ar copyrightd
More information1997 AP Calculus AB: Section I, Part A
997 AP Calculus AB: Sction I, Part A 50 Minuts No Calculator Not: Unlss othrwis spcifid, th domain of a function f is assumd to b th st of all ral numbrs for which f () is a ral numbr.. (4 6 ) d= 4 6 6
More informationThat is, we start with a general matrix: And end with a simpler matrix:
DIAGON ALIZATION OF THE STR ESS TEN SOR INTRO DUCTIO N By th us of Cauchy s thorm w ar abl to rduc th numbr of strss componnts in th strss tnsor to only nin valus. An additional simplification of th strss
More information4 x 4, and. where x is Town Square
Accumulation and Population Dnsity E. A city locatd along a straight highway has a population whos dnsity can b approimatd by th function p 5 4 th distanc from th town squar, masurd in mils, whr 4 4, and
More information1.2 Faraday s law A changing magnetic field induces an electric field. Their relation is given by:
Elctromagntic Induction. Lorntz forc on moving charg Point charg moving at vlocity v, F qv B () For a sction of lctric currnt I in a thin wir dl is Idl, th forc is df Idl B () Elctromotiv forc f s any
More informationCPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming
CPSC 665 : An Algorithmist s Toolkit Lctur 4 : 21 Jan 2015 Lcturr: Sushant Sachdva Linar Programming Scrib: Rasmus Kyng 1. Introduction An optimization problm rquirs us to find th minimum or maximum) of
More informationTopic 5: Discrete-Time Fourier Transform (DTFT)
ELEC36: Signals And Systms Tpic 5: Discrt-Tim Furir Transfrm (DTFT) Dr. Aishy Amr Cncrdia Univrsity Elctrical and Cmputr Enginring DT Furir Transfrm Ovrviw f Furir mthds DT Furir Transfrm f Pridic Signals
More informationDISCRETE TIME FOURIER TRANSFORM (DTFT)
DISCRETE TIME FOURIER TRANSFORM (DTFT) Th dicrt-tim Fourir Tranform x x n xn n n Th Invr dicrt-tim Fourir Tranform (IDTFT) x n Not: ( ) i a complx valud continuou function = π f [rad/c] f i th digital
More information1 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 informationThe van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012
Th van dr Waals intraction D. E. Sopr 2 Univrsity of Orgon 20 pril 202 Th van dr Waals intraction is discussd in Chaptr 5 of J. J. Sakurai, Modrn Quantum Mchanics. Hr I tak a look at it in a littl mor
More informationA. Limits and Horizontal Asymptotes ( ) f x f x. f x. x "±# ( ).
A. Limits and Horizontal Asymptots What you ar finding: You can b askd to find lim x "a H.A.) problm is asking you find lim x "# and lim x "$#. or lim x "±#. Typically, a horizontal asymptot algbraically,
More informationAnnounce. ECE 2026 Summer LECTURE OBJECTIVES READING. LECTURE #3 Complex View of Sinusoids May 21, Complex Number Review
ECE 06 Summr 018 Announc HW1 du at bginning of your rcitation tomorrow Look at HW bfor rcitation Lab 1 is Thursday: Com prpard! Offic hours hav bn postd: LECTURE #3 Complx Viw of Sinusoids May 1, 018 READIG
More information