Discrete Time Systems

Size: px
Start display at page:

Download "Discrete Time Systems"

Transcription

1 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 2 FIR and IIR Systems FIR: Finite Impulse Response -- non-recursive y[n] = 2x[n] + 3x[n-1] + 4x[n-2] IIR: Infinite Impulse Response -- recursive y[n] = 0.5y[n-1] + 2x[n] + 3x[n-1]

3 3 Sample by Sample Processing y[n] = 0.5y[n-1] + 2x[n] + 3x[n-1] y[n] = 0.5w[n] + 3x[n] + 4v[n] w[n+1] = y[n] v[n+1] = x[n] For each new input x DO y = 0.5w + 2x + 3v w = y v = x CONTINUE

4 4 Linearity x 1 [n] a 1 x 2 [n] + x[n] H y[n] a 2 y[n] = a 1 y 1 [n]+ a 2 y 2 [n] x 1 [n] H y 1 [n] a 1 x 2 [n] H y 2 [n] a 2 + a 1 y 1 [n]+ a 2 y 2 [n]

5 5 Time-Invariance x[n] H y[n] D y[n-d] x[n] D x D [n] x[n-d] H y D [n] y D [n] = y[n-d]

6 6 Impulse Response of an LTI System δ[n] = 1, for n=0, and 0, otherwise δ[n] n H h[n] n For any input x[n], the output y[n] is given by y[n] = Σ m x[m]h[n-m] = Σ m h[m]x[n-m] (direct form)

7 7 Convolution δ[n] h[n] n δ[n-1] H h[n-1] n n δ[n-2] H h[n-2] n n H n x[n] = x[0]δ[n] + x[1]δ[n-1] + x[2]δ[n-2] + y[n] = x[0]h[n] + x[1]h[n-1] + x[2]h[n-2] +

8 8 FIR and IIR Filters An FIR filter has impulse response, h[n], that extends only over a finite time interval, say 0 n M, and is identically zero beyond that: {h[0], h[1], h[2], h[m], 0,0,0,0,0,0..} M is the filter order, and the length of the filter impulse response is M+1. An IIR filter, on the other hand, has impulse response, h[n], of infinite duration, 0 n, and is identically zero beyond that: {h[0], h[1], h[2], h[m], h[m+1],..} The convolution sum is not computationally feasible, hence it is normally represented by a constant-coefficient linear difference equation.

9 9 I/O Difference Equation Impulse Response: h[n] FIR filter: convolution sum IIR Filter: difference equation y[n] = ay[n-1] + x[n] h[n] = a n u[n]

10 10 Causality and Stability A causal sequence is a right-sided sequence, and an anti-causal sequence is a left-sided sequence. A two-sided sequence is mixed. An LTI system is causal if its impulse response, h[n], is causal. An LTI system is stable if for any bounded input sequence, the output sequence is also bounded. An LTI system is stable if and only if its impulse response is absolutely summable, i.e., Σ n h[n] <

11 11 Linear Convolution: Flip & Slide y[n] = Σ m x[m]h[n-m] If h is of order M, i.e., h = {h[0], h[1],, h[m]} is of length M+1 and x = {x[0], x[1],,x[l-1]} is of length L, then y[n] = Σ m=max(0,n-m) min(n,l-1) x[m]h[n-m] and y = {y[0], y[1],,y[l+m]} is of length (L+M)

12 12 Linear Convolution: Flip & Slide h 3 h 2 h 1 h 0 h 3 h 2 h 1 h 0 h 3 h 2 h 1 h x 0 x 1 x 2 x 3 x n-3 x n-2 x n-1 x n x L y 0 y n y L-1+M h = M+1 x = L y = h*x = L M

13 13 Transient & Steady State y[n] = Σ n m=0 h[m]x[n-m] if 0 n < M y[n] = Σ M m=0 h[m]x[n-m] if M n L-1 y[n] = Σ M m=n-l+1 h[m]x[n-m] if L n < L+M output y[n] 0 M L-1 L-1+M n

