VI. Z Transform and DT System Analysis
|
|
- Clarissa Marshall
- 6 years ago
- Views:
Transcription
1 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 n (re jω ) n Transfer function of LTI system: Laplace transform converts a differential equation y (t) + a y (t) + a 0 y(t) bx(t) to get its transfer function H(s). Z transform converts a difference equation: y[n] α 2 y[n 2] + α y[n ] + βx[n] to get H(z). System stability analysis: poles & zeros 2 Z-transforms. Definition(2-sided Z-transform): X(z) x[n] z n [Ex] If x[n] 3δ[n + ] 2δ[n] + 5δ[n ] + 4δ[n 2] δ[n 3], then its Z-transform X(z) 3z 2 + 5z + 4z 2 z 3 is simply the polynomial(in z ) with coefficients being x[n]. Likewise, if X(z) 3z 2+5z +4z 2 z 3, then we know(by extracting its coefficients before z n ) its inverse Z-transform is x[n] 3δ[n + ] 2δ[n] + 5δ[n ] + 4δ[n 2] δ[n 3]. Note that a less useful Unilateral(one-sided) Z-transform is defined as: X(z) x[n] z n n0 If x[n] is a causal sequence, then two-sided and one-sided Z-transforms are identical. 2. z re jω is a complex variable (recall s σ + jω in the Laplace transform), X(z) x[n]r n e jωn DTFT{r n x[n]} If r, i.e., z e jω, then Z-transform becomes the DTFT (discrete-time Fourier transform): X DTFT (e jω ) x[n]e jωn X Z trans (z) ze jω We may also consider X(z) as the projection of x[n] onto the damped complex exponential r n e jωn, or consider x[n] as a linear combination of many damped complex exponentials r n e jωn. VI -
2 They are some DT sequences whose DTFT do not converge, such as x[n] 2 n u[n]. By imposing a exponential weighting function r n, its Z-transform does exist: X(z) n0 (2z ) n 2z so long as 2z < or r > 2. As a result, Z-transform allows us to perform transform analysis of unstable systems. 3. Inverse Z-transform: x[n] 2πj À X(z)z n dz [Pf] Because X(z) zre jω X(re jω ) DTFT{r n x[n]}, r n x[n] Inverse DTFT {X(re jω )} X(re jω )e jωn dω 2π 2π x[n] X(re jω )(re jω ) n dω 2π 2π because z re jω and dz rje jω dω jzdω Á X(z)z n dz 2πj z Just like Inverse Laplace transform, you need to study the Complex Variables course before solving inverse Z-transform s contour integral. 4. Region of convergence(roc): the values of z in the complex domain for which X(z) converges. [Ex] x[n] α n u[n], then X(z) n0 αn z n αz if αz <. Thus ROC : z > α. Note: For two-sided Z-transform, ROC must be specified to assure unique inverse Z-transform. [Ex] x [n] α n u[n] X (z) x 2 [n] α n u[ n ] X 2 (z) x [n]z n x 2 [n]z n Though X (z) X 2 (z), but ROC ROC 2, and x [n] x 2 [n]. 5. Z-transform Examples: (a) δ[n]. (b) δ[n k] z k. (c) u[n] z, if z >. (d) α n u[n] n0 αn z n n0 (αz ) n αz, if z > α. αz, ROC : z > α αz, ROC 2 : z < α VI - 2
3 3 Properties of Z-transform. Linear: If x [n] X (z) and x 2 [n] X 2 (z), then α x [n] + α 2 x 2 [n] α X (z) + α 2 X 2 (z). [Ex] We know e ±jω 0n u[n] e ±jω 0z, Therefore, the Z-transform of cos ω 0 n u[n] 2 [ejω 0n + e jω 0n ] u[n] is [ ] 2 e jω 0 z + e jω 0 z 2. Time-delay: If x[n] X(z), then x[n m] z m X(z). 2 (e jω 0 + e jω 0 )z 2 (e jω 0 + e jω 0)z + z 2 cos ω 0 z 2cos ω 0 z + z 2 [Pf] Z{x[n m]} x[n m]z n x[n m]z (n m) m z m x[k]z k k z m X(z) For this reason, the delay operator is often represented by a z operator: x[n] Unit Delay y[n] x[n ] is equivalent to (take Z-transform) X(z) z z X(z) As for the -sided Z-transform, if x[n]u[n] X(z), then x[n m]u[n] z m X(z)+z m m k x[ k]z+k. (Proof is omitted.) 3. Convolution: [Pf] x [n] x 2 [n] X (z) X 2 (z) Z{x [n] x 2 [n]} Z{ l x [l]x 2 [n l]} n z n l x [l] x 2 [n l] l l l x [l] x 2 [n l]z n n x [l] z l x 2 [n l]z (n l) n x [l] z l X 2 (z) X (z)x 2 (z) VI - 3
4 [Ex] Recall the polynomial method. Express x[n] δ[n + ] + 2δ[n] + 3δ[n ] and h[n] δ[n] + 2δ[n ] + δ[n 2] as X(z) x[n]z n x[ 2]z 2 + x[ ]z + x[0]z 0 + x[]z + x[2]z 2 + z + 2 z z H(z) h[n]z n h[ 2]z 2 + h[ ]z + h[0]z 0 + h[]z + h[2]z 2 + z z + z 2 Y (z) y[n]z n y[ 2]z 2 + y[ ]z + y[0]z 0 + y[]z + y[2]z 2 + z + 4 z z + 8 z z 3 If y[n] x[n] h[n], then Y (z) X(z) H(z), and y[n] can be found from the coefficients of the polynomial Y (z) X(z) H(z). Thus y[n],4,8,8,3 for n,0,,2,3, respectively. 4. Modulation(Frequency-shift): α n x[n] X(z/α) [Pf] n x[n]αn z n n x[n](α z) n X(z) z:α z X(z/α). [Ex] We know cos ω 0 n u[n] cos ω 0z 2 cos ω 0 z +z 2, thus α n cos ω 0 n u[n] αcos ω 0 z 2α cos ω 0 z +α 2 z 2. This property is useful in designing a BPF from a LPF prototype. (by choosing α as e ±jω 0 ) [Ex] (a) Consider a -point averager with impulse response h [n] u[n ] u[n + ], then its Z-transform is H (z) + z + z z 0 and its frequency response is H (e jω ) H (z) ze jω (b) Now, let h 2 [n] [e jω 0 ] n h [n], then H 2 (z) H (e jω 0 z) ω sin 2 sin ω e j5ω 2 and the frequency response is obtained by (freq-)shifting H (e jω ) to ω 0 : H 2 (e jω ) H (e jω 0 e jω ) H (e j(ω ω 0) ) which is a BPF with midband frequency located at ω 0. (c) If ω 0 π, then h 3 [n] e jπn h [n] ( ) n h [n], and H 3 (z) z + z 2 z z 0 and frequency-shift H (ω) to π: H 3 (e jω ) H (e j(ω π) ) which is a HPF.(note that π is the highest frequency allowed for a digital signal.) VI - 4
5 5. Differentiation: nx[n] z d dz X(z) [Pf] d dz X(z) nx[n] z n z (nx[n])z n. 6. Accumulation(Integration): n x[l] X(z) z l0 [Pf] n l0 x[l] x[n] u[n] X(z)Z{u[n]}. Notice that for a causal sequence x[n], we have x[n] u[n] l0 x[l]u[n l] n l0 x[l]. For continuous-time system, we say that the impulse response of an integrator(y(t) t x(τ)dτ, an LTI system) is a step function u(t), because y(t) u(t) when x(t) δ(t). 7. Conjugation: x [n] X (z ) 8. Time reversal: x[ n] X(/z). 9. Initial value: x[0] lim z X(z). because lim z [x[0] + x[]z + x[2]z 2 + ] x[0]. 0. Final value: x[ ] lim z (z ) X(z), if poles of (z )X(z) are inside the unit circle. [Pf] x[n + ] z{x(z) x[0]} lim (z )X(z) zx[0] lim N n0 N n0 x[n + ] z n (x[n + ] x[n])z n ( as z ) lim (x[n + ] x[0]) N VI - 5
6 4 Inverse Z-transform. Power-series expansion: (a) X(z) e α/z + α z + α2 2! z 2 +, thus x[n] αn n! u[n]. (b) X(z) log(+az ), with z > a, then X(z) ( ) n+ a n z n n n and x[n] ( ) n+ an n u[n]. 2. Long division. If ROC is exterior of circle, then x[n] is right-sided, express X(z) as ratio of polynomials in z and carry out long division(arrange the polynomials in order of,z,z 2,...: X(z) 2 + 2z + z 2 + z, z > X(z) z 2 z 3 + z 4 +. If ROC is interior of circle, then x[n] is left-sided, express X(z) as ratio of polynomials in z X(z) 2 + z + 2z + z + z, z < X(z) + z z2 + z Partial fraction expansion/table look-up X(z) M k0 b kz k N k0 a kz k (a) if M < N and all poles are first-order: X(z) k A k d k z, where d k s are the nonzero poles of X(z), and then A k ( d k z )X(z) zdk, x[n] A k (d k ) n u[n]. k [Ex] (Quadratic form, complex-conjugate poles) 2 + 2z X(z) z + z 2 2( + z ) ( e jπ/3 z )( e jπ/3 z ) partial fraction expansion ( ) ( ) 2+2e jπ/3 2+2e jπ/3 e j2π/3 e jπ/3 z + e j2π/3 e jπ/3 z ( ) + ( ) 2 e jπ/3 e jπ/3 z + 2 e jπ/3 e jπ/3 z x[n] 2e jπ/3 e j(π/3)n u[n] + ( ) 2R{ } 4cos[2π(n )/6]u[n] VI - 6
7 (b) if M N and all first-order poles, M N X(z) B r z r A k + d k z, r0 k where B r s are obtained by long division of the numerator by the denominator. Then M N x[n] B r δ[n r] + A k (d k ) n u[n] [Ex] r0 k X(z) 4 + 3z 2 z z z > 2z 2, + z + + z z x[n] δ[n] + δ[n ] + ( ) n u[n] + 2( 2 )n u[n] (c) if M N and X(z) has a pole of order s at z d i : M N X(z) B r z r A k s + d k z + C m ( d i z ) m, r0 where the coefficients C m are C m (s m)!( d i ) s m k,k i (d) Several poles of multiple orders(omitted). m { d s m [ ( di dw s m w) s X(w ) ] } wd i Note that in carrying out partial fraction expansion for H(z), a technique is commonly used to expand X(z)/z first. Examples are: X(z) z i k i z b i, then X(z) k i i b i, and x[n] z i k ib n i. [Ex] X(z) z(2z2 z+2) (z )(z 2) 3 X(z) z X(z) x[n] Quadratic factor: X(z)/z 2z2 z + 2 (z )(z 2) 3 α z + α 2 (z 2) 3 + α 3 (z 2) 2 + α 4 (z 2) 3 z + 2 (z 2) 3 + (z 2) (z 2) 3 2z 2 + z ( 2z ) 3 + z ( 2z ) ( 2z ) table look up [ n(n ) 3 2 (2) n n 8 2 (2)n + 3(2) ]u[n] n {3 + 4 } [n2 + n 2] (2) n u[n] 2(3z + 7) (z )(z 2 6z + 25) 2 z + Az + B z 2 6z + 25 A 2,B 6 x[n] { (5) n cos[0.927n 2.246]} u[n] VI - 7
8 5 Transfer Functions: H(z). H(z) is defined as the ratio of Z-transforms of the output and the input: H(z) Y (z)/x(z) 2. The system function H(z) is defined as the Z-transform of the impulse response: h[n] H(z). (a) (Pf) because Y (z) H(z)X(z) and y[n] h[n] x[n]. (b) (Pf2) Eigen interpretation(why the system function H(z) is defined as the Z-transform of h[n]): If the input is a complex exponential sequence x[n] z n r n e jωn, y[n] h[n] x[n] h[k]x[n k] k k { k h[k]z (n k) h[k]z k } H(z) z n //x[n] z n We find that z n r n e jωn is an eigenfunction for the LTI system, and H(z) corresponds to its eigenvalue. [Ex] Suppose an LTI system has H(z) + z + 3z 2. Find its output y[n] if x[n] 2 n + (3e j π 2 ) n. (Hint: eigenvectors) y[n] H(z) z2 2 n + H(z) z3e j π 2 (3ej π 4 ) n 9 4 2n The frequency response H(e jω ) is the transfer function H(z) evaluated at z e jω H(e jω ) H(z) ze jω For a system equation: a 0 y[n] + a y[n ] + + a N y[n N] b 0 x[n] + b x[n ] + + b M x[n M] Take Z-transform on the difference equation (note that y[n l] z l Y (z)), (a 0 + a z + + a N z N )Y (z) (b 0 + b z + + b M z M )X(z), then the system function is H(z) Y (z) X(z) M r0 b rz r N k0 a kz k (b 0 M i ) ( c iz ) a N 0 j ( d jz ), where c i s and d j s are zeros and poles, respectively, of H(z). If then H(z) M N r0 B r z r + k A k d k z, VI - 8
9 (a) Impulse response is h[n] M N r0 (b) Magnitude response: B r δ[n r] + A k d n k u[n]. k 20log 0 H(e jω ) 20log 0 b 0 a 0 + (c) Phase response: H(e jω ) [ b0 a 0 M 20log 0 c k e jω k ] M + [ c k e jω ] k [ d k e jω ]. 4. Transfer function H(z) fully characterizes an LTI system, others are: k System equation: constant-coefficient difference equation 20log 0 d k e jω (db). System block diagram: made up with adders, delays, and constant gain elements. Impulse response h[n] to relate i/o as y[n] x[n] h[n] k DTFT Impulse Resp. h[n] Z{ } Z { } Freq. Resp. H(e jω ) Transfer Func H(z) z e jω Diff. Eqn y[n]...x[n] Block Diagram D, gain, Note (a) the real or actual domain is the n domain(time domain) where the signals are generated and processed, and where the implementation of filters takes place. (b) The frequency domain ω has physical significance when analyzing sound, but is seldom used for implementation(fast Fourier transform + multiplications can replace convolution) (c) The z domain exists primarily for its convenience in mathematical analysis and synthesis. 5. Ex [Ref: G.E. Carlson, Signal and Linear System Analysis, Example 4.22](Continued from above, except for zero initial conditions) VI - 9
10 (a) Block diagram(in time-domain or Z-domain): w[n] x[n] 0.25 Delay v[n] 0.4 Delay y[n] note that In general, the state(dummy)-variables w[n] s are placed before or after the delay elements. All loops in a block diagram must have delays. (b) Difference eqn(in time-domain): w[n] 0.25x[n] + 0.4v[n ] v[n] w[n ] + 0.5x[n] + 0.3v[n ] y[n] 0.2v[n ] + 0.x[n] (c) Take Z-transform first(instead of directly finding y[n] in terms of x[n]) W(z) 0.25X(z) + 0.4z V (z) V (z) z W(z) + 0.5X(z) + 0.3z V (z) Y (z) 0.2z V (z) + 0.X(z) which can also be obtained directly from the block diagram in Z-domain. (d) Transfer function: H(z) Y (z) X(z) z + 0.0z 2 0.3z 0.4z 2 Poles are 0.8 and 0.5, both are inside unit-circle. This is a stable causal LTI system. (e) Difference eqn relating y[n] and x[n]: From above Y (z) [ 0.3z 0.4z 2 ] X(z) [ z + 0.0z 2 ] Take Inverse Z-transforms on both sides, y[n] 0.3y[n ] 0.4y[n 2] 0.x[n] x[n ] + 0.0x[n 2] (f) Impulse response h[n] is the inverse Z-transform of H(z): A h[n] Z { 0.8z + A z 0.025} 0.025δ[n] + [A (0.8) n + A 2 ( 0.5) n ] u[n]. 6. If the system function H(z) is known, then we can obtain its difference equation relating y[n] and x[n] as follows: H(z) Y (z) X(z) 4z z + z 2 VI - 0
11 multiply Y (z) and X(z) with the denominator and numerator polynomials, respectively: Y (z) [ 3 2 z + z 2 ] X(z) [ 4z 2 ] Inverse Z-transform on both sides (note that z Y (z) y[n ]) y[n] 3 y[n ] + y[n 2] + x[n] 4x[n 2] 2 7. If an LTI system is stable & causal, then all poles of H(z) must lie inside the unit circle. [Pf] From the inverse Z-transform of partial fraction expansion, a pole at α corresponds to a causal exponential time response α n u[n], hence α < assures stability. H(z) k h[n] k A k α k z, A k α n k u[n] which is causal & stable if α k <, k 8. Inverse systems: Let H i (z) be the inverse of H(z), i.e., H(z)H i (z). (a) If x[n] is the input to H(z) and y[n] x[n] h[n] is its output, obtained from convolution. The purpose of H i (z) is to process y[n] so that x[n] can be recovered: y[n] h i [n] x[n] h[n] h i [n] x[n]. Thus, H(z) acts as a filter of convolution and its inverse filter H i (z) undoes convolution, which is called deconvolution. (e.g., modulation/demodulation, encoder/decoder, preemphasis/deemphasis, etc.) (b) An LTI system H(z) is stable and causal and also has a stable causal inverse if and only if both the poles and zeros of H(z) are inside the unit circle. (Minimum-phase systems) (c) (Ex) Given a channel: h[n] δ[n] + 2δ[n ] H(z) + 2z, we aim to find its inverse g[n] for equalization. i. G (z) 2z + 4z 2 8z 3 + g +2z [n] ( 2) n u[n] is a causal but unstable system. ii. G 2 (z) +2z 2 z 4 z2 + 8 z3 6 z4 + g 2 [n] ( 2) n u[ n ] is a stable but anticausal system. iii. By incorporating a delay of 4 samples and truncation on g 2 [n], a finite-length causal stable equalizer G 3 (z) z 4 z z 3, we find H(z) G 3 (z) 6 +z 4 h[n] g 3 [n] 6δ[n]+δ[n 4], which is very close to an ideal delayed impulse function. iv. We may use the least-squares criterion to design the finite-length equalizer g 4 [n], by expressing the convolution of h[n] and g 4 [n] as g 4 [0] g 4 [] g 4 [2] g 4 [3] From MATLAB, the least-squares solution of Hg d is given by H\d, which is g 4 [n] [ ]. The convolution of h g 4 is [ ], while h g 3 [ ]. The 2-norm distances h g δ[n 4] are and for g 4 and g 3, respectively. VI -
12 6 Pole/Zero plot of H(z). For a rational transfer function H(z) Q(z) P(z) (z q )(z q 2 ) (z q m ) (z p )(z p 2 ) (z p n ) Poles: p,p 2,...,p n, because H(z) zpi H(p i ). Zeros: q,q 2,...,q m, because H(z) zqj H(q j ) The no. of poles equals the no. of zeros, counting all poles/zeros at infinity z and the origin z 0. 2 [Ex] H(z) 2z 0.5z z 0.5 has one pole at 0.5 and one zero at 0. [Ex] H(z) 3 z 0.5 has one pole at 0.5 and one zero at. 3. Poles and Time responses: According to the location of poles of H(z), we can have a rough picture about the behavior of its impulse response h[n]: (a) Single-order pole: p α is real A αz Aαn u[n] (b) Single-order Complex-conjugate poles: p αe jω 0 and p αe jω 0 E + Fz + c z + c 2 z 2 E + Fz ( αe jω 0 z )( αe jω 0 z ) [E (α)n cos ω 0 n + D(α) n sin ω 0 n] u[n] (c) The poles magnitude α determines the signal s exponentially growing/decaying rate in time. Poles close to unit circle z, corresponds to a slow growing( α >, outside unit circle) or decaying( α <, inside unit circle) time sequence. (d) The angles of the complex poles, ω 0, determines the oscillation frequency of the time sequence. (e) For a causal LTI system, all poles must be within unit circle, poles <, to assure BIBO stability. 4. Geometrical evaluation of frequency response H(ω) from the pole/zero plot: H freq resp (e jω ) H transfer func (z) ze jω poles will push up the frequency response zeros will pull down the frequency response Consider a rational system function: M r H(z) K (z z r) N k (z p k) Its frequency response is: M H(e jω r ) K (ejω z r ) M N k (ejω p k ) K ej K r ejω z r e j (ejω z r) N k ejω p k e j (ejω p k ) H(ejω ) e j H(ejω), with VI - 2
13 Magnitude response: H(e jω ) K ejω z e jω z 2 e jω z M e jω p e jω p 2 e jω p N, Phase response: H(e jω ) K + M r (ejω z r ) N k (ejω p k ), 5. Examples: (a) h[n] a n u[n] H(z) z 0 az z a, then H(ω) H(z) ze jω z zero z pole I(z) ze jω zero vector vector from unit-circle to zero pole vector vector from unit-circle to pole z e jω pole-vector zero-vector R(z) unit circle (b) H (z) z is a HPF, H +0.9z 2 (z) +0.8z a LPF, H ( 0.9z ) 2 3 (z) a BPF. +0.8z 2 (c) Multiple poles and zeros: i. Magnitude response is raised(suppressed) by poles(zeros): ii. Higher-order IIR filters can realize frequency responses with flatter passband and stopbands(less ripples) and sharper transition bands. 0.8 a[0.6, *j, *j]; b[, j,j]; zplane(poly(b),poly(a)); Imaginary Part Real Part VI - 3
14 4 magnitude response 2 0 amplitude a[0.6, *j, *j]; b[, j,j]; w pi:0.0:pi; hfreqz(poly(b),poly(a),w); plot(w/pi,abs(h)) title( magnitude response ); xlabel( w/pi );ylabel( amplitude ); w/pi 7 Z sided -Transform and Difference Eqns with Initial Conditions [Ex] Find the output of an LTI system: y[n] 5y[n ] + 6y[n 2] 3x[n ] + 5x[n 2] with initial conditions: y[ ] /6,y[ 2] 37/36 and a causal input sequence x[n] 2 n u[n]. [Sol] Take Z-transform on both sides, and note that y[n] u[n] y[n ] u[n] y[n 2] u[n] Y (z) z Y (z) + y[ ] z 2 Y (z) + z y[ ] + y[ 2] Thus, ( 5z + 6z 2) Y (z) 5y[ ] + 6z y[ ] + 6y[ 2] 3z X(z) + 5z 2 X(z) Y (z) 5y[ ] 6z y[ ] 6y[ 2] 3z + 5z 2 } 5z {{ + 6z 2 + } 5z X(z) + 6z 2 }{{} Y ZIR (z):zero-input response Y ZSR (z):zero-state response Plug in the initial conditions y[ ],y[ 2] and the input X(z) (/2)z, Y (z) Y (z) z y[n] 3 z 5z + 6z 2 + 3z + 5z 2 5z + 6z 2 0.5z 26/5 z 0.5 7/3 z 2 + 8/5 z 3 [ 26 5 ( 2 ) n 7 3 (2)n (3)n ] u[n] VI - 4
15 8 Transient and Steady-State Responses Suppose H(z) b 0 a z.. Complex sinusoidal input(eigenfunction): If x[n] e jω 0n, then y[n] H(e jω 0 )e jω 0n 2. Causal(truncated) complex sinusoidal input: If x[n] e jω 0n u[n], X(z) e jω 0 z Y (z) H(z)X(z) partial fraction expansion b 0 a y[n] a e jω b 0 an 0 u[n] + a e jω ejω 0n u[n] 0 transient response + H(e jω 0 ) x[n] as long as the pole falls into the unit circle a <. b 0 a b 0 a e jω 0 a z + a e jω 0 e jω 0 z 3. For any N th order IIR system with a causal sinusoidal input x[n] e jω 0n u[n], its output can be written as y[n] A k p n k u[n] + H(ejω 0 ) e jω0n u[n] k p k < n H(e jω 0 ) e jω 0n VI - 5
y[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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationUniversity of Illinois at Urbana-Champaign ECE 310: Digital Signal Processing
University of Illinois at Urbana-Champaign ECE 0: Digital Signal Processing Chandra Radhakrishnan PROBLEM SET : SOLUTIONS Peter Kairouz Problem. Hz z 7 z +/9, causal ROC z > contains the unit circle BIBO
More information7.17. Determine the z-transform and ROC for the following time signals: Sketch the ROC, poles, and zeros in the z-plane. X(z) = x[n]z n.
Solutions to Additional Problems 7.7. Determine the -transform and ROC for the following time signals: Sketch the ROC, poles, and eros in the -plane. (a) x[n] δ[n k], k > 0 X() x[n] n n k, 0 Im k multiple
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 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 informationX (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ω
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
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 informationCh. 7: Z-transform Reading
c J. Fessler, June 9, 3, 6:3 (student version) 7. Ch. 7: Z-transform Definition Properties linearity / superposition time shift convolution: y[n] =h[n] x[n] Y (z) =H(z) X(z) Inverse z-transform by coefficient
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 informationECE 421 Introduction to Signal Processing
ECE 421 Introduction to Signal Processing Dror Baron Assistant Professor Dept. of Electrical and Computer Engr. North Carolina State University, NC, USA The z-transform [Reading material: Sections 3.1-3.3]
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 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 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 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 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 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 informationThe 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 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 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 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 informationDiscrete Time Systems
Discrete Time Systems Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz 1 LTI systems In this course, we work only with linear and time-invariant systems. We talked about
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 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 informationDiscrete-time signals and systems
Discrete-time signals and systems 1 DISCRETE-TIME DYNAMICAL SYSTEMS x(t) G y(t) Linear system: Output y(n) is a linear function of the inputs sequence: y(n) = k= h(k)x(n k) h(k): impulse response of the
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 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 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 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 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 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 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 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 informationZ-Transform. x (n) Sampler
Chapter Two A- Discrete Time Signals: The discrete time signal x(n) is obtained by taking samples of the analog signal xa (t) every Ts seconds as shown in Figure below. Analog signal Discrete time signal
More informationECE503: Digital Signal Processing Lecture 5
ECE53: Digital Signal Processing Lecture 5 D. Richard Brown III WPI 3-February-22 WPI D. Richard Brown III 3-February-22 / 32 Lecture 5 Topics. Magnitude and phase characterization of transfer functions
More informationDepartment of Electrical and Computer Engineering Digital Speech Processing Homework No. 6 Solutions
Problem 1 Department of Electrical and Computer Engineering Digital Speech Processing Homework No. 6 Solutions The complex cepstrum, ˆx[n], of a sequence x[n] is the inverse Fourier transform of the complex
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 informationFrequency-Domain C/S of LTI Systems
Frequency-Domain C/S of LTI Systems x(n) LTI y(n) LTI: Linear Time-Invariant system h(n), the impulse response of an LTI systems describes the time domain c/s. H(ω), the frequency response describes the
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 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 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 informationQUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)
QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) 1. For the signal shown in Fig. 1, find x(2t + 3). i. Fig. 1 2. What is the classification of the systems? 3. What are the Dirichlet s conditions of Fourier
More informationSignals and Systems. VTU Edusat program. By Dr. Uma Mudenagudi Department of Electronics and Communication BVCET, Hubli
Signals and Systems Course material VTU Edusat program By Dr. Uma Mudenagudi uma@bvb.edu Department of Electronics and Communication BVCET, Hubli-580030 May 22, 2009 Contents 1 Introduction 1 1.1 Class
More informationSignals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions
8-90 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 08 Midterm Solutions Name: Andrew ID: Problem Score Max 8 5 3 6 4 7 5 8 6 7 6 8 6 9 0 0 Total 00 Midterm Solutions. (8 points) Indicate whether
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 informationLecture 9 Infinite Impulse Response Filters
Lecture 9 Infinite Impulse Response Filters Outline 9 Infinite Impulse Response Filters 9 First-Order Low-Pass Filter 93 IIR Filter Design 5 93 CT Butterworth filter design 5 93 Bilinear transform 7 9
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 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 informationGATE EE Topic wise Questions SIGNALS & SYSTEMS
www.gatehelp.com GATE EE Topic wise Questions YEAR 010 ONE MARK Question. 1 For the system /( s + 1), the approximate time taken for a step response to reach 98% of the final value is (A) 1 s (B) s (C)
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 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 informationSolutions. Number of Problems: 10
Final Exam February 4th, 01 Signals & Systems (151-0575-01) Prof. R. D Andrea Solutions Exam Duration: 150 minutes Number of Problems: 10 Permitted aids: One double-sided A4 sheet. Questions can be answered
More informationDigital Filters. Linearity and Time Invariance. Linear Time-Invariant (LTI) Filters: CMPT 889: Lecture 5 Filters
Digital Filters CMPT 889: Lecture 5 Filters Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University October 7, 29 Any medium through which a signal passes may be regarded as
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 informationA.1 THE SAMPLED TIME DOMAIN AND THE Z TRANSFORM. 0 δ(t)dt = 1, (A.1) δ(t)dt =
APPENDIX A THE Z TRANSFORM One of the most useful techniques in engineering or scientific analysis is transforming a problem from the time domain to the frequency domain ( 3). Using a Fourier or Laplace
More informationThe Discrete-Time Fourier
Chapter 3 The Discrete-Time Fourier Transform 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 3-1-1 Continuous-Time Fourier Transform Definition The CTFT of
More informationCMPT 889: Lecture 5 Filters
CMPT 889: Lecture 5 Filters Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University October 7, 2009 1 Digital Filters Any medium through which a signal passes may be regarded
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 informationQuestion Paper Code : AEC11T02
Hall Ticket No Question Paper Code : AEC11T02 VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad Four Year B. Tech III Semester Tutorial Question Bank 2013-14 (Regulations: VCE-R11)
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 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 informationEE 224 Signals and Systems I Review 1/10
EE 224 Signals and Systems I Review 1/10 Class Contents Signals and Systems Continuous-Time and Discrete-Time Time-Domain and Frequency Domain (all these dimensions are tightly coupled) SIGNALS SYSTEMS
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 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 informationHow to manipulate Frequencies in Discrete-time Domain? Two Main Approaches
How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches Difference Equations (an LTI system) x[n]: input, y[n]: output That is, building a system that maes use of the current and previous
More informationLECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)
LECTURE NOTES ON DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13) FACULTY : B.V.S.RENUKA DEVI (Asst.Prof) / Dr. K. SRINIVASA RAO (Assoc. Prof) DEPARTMENT OF ELECTRONICS AND COMMUNICATIONS
More informationDigital Signal Processing: Signal Transforms
Digital Signal Processing: Signal Transforms Aishy Amer, Mohammed Ghazal January 19, 1 Instructions: 1. This tutorial introduces frequency analysis in Matlab using the Fourier and z transforms.. More Matlab
More informationDiscrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz
Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W.
More informationECE 301 Division 1, Fall 2008 Instructor: Mimi Boutin Final Examination Instructions:
ECE 30 Division, all 2008 Instructor: Mimi Boutin inal Examination Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out the requested
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 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 information23 Mapping Continuous-Time Filters to Discrete-Time Filters
23 Mapping Continuous-Time Filters to Discrete-Time Filters Solutions to Recommended Problems S23.1 (a) X,(z) = - 1-2z 2 Z i. (b) X 2 (z) = 0 (-3)"z = (-3)-"z" 1 z 3-'z < 1, n=o
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 informationEE 3054: Signals, Systems, and Transforms Spring A causal discrete-time LTI system is described by the equation. y(n) = 1 4.
EE : Signals, Systems, and Transforms Spring 7. A causal discrete-time LTI system is described by the equation Test y(n) = X x(n k) k= No notes, closed book. Show your work. Simplify your answers.. A discrete-time
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture : Design of Digital IIR Filters (Part I) Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 008 K. E. Barner (Univ.
More informationUNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 1th, 016 Examination hours: 14:30 18.30 This problem set
More informationAnalog vs. discrete signals
Analog vs. discrete signals Continuous-time signals are also known as analog signals because their amplitude is analogous (i.e., proportional) to the physical quantity they represent. Discrete-time signals
More informationINFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters 4. THE BUTTERWORTH ANALOG FILTER
INFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters. INTRODUCTION 2. IIR FILTER DESIGN 3. ANALOG FILTERS 4. THE BUTTERWORTH ANALOG FILTER 5. THE CHEBYSHEV-I
More informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 3 Signals & Systems Prof. ark Fowler Note Set #28 D-T Systems: DT Filters Ideal & Practical /4 Ideal D-T Filters Just as in the CT case we can specify filters. We looked at the ideal filter for the
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