X (z) = n= 1. Ã! X (z) x [n] X (z) = Z fx [n]g x [n] = Z 1 fx (z)g. r n x [n] ª e jnω
|
|
- Derrick Nichols
- 5 years ago
- Views:
Transcription
1 3 The z-transform ² Two advantages with the z-transform:. The z-transform is a generalization of the Fourier transform for discrete-time signals; which encompasses a broader class of sequences. The z-transform exists for some sequences for which the Fourier transform does not converge.. The advantage and power of complex variable theory allow one to obtain z-transforms easily. 3. -Transform ² Defn: The (two-sided or bilateral) z-transform of a sequence x [n] is de ned as X x [n] z n where z is a complex variable. We shall adopt the notation or throughout. x [n] n Ã! X (z) fx [n]g x [n] fx (z)g ² Note that the Fourier transform X (e jω ) of x [n] is only a special case of X (z) since X e jω X (z)j ze jω. If we express z by a polar form, i.e., z re jω, then X n r n x [n] ª e jnω whose region of convergence (ROC) may or may not contain the circle r (unit circle on z-plane). Fig. 3.
2 The su cient and necessary condition for a z-transform to exist is jx (z)j < 8z ROC. A su cient condition is that the sequence fx [n] z n g is absolutely summable for z ROC, i.e., jx (z)j X n x [n] z n X n jx [n]j jzj n X n jx [n]j r n < 8z ROC. This su cient condition implies that if z z ROC, then all z on the circle de ned by jzj jz j will also be in ROC. Therefore, the ROC consists of a ring in the z-plane. Fig. 3. Note: if ROC does not contain the unit circle, then the Fourier transform of x [n] does not exist. ² It is mentioned in Section.7 that if the sequence fx [n] z n g is absolutely summable for z ROC, i.e. then X M (z) with X n X M (z) jx [n]j r n < MX n M x [n] z n converges uniformly to a continuous function of z for z ROC. ² It is shown by theory that the z-transform and all its derivatives are continuous functions of z within ROC. Thus if ROC contains unit circle, then the Fourier transform X (e jω ) and all its derivatives w.r.t. ω are continuous function of ω. ² Some useful z-transform pairs are summarized in Table 3.. Table 3.
3 ² Ex: Right-Sided Exponential Sequence x [n] a n u [n], a real ) X n Convergence of X (z) requires su ciently that X n az < n0 a n u [n] z n X az n. n0 which implies the ROC fz : jzj > jajg. Thus, for jzj > jaj, Notes: X az n n0 az z z a.. if jaj, x [n] a n u [n] does not have a Fourier transform.. X (z) simpli es to a rational function. Any rational z-transform can be described by its poles and zeros. 3. if a > 0, z a is the pole of X (z), while z 0 is the zero. ² Ex: Left-Sided Exponential Sequence Fig. 3.3 x [n] a n u [ n ], a real X X ) a n z n a n z n n For jzj < jaj, X (z) converges to Notes: n a z z z a. X a z n.. The z-transform here equals to that in the previous example for x [n] a n u [n] with the same pole-zero plot, while ROC is di erent. Fig n0
4 . It is necessary to specify the algebraic expression for X (z) and the ROC for the bilateral z-transform of a given sequence. ² Ex: Sum of Two Exponential Sequences µ n µ x [n] u [n] + n u [n] 3 X ½µ ) n X µ n X z n + n0 n µ u [n] + n ¾ u [n] z 3 n n0 µ 3 n z n + for z + 3 z z z for jzj > z z +. 3 Fig. 3.5 z ² Ex: Sum of Two Exponential Sequences (Revisited) µ n µ x [n] u [n] + n u [n] 3 µ n ) u [n] Ã! jzj > z µ n u [n] Ã! z jzj > 3 < and 3 z < µ n µ u [n] + n u [n] Ã! 3 + z + jzj > 3 z This indicates that the z-transform is linear and that the resultant ROC is the intersection of two individual ROCs. 4
5 ² Ex: Two-Sided Exponential Sequence µ x [n] n µ n u [n] u [ n ] 3 ) Notes: µ 3 n u [n] µ n u [ n ] µ n u [n] 3 Ã! jzj > + 3 z 3 Ã! µ jzj < z n u [ n ] Ã! z z 3 < jzj < z(z ) (z + 3 )(z ).. The rational function here is identical to that in the previous example, but the ROC is di erent. Fig This sequence does not have a Fourier transform. ² Ex: Finite-Length Truncated Exponential Sequence ½ a x [n] n, 0 n N 0, otherwise N X ) a n z n (az ) N z N a N az z N z a. n0 The ROC 0 is determined by N X n0 az n <. As long as jaz j is nite, i.e., jaj < and z 6 0, X (z) exists. Assuming a nite jaj, X (z) has a pole at z 0 and N zeros at z k a expfjπk/ng for k,,..., N. ² See Table 3. for useful pairs. Fig
6 3. Properties of the ROC for the z-transform ² Assuming that X (z) is rational and x [n] has nite amplitude for < n <.. The ROC is generally of the form 0 r R < jzj < r L (an annulus).. For a given sequence x[n], X (e jω ) converges absolutely i the ROC of X (z) includes the unit circle. 3. The ROC can not contain any poles. 4. If x [n] is a nite-duration sequence, i.e., it is nonzero only for nite n s, then the ROC is the entire z-plane except possibly z 0 or jzj. 5. If x [n] is a right-sided sequence, i.e., it is zero for n < N <, then the ROC is of the form either r max < jzj or r max < jzj <, with r max the largest magnitude of a nite pole. 6. If x [n] is a left-sided sequence, i.e., it is zero for n > N >, then the ROC is of the form either jzj < r min or 0 < jzj < r min, with r min the smallest magnitude of a nite pole. 7. If x [n] is a two-sided sequence, i.e., it is zero < N < n < N < for nite N and N, then the ROC is of the form 0 r R < jzj < r L with r R and r L the magnitudes of two distinct poles, and not containing any poles inside. 8. The ROC must be a connected region (since X (z) is continuous). ² See section 3. for proof and Fig. 3.8 ² Ex: Non-Overlapping Regions of Convergence µ n µ x [n] u [n] n u [ n ]. 3 ) + z + for jzj > 3 z and jzj < 3 Thus, x [n] has no z-transform. 6
7 3.3 The Inverse -Transform ² Defn: The inverse z-transform of X (z) is de ned by the contour integral x [n] I X (z) z n dz πj C where C is a counterclockwise closed contour in the ROC of X (z) and encircling the origin z 0. ² Derivation of this formal de nition: From Cauchy integral theorem, I ½, k z k dz πj 0, k 6 for such C. Since C X n x [n] z n δ [k ] ) I X (z) z k dz I X x [n] z n+k dz πj C πj C n X I x [n] z n+k dz πj n C {z } x [k]. δ[n k+ ]δ[n k] ² If the ROC includes unit circle and we let C be unit circle, I x [n] X e jω e jω(n ) de jω ze jω πj unit circle π X e jω e jωn dω. π π ² We shall discuss below various useful procedures of evaluating inverse z-transform, i.e., nding x [n] from X (z) Inspection Method ² The method is to inspect Table 3. to nd the desired x [n]. For example, with pair 5 of Table 3. a n u [n] Ã!, jzj > jaj az 7
8 we can nd the x [n] of as 0 n u [n] + z +, jzj > 3 z Ã! 3.3. Partial Fraction Expression, jzj z n A 3 u [n] Ã!, jzj > + 3 z 3 µ n µ ) x [n] u [n] + n u [n]. 3 ² The method is to applying partial fraction expression to a rational X (z) rst, and use the inspection method to obtain x [n]. Let P M k0 b kz k P N k0 a kz for a k and b Then, zn P M k0 b kz M k z M P N k0 a kz N k ² In general, µ implying M zeros and N poles at nonzero locations at most P M k0 b kz k P N k0 a kz k for a and b can be expressed as b Q M 0 k ( c kz ) Q a N 0 k ( d kz ) where c k s are nonzero zeros of X (z) and d k s are nonzero poles of X (z). Suppose that c k s are di erent from d k s and that d, d,..., d N s+ are di erent and d N s+,..., d N are the same. Then, we can expand X (z) into M N X r0 N s + + X k sx m B r z r (exists if M N) A k (for poles of order one) d k z C m ( d N s+ z ) m (for pole of order s). 8
9 (For the cases with other di erent-order poles, above expression can be modi ed accordingly.), where. B r s can be derived by long division of the numerator by the denominator,. A k ( d k z ) X (z) j zdk, 3. C m ² Ex: Find x [n] if X (z) is given by Now, (s m)! ( d N s+ ) s m ½ d s m ( dn dw s m s+ w) s X w ¾. w/d N s+ + z + z 3 z + for jzj >. z + z + z z ( z ). Fig. 3. We have M N and two poles of order one, thus where. B 0 is derived B 0 + A z + A z z 3 z +, z + z + z 3z + 5z ) B 0 9
10 . A µ z X (z) + z + z z 9 z z A z X (z) z + z + z z z 8. That is, By inspection with Table 3., jzj >. z z So, δ [n] µ n u [n] u [n] x [n] δ [n] 9 Ã! all z Ã! z jzj > Ã! z jzj >. µ n u [n] + 8u [n] Power Series Expansion ² If we can expand X (z) in terms of power series (Laurent series) X X(z) x [n] z n n then x [n] can be obtained as the coe cient of z n. 0
11 ² Ex: z µ z + z z jzj > 0 z z + z 8 >< ) x [n] >:, n, n, n 0, n 0, otherwise ) x [n] δ [n + ] δ [n + ] δ [n] + δ [n ]. ² Ex: Since we have ² Ex: Consider Since we have ² Ex: Consider log + az log ( + x) X n jzj > jaj n ( )n+ x n for jxj < X ( ) n+ a n z n n ) x [n] ( ) n+ a n u [n ]. n n, jzj > jaj. az x + x + x +... for jxj < X az n ) x [n] a n u [n]. n0, jzj < jaj. az
12 Now Since we have µ a z a z a z a z + x X x n for jxj < n0. a z 0X n X n X a n z n a z n0 a n z (n ) ( a n ) z n ) x [n] a n u [ n ] Cauchy Residue Theorem 0X n a n z n ² From Cauchy Residue Theorem, x [n] I X (z) z n dz πj C X residues of X (z) z n at the poles inside C ² If X (z) is a rational function of z, then X (z) z n has the form of X (z) z n ª (z) (z d 0 ) s where X (z) z n has a pole of order s at z d 0 and ª (z) has no poles nor zeros at z d 0. Then, Res X (z) z n ds ª (z) at z d 0 (s )! dz. s zd 0 If s, Res X (z) z n at z d 0 ª (d0 ).
13 ² Ex: Consider, jzj > jaj az ) X (z) z n zn z a.. For n 0, there is only one pole of order one at z a and Res X (z) z n at z a a n, n 0.. For n < 0, there is jnj-th order pole at z 0 and rst order pole at z a, and Res X (z) z n at z a a n Res X (z) z n at z 0 ) x [n] a n a n 0 for n < Therefore, from cases and, 3.4 -Transform Properties ² We shall adopt the notations and x [n] x [n] x [n] (jnj )! d jnj (z a) dz jnj ( ) jnj (jnj )! (jnj )! ( ) ( ) jnj ( a) jnj a jnj a n. x [n] a n u [n]. Ã! X (z), ROC R x Ã! X (z), ROC R x Ã! X (z), ROC R x fx [n]g x [n] fx (z)g. 3 z0 (z a) jnj z0
14 ² Properties:. Linearity: ax [n] + bx [n]. Time-Shifting: x [n n 0 ] Pf: X n Ã! ax (z) + bx (z), ROC R x \ R x. Ã! z n0 X (z), ROC R x (may exclude z 0 or jzj ). x [n n 0 ] z n z n 0 X m z n 0 X (z). x [m] z m (m n n 0 ) (ROC should be reconsidered at z 0 and jzj.) QED Ex: Let z, jzj > 4. 4 First, from partial fraction expansion, Since ) x [n] 4δ [n] + 4 z, jzj > 4 z z δ [n] Ã!, 8z a n u [n] Ã! µ 4, jzj > jaj az n u [n] Alternatively, since µ n u [n] Ã! 4, jzj > 4 z 4 µ n u [n ]. 4 we have µ n u [n ] Ã! z 4 4 z from the time-shifting property. 4
15 3. Multiplication by z n 0 : Pf: z n 0 x [n] X new (z) Ã! X X n µ z µ z X z 0 z 0, ROC jz 0 j R x. z n 0 x [n] z n X n z z 0 R x. µ n z x [n] z 0 QED Ex: Find X (z) of x [n] r n cos (ω 0 n) u [n]. Now, x [n] re jω 0 n u [n] + re jω 0 n u [n]. Since, u [n] Ã! z re jω 0 n u [n] Ã! re jω 0 n u [n], jzj > Ã! z re jω 0 z re jω 0, jzj > re jω 0 r, jzj > r ) re jω0 z +, jzj > r re jω0 z r cos ω 0 z, jzj > r. r cos ω 0 z + r z 4. Di erentiation of X (z): nx [n] Pf: dx (z) Ã! z, ROC R x (may exclude z 0 or jzj ). dz X n nx [n] z n z 5 X n z d dz z nx [n] z n X n dx (z) dz x [n] z n QED
16 Ex: Find X (z) of na n u [n]. Since a n u [n] Ã!, jzj > jaj az ) na n u [n] Ã! z d µ dz az z (az ) ( az, jzj > jaj ) az, jzj > jaj ( az, jzj > jaj. ) ( jzj can be included in the ROC) 5. Conjugation of a Complex Sequence: x [n] Ã! X (z ), ROC R x. Pf: X x [n] z n n à X x [n] z n n! Ã! X x [n] (z ) n n X (z ), jz j R x ) jzj R x. QED 6. Time Reversal: x [ n] Ã! X µ, z R x. z Pf: X x [ n] z n n 0 n n X n 0 h x n 0i z n 0 X z, z R x. QED Ex: Find z-transform of a n u [ n]. Since a n u [n] Ã!, jzj > jaj az ) a n u [ n] Ã! az, jzj < a. 6
17 7. Convolution of Sequences: Pf: Ex: x [n] x [n] X n X n k à X m Ã! X (z) X (z), ROC R x \ R x. (x [n] x [n]) z n X x [k] x [n k] z (n k) z k x [m] z m! à X k x [k] z k! X (z) X (z), z R x and z R x. QED x [n] a n u [n], jaj < x [n] u [n] x [n] x [n] Ã! X (z) Ã! By partial fraction expansion, Y (z) a Ã! X (z), jzj > z, jzj > z {z az } Y (z) µ z a az (m n k), jzj > jaj az, jzj > ) y [n] a (u [n] a an u [n]) an+ a u [n]. 8. Initial Value Theorem: If x [n] 0 for n < 0, then Pf: x [0] lim z! X (z). X x [n] z n n0 ) lim z! X n ² See Table 3. for a list of properties. x [n] lim z! z n + x [0] x [0]. QED 7
18 3.5 Complex Convolution Theorem (Supplemental) ² Question: What is the z-transform of x [n] x [n]? Answer: Let Then W (z) w [n] x [n] x [n]. X n x [n] x [n] z n. From contour-integral de nition of inverse z-transform, x [n] I X (v) v n dv πj C ) W (z) πj πj X I ³ z n x [n] X (v) v dv n C v I " X # ³ z n x [n] X (v) v dv. v C n {z } X ( z v) If we choose C as a closed contour in the overlap of ROCs of X z v and X (v), then W (z) I ³ z X X (v) v dv. πj C v Alternatively, if we choose C as a closed contour in the overlap of ROCs of X (v) and X z v, then W (z) I ³ z X (v) X v dv. πj C v ² Question: What is the ROC for W (z)? Answer: Let R x : r R < jzj < r L R x : r R < jzj < r L ) 8
19 . C is determined by. C is determined by ¾ r R < jvj < r L r R < z ) r < R r R < jzj < r L r L. rl v ¾ r R < jvj < r L r R < z ) r < R r R < jzj < r L r L. rl v ) The ROC of W (z) should contain r R r R < jzj < r L r L, denoted by R w which may be di erent from R x \ R x (since X (v) X z v v may have di erent poles for z). ² Note: As v e jθ, z e jω, C C unit circle, we have W e jω π π π X e jθ X e j(ω θ) dθ which is exactly the windowing theorem in the Fourier transform. ² Ex: Given x [n] a n u [n] and x [n] b n u [n] where jaj < and jbj <, nd w [n] x [n] x [n]. Now, where C is chosen as with jzj jaj X (z), jzj > jaj az X (z), jzj > jbj bz ) W (z) I z/a dv πj C v z/a {z } v {z b } X ( z X v) (v)v Fig. 44-F > jbj, i.e., jzj > jabj. Now, from Cauchy Residue Theorem, z/a Res v z/a v b at v b z/a b z/a ) W (z), jzj > jabj abz ) w [n] (ab) n u [n] as expected! Note: In this example R w is di erent from R x \ R x. 9
20 3.6 Parseval s Relation (Supplemental) ² For two complex sequences x [n] and x [n], Parseval s Relation states that X x [n] x [n] I µ X (v) X v dv πj C v n where P n x [n] x [n] is assumed to exist and C is in the overlap of ROCs of X (v) and X v. Pf: Let y [n], x [n] x [n]. From the Complex Convolution Theorem, Y (z) I ³ z X (v) U v dv πj v C where U (z) fx [n]g and C is in the overlap of ROC s of X (v) and U z v. Now, from conjugation of a complex sequence, (x [n] Ã! X (z ), ROC R x ), Furthermore, U (z) X (z ), ROC R x ) Y (z) I µ z X (v) X v dv. πj v C Y (z)j z X n y [n] yields the relation X x [n] x [n] I µ X (v) X v dv. πj C v ² Notes: n QED. When v e jω, we have the Parseval s Relation in terms of the Fourier Transform, X n x [n] x [n] π π π which is di cult, in general, to evaluate. X e jω X e jω dω. Parseval s relation in terms of z-transform is easy to evaluate by use of the Cauchy Residue Theorem. 0
21 3. When x [n] x [n] x [n] is real, X n jx [n] j energy of x [n] I µ X (v) X v dv πj C v where C ROC x \ (ROC x ), with ROC x fzjr R < jzj < r L g and (ROC x ) fzjr L < jzj < r R g. Fig. 45-F ² Ex: Find the energy of real sequence x [n] with Now, X n x [n] I πj C ( az ) ( bz ), jaj <, jbj <, a 6 b jzj > max fjaj, jbjg ( av ) ( bv ) ( av) ( bv) v dv with C being unit circle. This can be simpli ed to X n x [n] I πj C v (v a) (v b) ( av) ( bv) dv. Fig. 45-B... Res v (v a) (v b) ( av) ( bv) at v a a (a b) ( a ) ( ab) v Res (v a) (v b) ( av) ( bv) at v b b (b a) ( ab) ( b )
22 Thus, X x [n] n a (a b) ( ab) a b b (a b) + ab (a b) (a b) ( ab) ( a ) ( b ) + ab ( ab) ( a ) ( b ). 3.7 z-transforms and LTI Systems ² For an LTI system with input x [n], output y [n], and impulse response h [n], y[n] x[n] h[n] () Y (z) X (z) H (z), ROC R y R x \ R h where fx [n]g for z R x, Y (z) fy [n]g for z R y, and H (z) fh [n]g for z R n, by convolution property. Here, H (z) is called the system function of the LTI system with impulse response h[n]. ² Ex: Let h[n] a n u[n] with jaj < and x[n] Au[n]. Now, the system function is H(z), jzj > jaj az and the z-transform of the input is X(z) Thus, the z-transform of the output is Y (z) A, jzj >. z A ( z )( az ), jzj > Az (z )(z a) A a ( z a ). az Fig. 3. Taking the inverse z-transform of Y (z) yields y[n] A a ( an+ )u[n].
23 Alternatively, we can evaluate y[n] by convolution sum as y[n] Au[n] a n u[n] X Au[k]a n k u[n k] A k nx a n k u[n] k0 A a ( an+ )u[n]. Note that the z-transform is useful for describing the input-output relation of an LTI system. ² Consider the causal LTI system described by a linear constant-coe cient di erence equation y[n] NX ( a MX k )y[n k] + ( b k )x[n k] a 0 a 0 k with a Let input x[n] and output y[n] be both causal. Taking z- transform, the equation becomes after applying linearity and time-shift properties Y (z) k k0 NX ( a MX k )z k Y (z) + ( b k )z k X(z) a 0 a 0 ) Y (z) H(z)X(z) k0 with the system function of the causal LTI system given by H(z) for jzj > r R (since h[n] is causal). Notes: P M k0 ( b k a0 )z k P N k0 ( a k a 0 )z k. r R is the magnitude of the pole of H(z) farthest from the origin.. If r R <, all poles of H(z) locate inside the unit circle. Thus, the system is stable and the frequency response H(e jω ) of the LTI system exists. 3
24 Recall that an LTI system is stable i its impulse response is absolutely summable, i.e., P jh[n]j <. Now, if the ROC of H(z) contains the unit circle, then h[n] is absolutely summable and this guarantees the system stability. ² Ex: First-Order Causal LTI System Consider y[n] ay[n ] + x[n]. By inspection, the system function is given by H(z), jzj > jaj az, h[n] a n u[n]. 3.8 The Unilateral z-transform ² Defn: The unilateral z-transform of x [n] is de ned and denoted by X x [n] z n. n0 ² Note:. Conventional z-transform is bilateral!. If x [n] 0 for n < 0, i.e., the sequence is causal, unilateral and bilateral z-transforms will be identical; and share the same properties. 3. X (z) has a ROC with the form jzj > r R. Thus, if X (z) is a rational function, r R is de ned by the pole with the largest magnitude. ² Ex: x [n] δ [n] ) For unilateral z-transform, ) For bilateral z-transform, X δ [n] z n n0 X n δ [n] z n. 4
25 ² Ex: x [n] δ [n + ] ) For unilateral z-transform, X δ [n + ] z n 0 ) For bilateral z-transform, n0 X n δ [n] z n z. ² Note: For x [n] 6 0, n < 0, i.e., any noncausal sequence, X (z) and X (z) are di erent. ² Further Notes:. The timing properties for unilateral and bilateral z-transforms are di erent. (a) For bilateral z-transform, x [n] Ã! X (z) x [n m] (b) For unilateral z-transform, let y [n] x [n m], m > 0. X Y (z) y [n] z n n0 X x [n m] z n n0 X n 0 m (n 0 n m) h x n 0i z n0 m Ã! z m X (z) x [ m] + x [ m + ] z + x [ m + ] z + 0 X h... + x [ ] z m x n 0i z n0 A z m n 0 0 mx x [ m + (k )] z k+ k {z } di erent from that of bilateral z-transform 5 + z m X (z)
26 . The linearities for both are, however, the same. ² Ex: Consider a system with () I/O relationship () x [n], n 0, and (3) y [ ]. y [n] y [n ] x [n] ~ Now, applying unilateral transform to both sides of ~ yields 0 Since we have Now, Y (z) Y y [ ] {z } initial output X x [n] z n n0 z + z Y (z) A X (z). X z n n0 z µ y [ ] + z + z z ( z ) z + z z {z } partial fraction expansion z. z! z inverse unilateral z-transform u [n]! z inverse unilateral z-transform à ) y [n] µ! n+ u [n]. µ n u [n] ² Note: Unilateral z-transform is good for analyzing systems described by LCCD equations with nonzero initial conditions (i.e., noncausal output sequence). 6
The Z-Transform. Fall 2012, EE123 Digital Signal Processing. Eigen Functions of LTI System. Eigen Functions of LTI System
The Z-Transform Fall 202, EE2 Digital Signal Processing Lecture 4 September 4, 202 Used for: Analysis of LTI systems Solving di erence equations Determining system stability Finding frequency response
More information8 The Discrete Fourier Transform (DFT)
8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 6: January 30, 2018 Inverse z-transform Lecture Outline! z-transform " Tie up loose ends " Regions of convergence properties! Inverse z-transform " Inspection " Partial
More informationECE503: Digital Signal Processing Lecture 4
ECE503: Digital Signal Processing Lecture 4 D. Richard Brown III WPI 06-February-2012 WPI D. Richard Brown III 06-February-2012 1 / 29 Lecture 4 Topics 1. Motivation for the z-transform. 2. Definition
More information(i) Represent discrete-time signals using transform. (ii) Understand the relationship between transform and discrete-time Fourier transform
z Transform Chapter Intended Learning Outcomes: (i) Represent discrete-time signals using transform (ii) Understand the relationship between transform and discrete-time Fourier transform (iii) Understand
More informationChapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals
z Transform Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals (ii) Understanding the characteristics and properties
More informationSignals and Systems Lecture 8: Z Transform
Signals and Systems Lecture 8: Z Transform Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Winter 2012 Farzaneh Abdollahi Signal and Systems Lecture 8 1/29 Introduction
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 6: January 31, 2017 Inverse z-transform Lecture Outline! z-transform " Tie up loose ends " Regions of convergence properties! Inverse z-transform " Inspection " Partial
More informationy[n] = = h[k]x[n k] h[k]z n k k= 0 h[k]z k ) = H(z)z n h[k]z h (7.1)
7. The Z-transform 7. Definition of the Z-transform We saw earlier that complex exponential of the from {e jwn } is an eigen function of for a LTI System. We can generalize this for signals of the form
More informationDiscrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections
Discrete-Time Signals and Systems The z-transform and Its Application Dr. Deepa Kundur University of Toronto Reference: Sections 3. - 3.4 of John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing:
More information! z-transform. " Tie up loose ends. " Regions of convergence properties. ! Inverse z-transform. " Inspection. " Partial fraction
Lecture Outline ESE 53: Digital Signal Processing Lec 6: January 3, 207 Inverse z-transform! z-transform " Tie up loose ends " gions of convergence properties! Inverse z-transform " Inspection " Partial
More informationSignals and Systems. Spring Room 324, Geology Palace, ,
Signals and Systems Spring 2013 Room 324, Geology Palace, 13756569051, zhukaiguang@jlu.edu.cn Chapter 10 The Z-Transform 1) Z-Transform 2) Properties of the ROC of the z-transform 3) Inverse z-transform
More informationAdvanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis
065-3 Advanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis 6 October - 0 November, 009 Digital Signal Processing The z-transform Massimiliano Nolich DEEI Facolta' di Ingegneria
More informationVery useful for designing and analyzing signal processing systems
z-transform z-transform The z-transform generalizes the Discrete-Time Fourier Transform (DTFT) for analyzing infinite-length signals and systems Very useful for designing and analyzing signal processing
More informationDigital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung
Digital Signal Processing, Homework, Spring 203, Prof. C.D. Chung. (0.5%) Page 99, Problem 2.2 (a) The impulse response h [n] of an LTI system is known to be zero, except in the interval N 0 n N. The input
More informationThe Z transform (2) Alexandra Branzan Albu ELEC 310-Spring 2009-Lecture 28 1
The Z transform (2) Alexandra Branzan Albu ELEC 310-Spring 2009-Lecture 28 1 Outline Properties of the region of convergence (10.2) The inverse Z-transform (10.3) Definition Computational techniques Alexandra
More informationThe Z transform (2) 1
The Z transform (2) 1 Today Properties of the region of convergence (3.2) Read examples 3.7, 3.8 Announcements: ELEC 310 FINAL EXAM: April 14 2010, 14:00 pm ECS 123 Assignment 2 due tomorrow by 4:00 pm
More information6.003: Signals and Systems
6.003: Signals and Systems Z Transform September 22, 2011 1 2 Concept Map: Discrete-Time Systems Multiple representations of DT systems. Delay R Block Diagram System Functional X + + Y Y Delay Delay X
More informationDSP-I DSP-I DSP-I DSP-I
DSP-I DSP-I DSP-I DSP-I Digital Signal Processing I (8-79) Fall Semester, 005 OTES FOR 8-79 LECTURE 9: PROPERTIES AD EXAPLES OF Z-TRASFORS Distributed: September 7, 005 otes: This handout contains in outline
More informationSignal Analysis, Systems, Transforms
Michael J. Corinthios Signal Analysis, Systems, Transforms Engineering Book (English) August 29, 2007 Springer Contents Discrete-Time Signals and Systems......................... Introduction.............................................2
More informationChapter 7: The z-transform
Chapter 7: The -Transform ECE352 1 The -Transform - definition Continuous-time systems: e st H(s) y(t) = e st H(s) e st is an eigenfunction of the LTI system h(t), and H(s) is the corresponding eigenvalue.
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture 4: Inverse z Transforms & z Domain Analysis Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 008 K. E. Barner
More informationLike bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform.
Inversion of the z-transform Focus on rational z-transform of z 1. Apply partial fraction expansion. Like bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform. Let X(z)
More informationSolutions: Homework Set # 5
Signal Processing for Communications EPFL Winter Semester 2007/2008 Prof. Suhas Diggavi Handout # 22, Tuesday, November, 2007 Solutions: Homework Set # 5 Problem (a) Since h [n] = 0, we have (b) We can
More informationSIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals
SIGNALS AND SYSTEMS Unit IV Analysis of DT signals Contents: 4.1 Discrete Time Fourier Transform 4.2 Discrete Fourier Transform 4.3 Z Transform 4.4 Properties of Z Transform 4.5 Relationship between Z
More informationUNIT-II Z-TRANSFORM. This expression is also called a one sided z-transform. This non causal sequence produces positive powers of z in X (z).
Page no: 1 UNIT-II Z-TRANSFORM The Z-Transform The direct -transform, properties of the -transform, rational -transforms, inversion of the transform, analysis of linear time-invariant systems in the -
More informationLecture 04: Discrete Frequency Domain Analysis (z-transform)
Lecture 04: Discrete Frequency Domain Analysis (z-transform) John Chiverton School of Information Technology Mae Fah Luang University 1st Semester 2009/ 2552 Outline Overview Lecture Contents Introduction
More informationECE-S Introduction to Digital Signal Processing Lecture 4 Part A The Z-Transform and LTI Systems
ECE-S352-70 Introduction to Digital Signal Processing Lecture 4 Part A The Z-Transform and LTI Systems Transform techniques are an important tool in the analysis of signals and linear time invariant (LTI)
More informationDigital Signal Processing
Digital Signal Processing The -Transform and Its Application to the Analysis of LTI Systems Moslem Amiri, Václav Přenosil Embedded Systems Laboratory Faculty of Informatics, Masaryk University Brno, Cech
More informationZ-Transform. The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = g(t)e st dt. Z : G(z) =
Z-Transform The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = Z : G(z) = It is Used in Digital Signal Processing n= g(t)e st dt g[n]z n Used to Define Frequency
More informationTopic 4: The Z Transform
ELEN E480: Digital Signal Processing Topic 4: The Z Transform. The Z Transform 2. Inverse Z Transform . The Z Transform Powerful tool for analyzing & designing DT systems Generalization of the DTFT: G(z)
More informationUse: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)}
1 VI. Z Transform Ch 24 Use: Analysis of systems, simple convolution, shorthand for e jw, stability. A. Definition: X(z) = x(n) z z - transforms Motivation easier to write Or Note if X(z) = Z {x(n)} z
More informationDigital Signal Processing, Homework 2, Spring 2013, Prof. C.D. Chung. n; 0 n N 1, x [n] = N; N n. ) (n N) u [n N], z N 1. x [n] = u [ n 1] + Y (z) =
Digital Signal Processing, Homework, Spring 0, Prof CD Chung (05%) Page 67, Problem Determine the z-transform of the sequence n; 0 n N, x [n] N; N n x [n] n; 0 n N, N; N n nx [n], z d dz X (z) ) nu [n],
More informationEE 521: Instrumentation and Measurements
Aly El-Osery Electrical Engineering Department, New Mexico Tech Socorro, New Mexico, USA November 1, 2009 1 / 27 1 The z-transform 2 Linear Time-Invariant System 3 Filter Design IIR Filters FIR Filters
More informationLecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE
OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE EEE 43 DIGITAL SIGNAL PROCESSING (DSP) 2 DIFFERENCE EQUATIONS AND THE Z- TRANSFORM FALL 22 Yrd. Doç. Dr. Didem Kivanc Tureli didemk@ieee.org didem.kivanc@okan.edu.tr
More informationVI. Z Transform and DT System Analysis
Summer 2008 Signals & Systems S.F. Hsieh VI. Z Transform and DT System Analysis Introduction Why Z transform? a DT counterpart of the Laplace transform in CT. Generalization of DT Fourier transform: z
More informationDIGITAL SIGNAL PROCESSING. Chapter 3 z-transform
DIGITAL SIGNAL PROCESSING Chapter 3 z-transform by Dr. Norizam Sulaiman Faculty of Electrical & Electronics Engineering norizam@ump.edu.my OER Digital Signal Processing by Dr. Norizam Sulaiman work is
More informationYour solutions for time-domain waveforms should all be expressed as real-valued functions.
ECE-486 Test 2, Feb 23, 2017 2 Hours; Closed book; Allowed calculator models: (a) Casio fx-115 models (b) HP33s and HP 35s (c) TI-30X and TI-36X models. Calculators not included in this list are not permitted.
More informationLecture 7 Discrete Systems
Lecture 7 Discrete Systems EE 52: Instrumentation and Measurements Lecture Notes Update on November, 29 Aly El-Osery, Electrical Engineering Dept., New Mexico Tech 7. Contents The z-transform 2 Linear
More informationModule 4 : Laplace and Z Transform Problem Set 4
Module 4 : Laplace and Z Transform Problem Set 4 Problem 1 The input x(t) and output y(t) of a causal LTI system are related to the block diagram representation shown in the figure. (a) Determine a differential
More informationEE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley
EE123 Digital Signal Processing Today Last time: DTFT - Ch 2 Today: Continue DTFT Z-Transform Ch. 3 Properties of the DTFT cont. Time-Freq Shifting/modulation: M. Lustig, EE123 UCB M. Lustig, EE123 UCB
More informationSignals & Systems Handout #4
Signals & Systems Handout #4 H-4. Elementary Discrete-Domain Functions (Sequences): Discrete-domain functions are defined for n Z. H-4.. Sequence Notation: We use the following notation to indicate the
More information8. z-domain Analysis of Discrete-Time Signals and Systems
8. z-domain Analysis of Discrete-Time Signals and Systems 8.. Definition of z-transform (0.0-0.3) 8.2. Properties of z-transform (0.5) 8.3. System Function (0.7) 8.4. Classification of a Linear Time-Invariant
More informationDiscrete-Time Fourier Transform (DTFT)
Discrete-Time Fourier Transform (DTFT) 1 Preliminaries Definition: The Discrete-Time Fourier Transform (DTFT) of a signal x[n] is defined to be X(e jω ) x[n]e jωn. (1) In other words, the DTFT of x[n]
More informationEEL3135: Homework #4
EEL335: Homework #4 Problem : For each of the systems below, determine whether or not the system is () linear, () time-invariant, and (3) causal: (a) (b) (c) xn [ ] cos( 04πn) (d) xn [ ] xn [ ] xn [ 5]
More information5 Z-Transform and difference equations
5 Z-Transform and difference equations Z-transform - Elementary properties - Inverse Z-transform - Convolution theorem - Formation of difference equations - Solution of difference equations using Z-transform.
More informationZ-Transform. 清大電機系林嘉文 Original PowerPoint slides prepared by S. K. Mitra 4-1-1
Chapter 6 Z-Transform 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 4-1-1 z-transform The DTFT provides a frequency-domain representation of discrete-time
More informationReview of Discrete-Time System
Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.
More information# FIR. [ ] = b k. # [ ]x[ n " k] [ ] = h k. x[ n] = Ae j" e j# ˆ n Complex exponential input. [ ]Ae j" e j ˆ. ˆ )Ae j# e j ˆ. y n. y n.
[ ] = h k M [ ] = b k x[ n " k] FIR k= M [ ]x[ n " k] convolution k= x[ n] = Ae j" e j ˆ n Complex exponential input [ ] = h k M % k= [ ]Ae j" e j ˆ % M = ' h[ k]e " j ˆ & k= k = H (" ˆ )Ae j e j ˆ ( )
More informationDigital Signal Processing Lecture 3 - Discrete-Time Systems
Digital Signal Processing - Discrete-Time Systems Electrical Engineering and Computer Science University of Tennessee, Knoxville August 25, 2015 Overview 1 2 3 4 5 6 7 8 Introduction Three components of
More informationz-transform Chapter 6
z-transform Chapter 6 Dr. Iyad djafar Outline 2 Definition Relation Between z-transform and DTFT Region of Convergence Common z-transform Pairs The Rational z-transform The Inverse z-transform z-transform
More informationDiscrete Time Systems
1 Discrete Time Systems {x[0], x[1], x[2], } H {y[0], y[1], y[2], } Example: y[n] = 2x[n] + 3x[n-1] + 4x[n-2] 2 FIR and IIR Systems FIR: Finite Impulse Response -- non-recursive y[n] = 2x[n] + 3x[n-1]
More informationNeed for transformation?
Z-TRANSFORM In today s class Z-transform Unilateral Z-transform Bilateral Z-transform Region of Convergence Inverse Z-transform Power Series method Partial Fraction method Solution of difference equations
More informationChapter 13 Z Transform
Chapter 13 Z Transform 1. -transform 2. Inverse -transform 3. Properties of -transform 4. Solution to Difference Equation 5. Calculating output using -transform 6. DTFT and -transform 7. Stability Analysis
More informationUNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 9th, 011 Examination hours: 14.30 18.30 This problem set
More informationTransform analysis of LTI systems Oppenheim and Schafer, Second edition pp For LTI systems we can write
Transform analysis of LTI systems Oppenheim and Schafer, Second edition pp. 4 9. For LTI systems we can write yœn D xœn hœn D X kd xœkhœn Alternatively, this relationship can be expressed in the z-transform
More informationZ Transform (Part - II)
Z Transform (Part - II). The Z Transform of the following real exponential sequence x(nt) = a n, nt 0 = 0, nt < 0, a > 0 (a) ; z > (c) for all z z (b) ; z (d) ; z < a > a az az Soln. The given sequence
More informationSEL4223 Digital Signal Processing. Inverse Z-Transform. Musa Mohd Mokji
SEL4223 Digital Signal Processing Inverse Z-Transform Musa Mohd Mokji Inverse Z-Transform Transform from z-domain to time-domain x n = 1 2πj c X z z n 1 dz Note that the mathematical operation for the
More informationChapter 6: The Laplace Transform. Chih-Wei Liu
Chapter 6: The Laplace Transform Chih-Wei Liu Outline Introduction The Laplace Transform The Unilateral Laplace Transform Properties of the Unilateral Laplace Transform Inversion of the Unilateral Laplace
More informationDiscrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is
Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its
More informationDigital Signal Processing Lecture 9 - Design of Digital Filters - FIR
Digital Signal Processing - Design of Digital Filters - FIR Electrical Engineering and Computer Science University of Tennessee, Knoxville November 3, 2015 Overview 1 2 3 4 Roadmap Introduction Discrete-time
More informationReview of Fundamentals of Digital Signal Processing
Solution Manual for Theory and Applications of Digital Speech Processing by Lawrence Rabiner and Ronald Schafer Click here to Purchase full Solution Manual at http://solutionmanuals.info Link download
More informationDigital Signal Processing:
Digital Signal Processing: Mathematical and algorithmic manipulation of discretized and quantized or naturally digital signals in order to extract the most relevant and pertinent information that is carried
More informationGeneralizing the DTFT!
The Transform Generaliing the DTFT! The forward DTFT is defined by X e jω ( ) = x n e jωn in which n= Ω is discrete-time radian frequency, a real variable. The quantity e jωn is then a complex sinusoid
More informationZ-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1.
84 5. Z-TRANSFORMS 5 z-transforms Solution: Using the definition (5..2), we find: for case (a), and H(z) h 0 + h z + h 2 z 2 + h 3 z 3 2 + 3z + 5z 2 + 2z 3 H(z) h 0 + h z + h 2 z 2 + h 3 z 3 + h 4 z 4
More informationThe z-transform Part 2
http://faculty.kfupm.edu.sa/ee/muqaibel/ The z-transform Part 2 Dr. Ali Hussein Muqaibel The material to be covered in this lecture is as follows: Properties of the z-transform Linearity Initial and final
More informationA system that is both linear and time-invariant is called linear time-invariant (LTI).
The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Lecture Notes: Time, Frequency & Transform Domains February 28, 2012 Signals & Systems Signals are mapped
More informationELEN E4810: Digital Signal Processing Topic 4: The Z Transform. 1. The Z Transform. 2. Inverse Z Transform
ELEN E480: Digital Signal Processing Topic 4: The Z Transform. The Z Transform 2. Inverse Z Transform . The Z Transform Powerful tool for analyzing & designing DT systems Generalization of the DTFT: G(z)
More informationECE-314 Fall 2012 Review Questions for Midterm Examination II
ECE-314 Fall 2012 Review Questions for Midterm Examination II First, make sure you study all the problems and their solutions from homework sets 4-7. Then work on the following additional problems. Problem
More informationDigital Signal Processing Lecture 10 - Discrete Fourier Transform
Digital Signal Processing - Discrete Fourier Transform Electrical Engineering and Computer Science University of Tennessee, Knoxville November 12, 2015 Overview 1 2 3 4 Review - 1 Introduction Discrete-time
More informationDigital Signal Processing. Midterm 1 Solution
EE 123 University of California, Berkeley Anant Sahai February 15, 27 Digital Signal Processing Instructions Midterm 1 Solution Total time allowed for the exam is 8 minutes Some useful formulas: Discrete
More informationReview of Fundamentals of Digital Signal Processing
Chapter 2 Review of Fundamentals of Digital Signal Processing 2.1 (a) This system is not linear (the constant term makes it non linear) but is shift-invariant (b) This system is linear but not shift-invariant
More informationEC Signals and Systems
UNIT I CLASSIFICATION OF SIGNALS AND SYSTEMS Continuous time signals (CT signals), discrete time signals (DT signals) Step, Ramp, Pulse, Impulse, Exponential 1. Define Unit Impulse Signal [M/J 1], [M/J
More informationFourier Transform 4: z-transform (part 2) & Introduction to 2D Fourier Analysis
052600 VU Signal and Image Processing Fourier Transform 4: z-transform (part 2) & Introduction to 2D Fourier Analysis Torsten Möller + Hrvoje Bogunović + Raphael Sahann torsten.moeller@univie.ac.at hrvoje.bogunovic@meduniwien.ac.at
More informationDiscrete-Time Signals and Systems. Frequency Domain Analysis of LTI Systems. The Frequency Response Function. The Frequency Response Function
Discrete-Time Signals and s Frequency Domain Analysis of LTI s Dr. Deepa Kundur University of Toronto Reference: Sections 5., 5.2-5.5 of John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing:
More information信號與系統 Signals and Systems
Spring 2013 Flowchart Introduction (Chap 1) LTI & Convolution (Chap 2) NTUEE-SS10-Z-2 信號與系統 Signals and Systems Chapter SS-10 The z-transform FS (Chap 3) Periodic Bounded/Convergent CT DT FT Aperiodic
More informationDIGITAL SIGNAL PROCESSING UNIT 1 SIGNALS AND SYSTEMS 1. What is a continuous and discrete time signal? Continuous time signal: A signal x(t) is said to be continuous if it is defined for all time t. Continuous
More informationSignals and Systems. Problem Set: The z-transform and DT Fourier Transform
Signals and Systems Problem Set: The z-transform and DT Fourier Transform Updated: October 9, 7 Problem Set Problem - Transfer functions in MATLAB A discrete-time, causal LTI system is described by the
More informationTransform Analysis of Linear Time-Invariant Systems
Transform Analysis of Linear Time-Invariant Systems Discrete-Time Signal Processing Chia-Ping Chen Department of Computer Science and Engineering National Sun Yat-Sen University Kaohsiung, Taiwan ROC Transform
More informationLet H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )
Review: Poles and Zeros of Fractional Form Let H() = P()/Q() be the system function of a rational form. Let us represent both P() and Q() as polynomials of (not - ) Then Poles: the roots of Q()=0 Zeros:
More informationModule 4. Related web links and videos. 1. FT and ZT
Module 4 Laplace transforms, ROC, rational systems, Z transform, properties of LT and ZT, rational functions, system properties from ROC, inverse transforms Related web links and videos Sl no Web link
More informationStability Condition in Terms of the Pole Locations
Stability Condition in Terms of the Pole Locations A causal LTI digital filter is BIBO stable if and only if its impulse response h[n] is absolutely summable, i.e., 1 = S h [ n] < n= We now develop a stability
More informationFrom Wikipedia, the free encyclopedia
Z-transform - Wikipedia, the free encyclopedia Z-transform Page 1 of 7 From Wikipedia, the free encyclopedia In mathematics and signal processing, the Z-transform converts a discrete time domain signal,
More information2.161 Signal Processing: Continuous and Discrete Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Massachusetts
More informationDigital Control & Digital Filters. Lectures 1 & 2
Digital Controls & Digital Filters Lectures 1 & 2, Professor Department of Electrical and Computer Engineering Colorado State University Spring 2017 Digital versus Analog Control Systems Block diagrams
More informationChap 2. Discrete-Time Signals and Systems
Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,
More informationThe Laplace Transform
The Laplace Transform Introduction There are two common approaches to the developing and understanding the Laplace transform It can be viewed as a generalization of the CTFT to include some signals with
More informationECE 8440 Unit 13 Sec0on Effects of Round- Off Noise in Digital Filters
ECE 8440 Unit 13 Sec0on 6.9 - Effects of Round- Off Noise in Digital Filters 1 We have already seen that if a wide- sense staonary random signal x(n) is applied as input to a LTI system, the power density
More informationEE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley
University of California Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences Professors : N.Morgan / B.Gold EE225D Digital Filters Spring,1999 Lecture 7 N.MORGAN
More informationThe Z-transform, like many other integral transforms, can be defined as either a onesided or two-sided transform.
Z-transform Definition The Z-transform, like many other integral transforms, can be defined as either a onesided or two-sided transform. Bilateral Z-transform The bilateral or two-sided Z-transform of
More informationTaylor series - Solutions
Taylor series - Solutions. f(x) sin(x) sin(0) + x cos(0) + x x ( sin(0)) +!! ( cos(0)) + + x4 x5 (sin(0)) + 4! 5! 0 + x + 0 x x! + x5 5! x! + 0 + x5 (cos(0)) + x6 6! ( sin(0)) + x 7 7! + x9 9! 5! + 0 +
More informationThe Laplace Transform
The Laplace Transform Generalizing the Fourier Transform The CTFT expresses a time-domain signal as a linear combination of complex sinusoids of the form e jωt. In the generalization of the CTFT to the
More informationEE102B Signal Processing and Linear Systems II. Solutions to Problem Set Nine Spring Quarter
EE02B Signal Processing and Linear Systems II Solutions to Problem Set Nine 202-203 Spring Quarter Problem 9. (25 points) (a) 0.5( + 4z + 6z 2 + 4z 3 + z 4 ) + 0.2z 0.4z 2 + 0.8z 3 x[n] 0.5 y[n] -0.2 Z
More informationDefinition of the Laplace transform. 0 x(t)e st dt
Definition of the Laplace transform Bilateral Laplace Transform: X(s) = x(t)e st dt Unilateral (or one-sided) Laplace Transform: X(s) = 0 x(t)e st dt ECE352 1 Definition of the Laplace transform (cont.)
More informationLecture 4: FT Pairs, Random Signals and z-transform
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 4: T Pairs, Rom Signals z-transform Wed., Oct. 10, 2001 Prof: J. Bilmes
More informationsummable Necessary and sufficient for BIBO stability of an LTI system. Also see poles.
EECS 206 DSP GLOSSARY c Andrew E. Yagle Fall 2005 absolutely impulse response: h[n] is finite. EX: n=0 ( 3 4 )n = 1 = 4 but 1 3 n=1 1 n. 4 summable Necessary and sufficient for BIBO stability of an LI
More informationDigital Signal Processing. Lecture Notes and Exam Questions DRAFT
Digital Signal Processing Lecture Notes and Exam Questions Convolution Sum January 31, 2006 Convolution Sum of Two Finite Sequences Consider convolution of h(n) and g(n) (M>N); y(n) = h(n), n =0... M 1
More information! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals
ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling
More informationECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION
FINAL EXAMINATION 9:00 am 12:00 pm, December 20, 2010 Duration: 180 minutes Examiner: Prof. M. Vu Assoc. Examiner: Prof. B. Champagne There are 6 questions for a total of 120 points. This is a closed book
More informationDiscrete Time Fourier Transform
Discrete Time Fourier Transform Recall that we wrote the sampled signal x s (t) = x(kt)δ(t kt). We calculate its Fourier Transform. We do the following: Ex. Find the Continuous Time Fourier Transform of
More information