14 14 Convolution of Infinite Sequence y[n] = Σ m=max(0,n L+1) min(n,m) h[m]x[n-m] Infinite filter, finite input: M =, L < y[n] = Σ n m=max(0,n L+1) h[m]x[n-m] Finite filter, infinite input: M <, L = y[n] = Σ min(n,m) m=0 h[m]x[n-m] Infinite filter, infinite input: M =, L = y[n] = Σ n m=0 h[m]x[n-m]

15 15 Finite filter, Infinite input Block Processing y 0 = h*x 0, y 1 = h*x 1, y 2 = h*x 2, x = block x 0 block x 1 block x 2 y 0 = L M y 1 = L M y 2 = L M

16 16 Finite filter, Infinite input Sample Processing y[n] = Σ m=max(0,n L+1) n h[m]x[n-m] = h[0]x[n] + h[1]x[n-1] +. h[m]x[n-m] FOR each input x DO w 0 = x y = h 0 w 0 + h 1 w 1 + h 2 w h M w M w M = w M-1 w M-1 = w M-2 w1 = w 0

17 17 Circular Buffers x h 0 w 0 y h 1 w 1 h 2 w 2 h 3 w 3 MAC: Multiply & Accumulate X Σ

18 18 Z-Transform {x[n], n = -, } X(z) = Σ n=- x[n]z -n = +x[-2]z 2 +x[-1]z 1 +x[0] +x[1]z -1 +x[2]z -2 + Z-transform of the impulse response h[n] H(z) = Σ n=- h[n]z -n is called the Transfer function of the LTI system.

19 19 Basic Properties of Z-transform Linearity: a 1 x 1 [n] + a 2 x 2 [n] Z a 1 X 1 (z) + a 2 X 2 (z) Delay: x[n-d] Z z -D X(z) Convolution: y[n] = h[n]*x[n] Z Y(z) = H(z) X(z)

20 20 Z-transform Examples δ[n] δ[n-m] u[n] a n u[n] Z Z Z Z 1 z -M 1/(1- z -1 ) for z > 1 1/(1- a z -1 ) for z > a

21 21 ROC: Region of Convergence ROC: Region of z C (complex plane) where X(z) Examples: (0.5) n u[n] X(z) = 1/(1-0.5z -1 ) if z > 0.5 -(0.5) n u[-n-1] X(z) = 1/(1-0.5z -1 ) if z < 0.5 In general a n u[n] X(z) = 1/(1-a z -1 ) if z > a -a n u[-n-1] X(z) = 1/(1-a z -1 ) if z < a

22 22 Region of Convergence: Example X(z) = 1/(1-0.8z -1 ) + 1/(1-1.25z -1 ) = (2-2.05z -1 )/(1-2.05z -1 + z -2 ) I II III Z-plane

23 23 Causal Sequence & ROC: Poles X(z) = A 1 /(1-p 1 z -1 ) + A 2 /(1-p 2 z -1 ) +.. A k /(1-p k z -1 ) + ROC: z > max p k Z-plane Causal ROC causal sequence = right-sided sequence = ROC is outside of a circle

24 24 Anti-Causal Sequence & ROC X(z) = A 1 /(1-p 1 z -1 ) + A 2 /(1-p 2 z -1 ) +.. A k /(1-p k z -1 ) + Z-plane ROC: z < min p k Anti-Causal ROC Anti-causal sequence = left-sided sequence = ROC is inside of a circle

25 25 Two-sided Sequence & ROC X(z) = A 1 /(1-p 1 z -1 ) + A 2 /(1-p 2 z -1 ) +.. A k /(1-p k z -1 ) + Z-plane Mixed ROC mixed sequence two-sided sequence = ROC is inside of a ring

26 26 Stability of a Sequence and ROC Stable Sequence = ROC contains the UNIT CIRCLE If H is stable, i.e., Σ n=- h[n] < Then on the unit circle, i.e., z =1 H(z) = Σ n=- h[n]z -n Σ n=- h[n]z -n = Σ n=- h[n] < Therefore, its ROC contain the unit circle. If H(z) s ROC contains the unit circle Then Σ n=- h[n]z -n z =1 = Σ n=- h[n] < Therefore, H is stable.

27 27 Stable and Causal Sequence Stable and Causal: All poles are inside the unit circle Z-plane Causal ROC unit circle

28 28 Stable and Anti-Causal Sequence Stable and Anti-Causal: All poles are outside the unit circle unit circle Z-plane Anti-Causal ROC

29 29 Stable and Two-sided Sequence Stable and Two-sided:Some poles are outside the unit circle Some poles are inside the unit circle unit circle Z-plane Mixed ROC

30 30 Stable System An LTI system is stable if and only if H(z) s ROC contains the unit circle.

31 31 Inverse Z-transform By inspection: First order sequence/system X(z) = 1/(1-a z -1 ) if z > a X(z) = 1/(1-a z -1 ) if z < a x[n] = a n u[n] x[n] = -a n u[-n-1] Second order sequence/system X(z) =A 1 /(1-p 1 z -1 ) + A 1* /(1-p 1 * z -1 ) if z > p 1 where A 1 = B 1 e jα 1 and p 1 = R 1 e jω 1 x[n] = 2B 1 R 1 n cos(nω 1 +α 1 )u[n] X(z) = [2B 1 cos(α 1 )-2B 1 R 1 cos(α 1 -ω 1 ) z -1 ]/[1-2R 1 cos(ω 1 ) z -1 +R 1 2 z -2 ]

32 32 Inverse Z-transform Partial Fraction Expansion: X(z) = N(z)/D(z) N(z) is of degree N & D(z) is of degree M, M<N, Real Roots = N(z)/(1-p 1 z -1 )(1-p 2 z -1 ).. /(1-p M z -1 ) = A 1 /(1-p 1 z -1 )+ A 2 /(1-p 2 z -1 )+. A M /(1-p M z -1 ) A k = (1-p k z -1 )X(z) z=pk N(z) is of degree N & D(z) is of degree M, M<N, Complex Roots X(z) = Σ k [A k /(1-p k z -1 ) + A k* /(1-p k * z -1 )] N(z) is of degree N & D(z) is of degree M, M<N, Multiple Roots N(z) is of degree N & D(z) is of degree M, M N, Complex Roots

33 33 Frequency Response & Z-Transform The DTFT (Discrete-Time Fourier Transform) X(ω) = Σ n=- x[n]e -jωn X(z) = Σ n=- x[n]z -n X(ω) = X(z) z=e jω The Inverse DTFT x[n] = (1/2π) π π X(ω)e jωn dω The Frequency Response of the LTI System H(ω) = Σ n=- h[n]e -jωn Y(ω)= H(ω)X(ω)

34 34 Parseval Theorem Σ n=- x[n] 2 = (1/2π) π π X(ω) 2 dω Digital measurement of energy of an analog signal Σ n=- x[n] 2 = (1/2π) π π X(ω) 2 dω = (1/2π)(1/T) X(Ω) 2 dω =(1/T) x(t) 2 dt Total energy = (T)Σ n=- x[n] 2

35 35 Frequency Response & Pole/Zero Locations X(z) = (1-z 1 z -1 )/(1-p 1 z -1 ) X(ω) = (e jω -z 1 )/(e jω -p 1 ) X(ω) = (e jω -z 1 ) / (e jω -p 1 ) p 1 = p 1 e jφ z 1 = z 1 e jθ X(ω) p 1 e jω z 1 θ φ ω

36 36 Transfer Function of an LTI System Impulse Response h[n] I/O Difference Equation Frequency Response Specification Transfer Function H(z) Filter Design I/O Convolution Equation Block Processing Pole/zero Pattern Block Diagram Realization Sample Processing

37 37 An Example Transfer Function: H(z) = (5+2z -1 )/(1-0.8z -1 ) Impulse Response: H(z) = /(1-0.8z -1 ) h[n] = -2.5δ[n] + 7.5(0.8) n u[n] Difference Equation: H(z) = (5+2z -1 )/(1-0.8z -1 ) = Y(z)/X(z) Y(z) 0.8z -1 Y(z) = 5X(z) +2z -1 X(z) y[n] = 0.8y[n-1] + 5x[n] + 2x[n-1] Block Diagram: Y(z)/X(z) = (5+2z -1 )/(1-0.8z -1 )

38 38 An Example - Continued Block Diagram: Y(z)/X(z) = (5+2z -1 )/(1-0.8z -1 ) x[n] 5 + y[n] z -1 z -1 x[n-1] y[n-1]

39 39 An Example - Continued Frequency Response: H(z) = (5+2z -1 )/(1-0.8z -1 ) =5(1+0.4z -1 )/(1-0.8z -1 ) H(ω) =5 (1+0.4e -jω )/(1-0.8e -jω ) Using the identity: 1-ae -jω = [1-2a cos(ω)+a 2 ] 1/2 H(ω) = 5 [1-0.8 cos(ω)+0.16] 1/2 /[1-1.6 cos(ω)+0.64] 1/ H(ω) π 5/3 ω

40 40 Direct & Canonical Forms H(z) = N(z)/D(z) = (b 0 + b 1 z -1+ b 2 z b L z -L )/(1+ a 1 z -1+ a 2 z a M z -M ) Y(z)/X(z) = (b 0 + b 1 z -1+ b 2 z b L z -L )/(1+ a 1 z -1+ a 2 z a M z -M ) Y(z)= X(z)(b 0 + b 1 z -1+ b 2 z b L z -L )/(1+ a 1 z -1+ a 2 z a M z -M ) = X(z)(b 0 + b 1 z -1+ b 2 z b L z -L ) [1/(1+ a 1 z -1+ a 2 z a M z -M )] Direct Form = X(z)/(1+ a 1 z -1+ a 2 z a M z -M ) [(b 0 + b 1 z -1+ b 2 z b L z -L )] Canonical Form

41 41 Direct Form Y(z)= X(z)(b 0 + b 1 z -1+ b 2 z b L z -L ) [1/(1+ a 1 z -1+ a 2 z a M z -M )] x[n] b 0 + y[n] z -1 z -1 x[n-1] z -1 b 1 -a 1 z -1 y[n-1] x[n-2] b 2 -a 2 y[n-2] x[n-l] z -1 b L -a M z -1 y[n-m]

42 42 Canonical Form Y(z)= X(z)/(1+ a 1 z -1+ a 2 z a M z -M ) [(b 0 + b 1 z -1+ b 2 z b L z -L )] x[n] + w[n] b 0 z -1 + w[n-1] y[n] -a 1 b 1 z -1 -a 2 b 2 b L z -1 -a M

43 43 Examples Example: Impulse response: h = {1, 6, 11, 6} Difference equation: y[n] = x[n] + 6x[n-1] +11x[n-2] +6x[n-3] Transfer Function: H(z) = 1+ 6z z z -3 Pole/Zeros: H(z) = (1+z -1 )(1+2z -1 )(1+3z -1 ) Frequency Response, Block Diagrams Examples: (a) Difference equation: (b) Difference equation: y[n] = 0.25 y[n-2] + x[n] y[n] = y[n-2] + x[n]

44 44 Sinusoidal Steady State Response x[n] = e jω o n DTFT: X(ω) = 2π δ(ω ω ο ) + replicas Y(ω) = H(ω)X(ω) = H(ω ο )2π δ(ω ω ο ) + replicas y[n] = H(ω ο ) e jω o n i.e., e jω o n H H(ω ο ) e jω o n = H(ω ο ) e j(ω o n+arg[h(ω o )]) cos(nω ο ) H H(ω ο ) cos(nω ο + Arg[H(ω o )] ) sin(nω ο ) H H(ω ο ) sin(nω ο + Arg[H(ω o )] ) Linearity Ae jω 1 n +Be jω 2 n H A H(ω 1 ) e jω 1 n +B H(ω 2 ) e jω 2 n

45 45 Sinusoidal Transient Response Input: x[n] = e jω o n u[n] : X(z) = 1/(1- e jω o z -1 ) LTI system: H(z) = N(z)/D(z) (assuming real poles) = N(z)/(1-p 1 z -1 )(1-p 2 z -1 )..(1-p M z -1 ) all p k < 1, k = 1, 2,., M Output: Y(z) = X(z)H(z) = N(z)/(1- e jω o z -1 )(1-p 1 z -1 )(1-p 2 z -1 )..(1-p M z -1 ) = H(ω ο ) /(1- e jω o z -1 ) + A 1 /(1-p 1 z -1 ) + A 2 /(1-p 2 z -1 ) +.. A M /(1-p M z -1 ) y[n] = {H(ω ο ) e jω o n + A 1 p 1n + A 2 p 2n +.. A M p Mn }u[n] as n y[n] H(ω ο ) e jω o n

46 46 Sinusoidal Transient Response Example: H(z) = (5+2z -1 )/(1-0.8z -1 ) Y(z) = (5+2z -1 )/(1- e jω o z -1 )(1-0.8z -1 ) Observation: 1. Stability of the Filter 2. Effective Time Constant: n eff ρ = max k p k, ρ n eff = ε n eff = ln(ε )/ln(ρ) Example 6.3.2

47 47 Unit Step Response Input: x[n] = e jω o n u[n], ω ο = 0 : X(z) = 1/(1- z -1 ) LTI system: H(z) = N(z)/D(z) (assuming real poles) = N(z)/(1-p 1 z -1 )(1-p 2 z -1 ).. /(1-p M z -1 ) all p k < 1, k = 1, 2,., M Output: Y(z) = X(z)H(z) = N(z)/(1-z -1 )(1-p 1 z -1 )(1-p 2 z -1 )..(1-p M z -1 ) = H(1) /(1- z -1 ) + A 1 /(1-p 1 z -1 ) + A 2 /(1-p 2 z -1 ) +.. A M /(1-p M z -1 ) y[n] = {H(1) + A 1 p 1n + A 2 p 2n +.. A M p Mn }u[n] as n y[n] H(1)u[n] H(1) = Σ n=0 h[n] is the DC gain

48 48 Pole/Zero Designs First Order Filter H(z) = G(1+bz -1 )/(1-az -1 ) H(0), H(π), and speed of response n eff H(0) =G(1+b)/(1-a), H(π) = G(1-b)/(1+a) H(π) / H(0) = (1-b)(1-a)/(1+b)(1+a) a = ε 1/n eff Example H(z) = (5+2z -1 )/(1-0.8z -1 ) = 5(1+0.4z -1 )/(1-0.8z -1 )

49 49 Second-Order Filter & Resonator Z-Plane ω o Re jω o H(z) = G/(1- Re jω o z -1 )(1- Re -jω oz -1 ) = G/(1-2Rcos(ω o )z -1 + R 2 z -2 ) Unit circle Re -jω o H(ω) = G/(1- Re jω o e -jω )(1- Re -jω oe -jω ) G: normalize H(ω o ) = 1

50 50 Second-Order Filter & Resonator H(ω) 2 = G/(1-2Rcos(ω ω o ) + R 2 )(1-2Rcos(ω+ω o ) + R 2 ) 1 1/2 H(ω) 2 ω o ω (3 db bandwidth) π ω ω 2(1-R)

51 51 Second-Order Filter & Resonator Transfer Function: H(z) = G/(1-2Rcos(ω o ) z -1 + R 2 z -2 ) Impulse Response: h[n] = [G/sin(ω o )] R n sin(nω o ) Difference Equation: y[n] = 2Rcos(ω o )y[n-1] - R 2 y[n-2] Gx[n] x[n] G + y[n] z -1 a 1 = -2Rcos(ω o ) a 2 = R 2 -a 1 -a 2 z -1 y[n-1] y[n-2]

52 52 Second-Order Filter & Resonator Example: Design a 2-pole resonator filter with peak frequency f o = 500 Hz, and 3-dB bandwidth f = 32 Hz. The sampling frequency is f s = 10KHz. R = 0.99, G = , a 1 = and a 2 = H(z) = /( z z -2 )

53 53 Parametric Equalizer Unit circle ω o Re jω o p 1 =R e jω o z 1 =r e jω o p 1* =R e -jω o z 1* =r e -jω o Z-Plane Re -jω o H(z) = (1- re jω o z -1 )(1- re -jω oz -1 ) /(1- Re jω o z -1 )(1- Re -jω oz -1 ) = (1 + b 1 z -1 + b 2 z -2 )/(1 + a 1 z -1 + a 2 z -2 ) a 1 = -2Rcos(ω o ), a 2 = R 2 b 1 = -2rcos(ω o ), b 2 = r 2 H(z) = (1 + b 1 z -1 + b 2 z -2 )/(1 + (R/r)b 1 z -1 + (R/r) 2 b 2 z -2 )

54 54 Parametric Equalizer H(z) = (1 + b 1 z -1 + b 2 z -2 )/(1 + (R/r)b 1 z -1 + (R/r) 2 b 2 z -2 ) b 1 = -2rcos(ω o ), b 2 = r 2 H(ω) 2 = (1-2rcos(ω ω o ) + r 2 )(1-2rcos(ω+ω o ) + r 2 ) /(1-2Rcos(ω ω o ) + R 2 )(1-2Rcos(ω+ω o ) + R 2 ) H(ω) 2 ω o π ω

55 55 Notch Filter Unit circle Z-Plane ω o Re jω o Re -jω o Notch Filter: Zeros on the unit circle r = 1 H(z) = (1 + b 1 z -1 + z -2 )/(1 + (R)b 1 z -1 + R 2 z -2 ) b 1 = -2cos(ω o ),

56 56 Notch Filter Notch polynomial N(z) = Π k (1-e jω k z -1 ) Real Coefficient N(z) = Π k (1-2cosω k z -1 +z -2 ) Notch Filter = N(z)/N(ρ -1 z) = (1 + b 1 z -1 + b 2 z b 2 z -(M-1) + b 1 z -M )/ (1 + ρb 1 z -1 + ρ 2 b 2 z ρ -(M-1) b 2 z -(M-1) + ρ M b 1 z -M )

57 57 Comb Filter From notch filter moves the zeros inside the poles H(z) = (1 + rb 1 z -1 + r 2 b 2 z r -(M-1) b 2 z -(M-1) + r M b 1 z -M )/ (1 + ρb 1 z -1 + ρ 2 b 2 z ρ -(M-1) b 2 z -(M-1) + ρ M b 1 z -M ) r ρ and r < ρ

Review of Discrete-Time System

Review 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

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

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

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.

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

Your solutions for time-domain waveforms should all be expressed as real-valued functions.

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

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform

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

Discrete Time Fourier Transform

Discrete 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

EE 521: Instrumentation and Measurements

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

ESE 531: Digital Signal Processing

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

Chap 2. Discrete-Time Signals and Systems

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

ECE503: Digital Signal Processing Lecture 4

ECE503: 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

Digital Signal Processing. Midterm 1 Solution

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

Z-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) = 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 information

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

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

Use: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)}

Use: 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 information

EEL3135: Homework #4

EEL3135: 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 information

Discrete-Time Fourier Transform (DTFT)

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

LECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)

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

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

Lecture 7 Discrete Systems

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

ESE 531: Digital Signal Processing

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

x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn

x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn Sampling Let x a (t) be a continuous time signal. The signal is sampled by taking the signal value at intervals of time T to get The signal x(t) has a Fourier transform x[n] = x a (nt ) X a (Ω) = x a (t)e

More information

z-transform Chapter 6

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

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

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

Very useful for designing and analyzing signal processing systems

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

Digital Signal Processing Lecture 3 - Discrete-Time Systems

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

! z-transform. " Tie up loose ends. " Regions of convergence properties. ! Inverse z-transform. " Inspection. " Partial fraction

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

Frequency-Domain C/S of LTI Systems

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

Discrete-time signals and systems

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

Digital Signal Processing:

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

Signals & Systems Handout #4

Signals & 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 information

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz

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

Digital Filters Ying Sun

Digital Filters Ying Sun Digital Filters Ying Sun Digital filters Finite impulse response (FIR filter: h[n] has a finite numbers of terms. Infinite impulse response (IIR filter: h[n] has infinite numbers of terms. Causal filter:

More information

Transform Analysis of Linear Time-Invariant Systems

Transform 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

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

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

The Z-Transform. Fall 2012, EE123 Digital Signal Processing. Eigen Functions of LTI System. Eigen Functions of LTI System

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 information

EC Signals and Systems

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

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

Digital Signal Processing Lecture 9 - Design of Digital Filters - FIR

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

ELEG 305: Digital Signal Processing

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

Like bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform.

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

Solutions: Homework Set # 5

Solutions: 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 information

Stability Condition in Terms of the Pole Locations

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

Z-Transform. 清大電機系林嘉文 Original PowerPoint slides prepared by S. K. Mitra 4-1-1

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

Signals and Systems. Spring Room 324, Geology Palace, ,

Signals 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

Let 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 )

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

Signal Analysis, Systems, Transforms

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

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

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

The Discrete-Time Fourier

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

Discrete Time Systems

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

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by Code No: RR320402 Set No. 1 III B.Tech II Semester Regular Examinations, Apr/May 2006 DIGITAL SIGNAL PROCESSING ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering,

More information

Discrete-time Signals and Systems in

Discrete-time Signals and Systems in Discrete-time Signals and Systems in the Frequency Domain Chapter 3, Sections 3.1-39 3.9 Chapter 4, Sections 4.8-4.9 Dr. Iyad Jafar Outline Introduction The Continuous-Time FourierTransform (CTFT) The

More information

ELEG 305: Digital Signal Processing

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

The Z transform (2) 1

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

VI. Z Transform and DT System Analysis

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

Signals and Systems Lecture 8: Z Transform

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

Lecture 04: Discrete Frequency Domain Analysis (z-transform)

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

University of Illinois at Urbana-Champaign ECE 310: Digital Signal Processing

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

EECE 301 Signals & Systems Prof. Mark Fowler

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

! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals

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

Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.

Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. Lecture 10 Digital Signal Processing Chapter 7 Discrete Fourier transform DFT Mikael Swartling Nedelko Grbic Bengt Mandersson rev. 016 Department of Electrical and Information Technology Lund University

More information

ECGR4124 Digital Signal Processing Midterm Spring 2010

ECGR4124 Digital Signal Processing Midterm Spring 2010 ECGR4124 Digital Signal Processing Midterm Spring 2010 Name: LAST 4 DIGITS of Student Number: Do NOT begin until told to do so Make sure that you have all pages before starting Open book, 1 sheet front/back

More information

ECE-314 Fall 2012 Review Questions for Midterm Examination II

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

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

UNIT-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).

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

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

EE 224 Signals and Systems I Review 1/10

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

EE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley

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

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF INFORMATION TECHNOLOGY. Academic Year

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF INFORMATION TECHNOLOGY. Academic Year VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur- 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY Academic Year 2016-2017 QUESTION BANK-ODD SEMESTER NAME OF THE SUBJECT SUBJECT CODE SEMESTER YEAR

More information

ECGR4124 Digital Signal Processing Exam 2 Spring 2017

ECGR4124 Digital Signal Processing Exam 2 Spring 2017 ECGR4124 Digital Signal Processing Exam 2 Spring 2017 Name: LAST 4 NUMBERS of Student Number: Do NOT begin until told to do so Make sure that you have all pages before starting NO TEXTBOOK, NO CALCULATOR,

More information

Discrete-Time David Johns and Ken Martin University of Toronto

Discrete-Time David Johns and Ken Martin University of Toronto Discrete-Time David Johns and Ken Martin University of Toronto (johns@eecg.toronto.edu) (martin@eecg.toronto.edu) University of Toronto 1 of 40 Overview of Some Signal Spectra x c () t st () x s () t xn

More information

CMPT 889: Lecture 5 Filters

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

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Solutions for Problem Set 2

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Solutions for Problem Set 2 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science Issued: Tuesday, September 5. 6.: Discrete-Time Signal Processing Fall 5 Solutions for Problem Set Problem.

More information

Digital Filters. Linearity and Time Invariance. Linear Time-Invariant (LTI) Filters: CMPT 889: Lecture 5 Filters

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

ECE503: Digital Signal Processing Lecture 5

ECE503: 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 information

Discrete-Time Signals and Systems. Frequency Domain Analysis of LTI Systems. The Frequency Response Function. The Frequency Response Function

Discrete-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

Responses of Digital Filters Chapter Intended Learning Outcomes:

Responses of Digital Filters Chapter Intended Learning Outcomes: Responses of Digital Filters Chapter Intended Learning Outcomes: (i) Understanding the relationships between impulse response, frequency response, difference equation and transfer function in characterizing

More information

Lecture 19 IIR Filters

Lecture 19 IIR Filters Lecture 19 IIR Filters Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/5/10 1 General IIR Difference Equation IIR system: infinite-impulse response system The most general class

More information

Z Transform (Part - II)

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

DIGITAL SIGNAL PROCESSING. Chapter 3 z-transform

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

summable Necessary and sufficient for BIBO stability of an LTI system. Also see poles.

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

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ω

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

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

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

Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals

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

(i) Represent discrete-time signals using transform. (ii) Understand the relationship between transform and discrete-time Fourier transform

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

Definition of Discrete-Time Fourier Transform (DTFT)

Definition of Discrete-Time Fourier Transform (DTFT) Definition of Discrete-Time ourier Transform (DTT) {x[n]} = X(e jω ) + n= {X(e jω )} = x[n] x[n]e jωn Why use the above awkward notation for the transform? X(e jω )e jωn dω Answer: It is consistent with

More information

Question Bank. UNIT 1 Part-A

Question Bank. UNIT 1 Part-A FATIMA MICHAEL COLLEGE OF ENGINEERING & TECHNOLOGY Senkottai Village, Madurai Sivagangai Main Road, Madurai -625 020 An ISO 9001:2008 Certified Institution Question Bank DEPARTMENT OF ELECTRONICS AND COMMUNICATION

More information

Chapter 7: The z-transform

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

Multidimensional digital signal processing

Multidimensional digital signal processing PSfrag replacements Two-dimensional discrete signals N 1 A 2-D discrete signal (also N called a sequence or array) is a function 2 defined over thex(n set 1 of, n 2 ordered ) pairs of integers: y(nx 1,

More information

Solutions. Number of Problems: 10

Solutions. Number of Problems: 10 Final Exam February 9th, 2 Signals & Systems (5-575-) Prof. R. D Andrea Solutions Exam Duration: 5 minutes Number of Problems: Permitted aids: One double-sided A4 sheet. Questions can be answered in English

More information

2. CONVOLUTION. Convolution sum. Response of d.t. LTI systems at a certain input signal

2. CONVOLUTION. Convolution sum. Response of d.t. LTI systems at a certain input signal 2. CONVOLUTION Convolution sum. Response of d.t. LTI systems at a certain input signal Any signal multiplied by the unit impulse = the unit impulse weighted by the value of the signal in 0: xn [ ] δ [

More information

GATE EE Topic wise Questions SIGNALS & SYSTEMS

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

Lecture 11 FIR Filters

Lecture 11 FIR Filters Lecture 11 FIR Filters Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/4/12 1 The Unit Impulse Sequence Any sequence can be represented in this way. The equation is true if k ranges

More information

Analog vs. discrete signals

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

VU Signal and Image Processing

VU Signal and Image Processing 052600 VU Signal and Image Processing Torsten Möller + Hrvoje Bogunović + Raphael Sahann torsten.moeller@univie.ac.at hrvoje.bogunovic@meduniwien.ac.at raphael.sahann@univie.ac.at vda.cs.univie.ac.at/teaching/sip/18s/

More information

DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A

DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A Classification of systems : Continuous and Discrete

More information

Topic 4: The Z Transform

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

ECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3

ECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3 ECE 30 Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3 Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out

More information

Lecture 5 - Assembly Programming(II), Intro to Digital Filters

Lecture 5 - Assembly Programming(II), Intro to Digital Filters GoBack Lecture 5 - Assembly Programming(II), Intro to Digital Filters James Barnes (James.Barnes@colostate.edu) Spring 2009 Colorado State University Dept of Electrical and Computer Engineering ECE423

More information

6.003: Signals and Systems

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

Lecture 7 - IIR Filters

Lecture 7 - IIR Filters Lecture 7 - IIR Filters James Barnes (James.Barnes@colostate.edu) Spring 204 Colorado State University Dept of Electrical and Computer Engineering ECE423 / 2 Outline. IIR Filter Representations Difference

More information