Chapter 5 THE APPLICATION OF THE Z TRANSFORM. 5.3 Stability
|
|
- Edward Frederick McDowell
- 5 years ago
- Views:
Transcription
1 Chapter 5 THE APPLICATION OF THE Z TRANSFORM 5.3 Stability Copyright c Andreas Antoniou Victoria, BC, Canada aantoniou@ieee.org February 13, 2008 Frame # 1 Slide # 1 A. Antoniou Digital Signal Processing Sec. 5.3
2 Stability A discrete-time system is stable if and only if its impulse response is absolutely summable, i.e., h(nt ) < n=0 Frame # 2 Slide # 2 A. Antoniou Digital Signal Processing Sec. 5.3
3 Stability A discrete-time system is stable if and only if its impulse response is absolutely summable, i.e., h(nt ) < n=0 Since the transfer function is the z transform of the impulse response, we expect the stability of the filter to depend critically on the transfer function. It actually depends exclusively on the positions of the poles. Frame # 2 Slide # 3 A. Antoniou Digital Signal Processing Sec. 5.3
4 Stability Cont d Consider a causal recursive system characterized by the transfer function H(z) = N(z) D(z) = H Mi=1 0 (z z i ) m i Ni=1 where N M (z p i ) n i Frame # 3 Slide # 4 A. Antoniou Digital Signal Processing Sec. 5.3
5 Stability Cont d Consider a causal recursive system characterized by the transfer function H(z) = N(z) D(z) = H Mi=1 0 (z z i ) m i Ni=1 where N M (z p i ) n i The impulse response is given by the general inversion formula as h(nt ) = Z 1 H(z) = 1 H(z)z n 1 dz 2πj Ɣ Frame # 3 Slide # 5 A. Antoniou Digital Signal Processing Sec. 5.3
6 Stability Cont d Consider a causal recursive system characterized by the transfer function H(z) = N(z) D(z) = H Mi=1 0 (z z i ) m i Ni=1 where N M (z p i ) n i The impulse response is given by the general inversion formula as h(nt ) = Z 1 H(z) = 1 H(z)z n 1 dz 2πj By using the residue theorem, we have { R 0 + N [ h(nt ) = i=1 Res z=pi H(z)z 1 ] for n = 0 Ni=1 Res z=pi [H(z)z n 1 ] for n > 0 where [ ] H(z) R 0 = Res z=0 z if H(z)/z has a pole at the origin and R 0 = 0 otherwise. Ɣ Frame # 3 Slide # 6 A. Antoniou Digital Signal Processing Sec. 5.3
7 Stability Cont d If we assume that H(z) has simple poles, i.e., n i = 1for i = 1, 2,..., N, then the impulse response can be expressed as { R 0 + N i=1 h(nt ) = p 1 i Res z=pi H(z) for n = 0 N i=1 pn 1 i Res z=pi H(z) for n > 0 where the ith term in the summations is the contribution to the impulse response due to pole p i. Frame # 4 Slide # 7 A. Antoniou Digital Signal Processing Sec. 5.3
8 Stability Cont d { R 0 + N h(nt ) = i=1 p 1 i Res z=pi H(z) for n = 0 Ni=1 p n 1 i Res z=pi H(z) for n > 0 If we let p i = r i e jψ i then the impulse response can be expressed as { h(0) h(nt ) = Ni=1 r n 1 i e j(n 1)ψ i Res z=pi H(z) for n > 0 where is finite. h(0) = R 0 + N i=1 r 1 i e jψ i Res z=pi H(z) for n = 0 Frame # 5 Slide # 8 A. Antoniou Digital Signal Processing Sec. 5.3
9 Stability Cont d h(nt ) = n=0 { h(0) N i=1 r n 1 i e j(n 1)ψ i Res z=pi H(z) for n > 0 We can now write N h(nt ) = h(0) + n=1 i=1 r n 1 i e j(n 1)ψ i Res z=pi H(z) Frame # 6 Slide # 9 A. Antoniou Digital Signal Processing Sec. 5.3
10 Stability Cont d We note that N N ith term ith term i=1 i=1 Frame # 7 Slide # 10 A. Antoniou Digital Signal Processing Sec. 5.3
11 Example The sum of the magnitudes of the complex numbers is 3 c i = ( 1+j1) + (2+j2) + (2 j1) = = i=1 Complex plane c 2 =2+j +j2 c 1 =-1+j +j11 c 3 =2-j -j1 Frame # 8 Slide # 11 A. Antoniou Digital Signal Processing Sec. 5.3
12 Example Cont d On the other hand, the magnitude of the sum of the complex numbers is given by 3 c i = ( 1+j1)+(2+j2)+(2 j1) = 3+j2 = 13 = i=1 Complex plane c 2 =2+j +j2 c 1 =-1+j +j11 c 3 =2-j -j1 Frame # 9 Slide # 12 A. Antoniou Digital Signal Processing Sec. 5.3
13 Example Cont d Therefore, 3 3 c i c i i=1 i=1 Complex plane c 2 =2+j +j2 c 1 =-1+j +j11 c 3 =2-j -j1 Frame # 10 Slide # 13 A. Antoniou Digital Signal Processing Sec. 5.3
14 Stability Cont d N h(nt ) = h(0) + n=0 Thus we can write n=0 n=1 h(nt ) h(0) + h(0) + h(0) + i=1 n=1 i=1 n=1 i=1 r n 1 i e j(n 1)ψ i Res z=pi H(z) N r n 1 i e j(n 1)ψ i Res z=pi H(z) N N n=1 i=1 r n 1 i e j(n 1)ψ i Res z=pi H(z) r n 1 i Res z=pi H(z) Frame # 11 Slide # 14 A. Antoniou Digital Signal Processing Sec. 5.3
15 Stability Cont d Let us assume that all the poles are inside the unit circle z =1, i.e., r i r max < 1 for i = 1, 2,..., N jim z z plane 1 r max Re z Frame # 12 Slide # 15 A. Antoniou Digital Signal Processing Sec. 5.3
16 Stability Cont d Now if p k is a simple pole of some function F (z), then function (z p k )F (z) is analytic and, therefore, the residue of F (z) at z = p k is finite. Frame # 13 Slide # 16 A. Antoniou Digital Signal Processing Sec. 5.3
17 Stability Cont d Now if p k is a simple pole of some function F (z), then function (z p k )F (z) is analytic and, therefore, the residue of F (z) at z = p k is finite. Consequently, all the residues of H(z) are finite and so Res z=pi H(z) R max for i = 1, 2,..., N where R max is a positive constant. Frame # 13 Slide # 17 A. Antoniou Digital Signal Processing Sec. 5.3
18 Stability Cont d From the previous two slides r i r max < 1 for i = 1, 2,..., N and Res z=pi H(z) R max for i = 1, 2,..., N Frame # 14 Slide # 18 A. Antoniou Digital Signal Processing Sec. 5.3
19 Stability Cont d From the previous two slides r i r max < 1 for i = 1, 2,..., N and Res z=pi H(z) R max for i = 1, 2,..., N Therefore, we can write N h(nt ) h(0) + r n 1 i Res z=pi H(z) n=0 h(0) +NR max n=1 i=1 rmax n 1 n=1 Frame # 14 Slide # 19 A. Antoniou Digital Signal Processing Sec. 5.3
20 Stability Cont d n=0 h(nt ) h(0) +NR max n=1 r n 1 max The sum at the right-hand side is a geometric series with common ratio r max and since we have assumed that r max < 1, the series converges. Frame # 15 Slide # 20 A. Antoniou Digital Signal Processing Sec. 5.3
21 Stability Cont d n=0 h(nt ) h(0) +NR max n=1 r n 1 max The sum at the right-hand side is a geometric series with common ratio r max and since we have assumed that r max < 1, the series converges. We, therefore, conclude that h(nt ) < n=0 Frame # 15 Slide # 21 A. Antoniou Digital Signal Processing Sec. 5.3
22 Stability Cont d Summarizing, we have assumed that all the poles are inside the unit circle, i.e., r i r max < 1 for i = 1, 2,..., N and demonstrated that in such a case the impulse response is absolutely summable, i.e., h(nt ) < n=0 Frame # 16 Slide # 22 A. Antoniou Digital Signal Processing Sec. 5.3
23 Stability Cont d Summarizing, we have assumed that all the poles are inside the unit circle, i.e., r i r max < 1 for i = 1, 2,..., N and demonstrated that in such a case the impulse response is absolutely summable, i.e., h(nt ) < n=0 Therefore, we conclude that if all the poles are inside the unit circle, the system is stable. Frame # 16 Slide # 23 A. Antoniou Digital Signal Processing Sec. 5.3
24 Stability Cont d One more thing needs to be done in order to fully establish the role of the pole positions on the stability of the system. Frame # 17 Slide # 24 A. Antoniou Digital Signal Processing Sec. 5.3
25 Stability Cont d One more thing needs to be done in order to fully establish the role of the pole positions on the stability of the system. The condition established so far is a sufficient condition and one may, therefore, ask: Is it possible for a system to be stable if one or more poles are located on or outside the unit circle? Frame # 17 Slide # 25 A. Antoniou Digital Signal Processing Sec. 5.3
26 Stability Cont d Let us assume that a single pole of H(z), say pole p k,is located on or outside the unit circle, i.e., r k 1. Frame # 18 Slide # 26 A. Antoniou Digital Signal Processing Sec. 5.3
27 Stability Cont d Let us assume that a single pole of H(z), say pole p k,is located on or outside the unit circle, i.e., r k 1. In such a case, as n we have h(nt ) = N i=1 r n 1 i e j(n 1)ψ i Res z=pi H(z) r n 1 k e j(n 1)ψ k Res z=pk H(z) since for a large value of n, r n 1 i 0 for all i k for which r i < 1 whereas r n 1 k is unity or becomes very large since r k 1. Frame # 18 Slide # 27 A. Antoniou Digital Signal Processing Sec. 5.3
28 Stability Cont d Thus h(nt ) n=0 n=0 r n 1 k Res z=pk H(z) e j(n 1)ψ i Res z=pk H(z) n=0 r n 1 k Frame # 19 Slide # 28 A. Antoniou Digital Signal Processing Sec. 5.3
29 Stability Cont d Thus h(nt ) n=0 n=0 r n 1 k Res z=pk H(z) e j(n 1)ψ i Res z=pk H(z) n=0 r n 1 k Since r k 1, the sum at the right-hand side does not converge i.e., the impulse response is not absolutely summable, i.e., h(nt ) n=0 and the system is unstable. Frame # 19 Slide # 29 A. Antoniou Digital Signal Processing Sec. 5.3
30 Stability Cont d Therefore, we conclude that a discrete-time system is stable if and only if all its poles are inside the unit circle of the z plane. jim z z plane 1 Regions of instability Re z Region of stability Note: Nonrecursive discrete-time systems are always stable since their poles are always located at the origin of the z plane. Frame # 20 Slide # 30 A. Antoniou Digital Signal Processing Sec. 5.3
31 Example Check the following system for stability: X(z) Y(z) Frame # 21 Slide # 31 A. Antoniou Digital Signal Processing Sec. 5.3
32 Example Solution The transfer function of the system can be easily obtained as H(z) = z2 z + 1 z 2 z z 2 z + 1 = (z p 1 )(z p 2 ) where p 1, p 2 = 1 2 ± j 1 2 = 1 2 e ±jπ/4 Since the system is stable. p 1, p 2 < 1 Frame # 22 Slide # 32 A. Antoniou Digital Signal Processing Sec. 5.3
33 Stability Criteria Stability criteria are simple techniques that can be used to determine whether a system is stable or unstable with minimal computational effort. Frame # 23 Slide # 33 A. Antoniou Digital Signal Processing Sec. 5.3
34 Stability Criteria Stability criteria are simple techniques that can be used to determine whether a system is stable or unstable with minimal computational effort. Consider a system characterized by the transfer function where H(z) = N(z) D(z) N(z) = M a i z M i and D(z) = i=0 N b i z N i i=0 Frame # 23 Slide # 34 A. Antoniou Digital Signal Processing Sec. 5.3
35 Stability Criteria Cont d As was demonstrated in previous slides, the stability of a discrete-time system can be determined by finding the poles of the transfer function, namely, the roots of the denominator polynomial D(z). Frame # 24 Slide # 35 A. Antoniou Digital Signal Processing Sec. 5.3
36 Stability Criteria Cont d As was demonstrated in previous slides, the stability of a discrete-time system can be determined by finding the poles of the transfer function, namely, the roots of the denominator polynomial D(z). For a second- or a third-order system this is easily done. Frame # 24 Slide # 36 A. Antoniou Digital Signal Processing Sec. 5.3
37 Stability Criteria Cont d As was demonstrated in previous slides, the stability of a discrete-time system can be determined by finding the poles of the transfer function, namely, the roots of the denominator polynomial D(z). For a second- or a third-order system this is easily done. For higher-order systems, we need to use a computer program that would evaluate the roots of a polynomial, for example, MATLAB. Frame # 24 Slide # 37 A. Antoniou Digital Signal Processing Sec. 5.3
38 Stability Criteria Cont d As was demonstrated in previous slides, the stability of a discrete-time system can be determined by finding the poles of the transfer function, namely, the roots of the denominator polynomial D(z). For a second- or a third-order system this is easily done. For higher-order systems, we need to use a computer program that would evaluate the roots of a polynomial, for example, MATLAB. Alternatively, we can use one of several stability criteria. Frame # 24 Slide # 38 A. Antoniou Digital Signal Processing Sec. 5.3
39 Stability Criteria Cont d Common factors in N(z) and D(z) do not have anything to do with stability because they can be canceled out. Frame # 25 Slide # 39 A. Antoniou Digital Signal Processing Sec. 5.3
40 Stability Criteria Cont d Common factors in N(z) and D(z) do not have anything to do with stability because they can be canceled out. For example, if N(z) and D(z) have a common factor (z + w), then H(z) = N(z) D(z) = (z + w)n (z) (z + w)d (z) = N (z) D (z) In effect, the poles of H(z) are the roots of D (z) and parameter w will not appear in the impulse response. Frame # 25 Slide # 40 A. Antoniou Digital Signal Processing Sec. 5.3
41 Test for Common Factors If there are common factors, they must be removed. Frame # 26 Slide # 41 A. Antoniou Digital Signal Processing Sec. 5.3
42 Test for Common Factors If there are common factors, they must be removed. To test a transfer function H(z) = N(z) D(z) = Mi=0 a i z M i Ni=0 b i z N i for common factors, an (M + N) (M + N) matrix is constructed and its determinant is evaluated where M and N are the numerator and denominator degrees, respectively. Frame # 26 Slide # 42 A. Antoniou Digital Signal Processing Sec. 5.3
43 Test for Common Factors If there are common factors, they must be removed. To test a transfer function H(z) = N(z) D(z) = Mi=0 a i z M i Ni=0 b i z N i for common factors, an (M + N) (M + N) matrix is constructed and its determinant is evaluated where M and N are the numerator and denominator degrees, respectively. If the determinant of this matrix is zero, then there are common factors. (See Sec of textbook for details.) Frame # 26 Slide # 43 A. Antoniou Digital Signal Processing Sec. 5.3
44 Test for Common Factors If there are common factors, they must be removed. To test a transfer function H(z) = N(z) D(z) = Mi=0 a i z M i Ni=0 b i z N i for common factors, an (M + N) (M + N) matrix is constructed and its determinant is evaluated where M and N are the numerator and denominator degrees, respectively. If the determinant of this matrix is zero, then there are common factors. (See Sec of textbook for details.) Hereafter, we assume that N(z) and D(z) do not have any common factors. Frame # 26 Slide # 44 A. Antoniou Digital Signal Processing Sec. 5.3
45 Stability Cont d The classical stability criteria for continuous-time systems are the Nyquist and Routh-Hurwitz criteria. Frame # 27 Slide # 45 A. Antoniou Digital Signal Processing Sec. 5.3
46 Stability Cont d The classical stability criteria for continuous-time systems are the Nyquist and Routh-Hurwitz criteria. Corresponding criteria that can be used to check the stability of discrete-time systems and digital filters are the following: Frame # 27 Slide # 46 A. Antoniou Digital Signal Processing Sec. 5.3
47 Stability Cont d The classical stability criteria for continuous-time systems are the Nyquist and Routh-Hurwitz criteria. Corresponding criteria that can be used to check the stability of discrete-time systems and digital filters are the following: Schur-Cohn criterion (1922) Frame # 27 Slide # 47 A. Antoniou Digital Signal Processing Sec. 5.3
48 Stability Cont d The classical stability criteria for continuous-time systems are the Nyquist and Routh-Hurwitz criteria. Corresponding criteria that can be used to check the stability of discrete-time systems and digital filters are the following: Schur-Cohn criterion (1922) Schur-Cohn-Fujisawa criterion (1925) Frame # 27 Slide # 48 A. Antoniou Digital Signal Processing Sec. 5.3
49 Stability Cont d The classical stability criteria for continuous-time systems are the Nyquist and Routh-Hurwitz criteria. Corresponding criteria that can be used to check the stability of discrete-time systems and digital filters are the following: Schur-Cohn criterion (1922) Schur-Cohn-Fujisawa criterion (1925) Jury-Marden criterion (1962) Frame # 27 Slide # 49 A. Antoniou Digital Signal Processing Sec. 5.3
50 Schur-Cohn Stability Criterion For an Nth-order system, N matrices of dimensions ranging from 2 2to2N 2N are constructed using the coefficients of D(z). Frame # 28 Slide # 50 A. Antoniou Digital Signal Processing Sec. 5.3
51 Schur-Cohn Stability Criterion For an Nth-order system, N matrices of dimensions ranging from 2 2to2N 2N are constructed using the coefficients of D(z). The determinants of these matrices, say, D 1, D 2,..., D N, are computed and their signs are determined. Frame # 28 Slide # 51 A. Antoniou Digital Signal Processing Sec. 5.3
52 Schur-Cohn Stability Criterion For an Nth-order system, N matrices of dimensions ranging from 2 2to2N 2N are constructed using the coefficients of D(z). The determinants of these matrices, say, D 1, D 2,..., D N, are computed and their signs are determined. The system is stable if and only if D k < 0 for odd k and D k > 0 for even k Frame # 28 Slide # 52 A. Antoniou Digital Signal Processing Sec. 5.3
53 Schur-Cohn-Fujisawa Stability Criterion The Schur-Cohn-Fujisawa criterion is much more efficient. Frame # 29 Slide # 53 A. Antoniou Digital Signal Processing Sec. 5.3
54 Schur-Cohn-Fujisawa Stability Criterion The Schur-Cohn-Fujisawa criterion is much more efficient. It involves only one matrix of dimension N N, whichis again constructed using the coefficients of D(z). Frame # 29 Slide # 54 A. Antoniou Digital Signal Processing Sec. 5.3
55 Schur-Cohn-Fujisawa Stability Criterion The Schur-Cohn-Fujisawa criterion is much more efficient. It involves only one matrix of dimension N N, whichis again constructed using the coefficients of D(z). The test amounts to checking whether the matrix is positive definite. Frame # 29 Slide # 55 A. Antoniou Digital Signal Processing Sec. 5.3
56 Schur-Cohn-Fujisawa Stability Criterion The Schur-Cohn-Fujisawa criterion is much more efficient. It involves only one matrix of dimension N N, whichis again constructed using the coefficients of D(z). The test amounts to checking whether the matrix is positive definite. This is based on the Schur-Cohn criterion. Frame # 29 Slide # 56 A. Antoniou Digital Signal Processing Sec. 5.3
57 Jury-Marden Stability Criterion The Jury-Marden criterion is the most efficient of the three criteria. Frame # 30 Slide # 57 A. Antoniou Digital Signal Processing Sec. 5.3
58 Jury-Marden Stability Criterion The Jury-Marden criterion is the most efficient of the three criteria. It involves the computation of a number of 2 2 determinants. Frame # 30 Slide # 58 A. Antoniou Digital Signal Processing Sec. 5.3
59 Jury-Marden Stability Criterion The Jury-Marden criterion is the most efficient of the three criteria. It involves the computation of a number of 2 2 determinants. This is also based on the Schur-Cohn criterion. Frame # 30 Slide # 59 A. Antoniou Digital Signal Processing Sec. 5.3
60 Jury-Marden Stability Criterion Cont d Assumptions: Frame # 31 Slide # 60 A. Antoniou Digital Signal Processing Sec. 5.3
61 Jury-Marden Stability Criterion Cont d Assumptions: The denominator of the transfer function is given by where b 0 > 0. D(z) = N b i z N i i=0 Frame # 31 Slide # 61 A. Antoniou Digital Signal Processing Sec. 5.3
62 Jury-Marden Stability Criterion Cont d Assumptions: The denominator of the transfer function is given by D(z) = N b i z N i where b 0 > 0. The numerator and denominator polynomials of the transfer function, N(z) and D(z), do not have any common factors. i=0 Frame # 31 Slide # 62 A. Antoniou Digital Signal Processing Sec. 5.3
63 Jury-Marden Stability Criterion Cont d Assumptions: The denominator of the transfer function is given by D(z) = N b i z N i where b 0 > 0. The numerator and denominator polynomials of the transfer function, N(z) and D(z), do not have any common factors. The first assumption that b 0 > 0simplifies the Jury-Marden stability criterion but it is not a limitation. i=0 Frame # 31 Slide # 63 A. Antoniou Digital Signal Processing Sec. 5.3
64 Jury-Marden Stability Criterion Cont d If b 0 < 0 then we can multiply the numerator and denominator polynomials by 1 to get a positive b 0. Frame # 32 Slide # 64 A. Antoniou Digital Signal Processing Sec. 5.3
65 Jury-Marden Stability Criterion Cont d If b 0 < 0 then we can multiply the numerator and denominator polynomials by 1 to get a positive b 0. This does not change the pole positions. Frame # 32 Slide # 65 A. Antoniou Digital Signal Processing Sec. 5.3
66 Jury-Marden Stability Criterion Cont d If b 0 < 0 then we can multiply the numerator and denominator polynomials by 1 to get a positive b 0. This does not change the pole positions. For example, if we can write H(z) = H(z) = N(z) D(z) = z 2 + 2z + 1 2z z 0.4 (z 2 + 2z + 1)( 1) ( 2z z 0.4)( 1) = z2 2z 1 2z 2 0.8z = N (z) D (z) where D (z) has a positive b 0. Frame # 32 Slide # 66 A. Antoniou Digital Signal Processing Sec. 5.3
67 Jury-Marden Stability Criterion Cont d Row Coefficients 1 b 0 b 1 b 2 b 3 b N 2 b N 1 b N 2 b N b N 1 b N 2 b N 3 b 2 b 1 b 0 3 c 0 c 1 c 2 c N 3 c N 2 c N 1 4 c N 1 c N 2 c N 3 c 2 c 1 c 0 5 d 0 d 1 d 2 d N 3 d N 2 6 d N 2 d N 3 d N 4 d 1 d N - 3 r 0 r 1 r 2.. where c i = b i b N b N i b 0 = b 0 b N i b N b i for 0, 1,..., N 1 d i = c i c N 1 c N 1 i c 0 = c 0 c N 1 i for 0, 1,..., N 2 c N 1 c i Frame # 33 Slide # 67 A. Antoniou Digital Signal Processing Sec. 5.3
68 Jury-Marden Stability Criterion Cont d The Jury-Marden stability criterion states that polynomial D(z) has roots inside the unit circle of the z plane (i.e., the filter is stable) if and only if the following conditions are satisfied: Frame # 34 Slide # 68 A. Antoniou Digital Signal Processing Sec. 5.3
69 Jury-Marden Stability Criterion Cont d The Jury-Marden stability criterion states that polynomial D(z) has roots inside the unit circle of the z plane (i.e., the filter is stable) if and only if the following conditions are satisfied: (i) D(1) >0 Frame # 34 Slide # 69 A. Antoniou Digital Signal Processing Sec. 5.3
70 Jury-Marden Stability Criterion Cont d The Jury-Marden stability criterion states that polynomial D(z) has roots inside the unit circle of the z plane (i.e., the filter is stable) if and only if the following conditions are satisfied: (i) D(1) >0 (ii) ( 1) N D( 1) >0 Frame # 34 Slide # 70 A. Antoniou Digital Signal Processing Sec. 5.3
71 Jury-Marden Stability Criterion Cont d The Jury-Marden stability criterion states that polynomial D(z) has roots inside the unit circle of the z plane (i.e., the filter is stable) if and only if the following conditions are satisfied: (i) D(1) >0 (ii) ( 1) N D( 1) >0 (iii) b 0 > b N c 0 > c N 1 d 0 > d N 2.. r 0 > r 2 Frame # 34 Slide # 71 A. Antoniou Digital Signal Processing Sec. 5.3
72 Example A discrete-time system is characterized by the transfer function H(z) = z 4 4z 4 + 3z 3 + 2z 2 + z + 1 Check the filter for stability. Solution The denominator polynomial of the transfer function is given by D(z) = 4z 4 + 3z 3 + 2z 2 + z + 1 Since D(1) = 11 > 0 and ( 1) 4 D( 1) = 3 > 0 conditions (i) and (ii) of the test are satisfied. Frame # 35 Slide # 72 A. Antoniou Digital Signal Processing Sec. 5.3
73 Example Cont d Jury-Marden array: Row Coefficients Since b 0 > b 4, c 0 > c 3, d 0 > d 2 condition (iii) is also satisfied and the filter is stable. Frame # 36 Slide # 73 A. Antoniou Digital Signal Processing Sec. 5.3
74 Example A discrete-time system is characterized by the transfer function H(z) = z 2 + 2z + 1 z 4 + 6z 3 + 3z 2 + 4z + 5 Check the filter for stability. Solution The denominator polynomial of the transfer function is given D(z) = z 4 + 6z 3 + 3z 2 + 4z + 5 In this example, ( 1) 4 D( 1) = 1 Therefore, condition (ii) of the test is violated and the filter is unstable. Note: Note that there is no need to construct the Jury-Marden array! Violating only one of the conditions is enough to demonstrate that filter is unstable. Frame # 37 Slide # 74 A. Antoniou Digital Signal Processing Sec. 5.3
75 This slide concludes the presentation. Thank you for your attention. Frame # 38 Slide # 75 A. Antoniou Digital Signal Processing Sec. 5.3
Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.
Z - Transform The z-transform is a very important tool in describing and analyzing digital systems. It offers the techniques for digital filter design and frequency analysis of digital signals. Definition
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 informationPart 4: IIR Filters Optimization Approach. Tutorial ISCAS 2007
Part 4: IIR Filters Optimization Approach Tutorial ISCAS 2007 Copyright 2007 Andreas Antoniou Victoria, BC, Canada Email: aantoniou@ieee.org July 24, 2007 Frame # 1 Slide # 1 A. Antoniou Part4: IIR Filters
More informationSome special cases
Lecture Notes on Control Systems/D. Ghose/2012 87 11.3.1 Some special cases Routh table is easy to form in most cases, but there could be some cases when we need to do some extra work. Case 1: The first
More informationChapter 6 THE SAMPLING PROCESS 6.1 Introduction 6.2 Fourier Transform Revisited
Chapter 6 THE SAMPLING PROCESS 6.1 Introduction 6.2 Fourier Transform Revisited Copyright c 2005 Andreas Antoniou Victoria, BC, Canada Email: aantoniou@ieee.org July 14, 2018 Frame # 1 Slide # 1 A. Antoniou
More informationECEN 605 LINEAR SYSTEMS. Lecture 20 Characteristics of Feedback Control Systems II Feedback and Stability 1/27
1/27 ECEN 605 LINEAR SYSTEMS Lecture 20 Characteristics of Feedback Control Systems II Feedback and Stability Feedback System Consider the feedback system u + G ol (s) y Figure 1: A unity feedback system
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 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 informationDigital Signal Processing
COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #21 Friday, October 24, 2003 Types of causal FIR (generalized) linear-phase filters: Type I: Symmetric impulse response: with order M an even
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 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 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 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 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 informationDigital Signal Processing, Homework 2, Spring 2013, Prof. C.D. Chung. n; 0 n N 1, x [n] = N; N n. ) (n N) u [n N], z N 1. x [n] = u [ n 1] + Y (z) =
Digital Signal Processing, Homework, Spring 0, Prof CD Chung (05%) Page 67, Problem Determine the z-transform of the sequence n; 0 n N, x [n] N; N n x [n] n; 0 n N, N; N n nx [n], z d dz X (z) ) nu [n],
More informationRemember that : Definition :
Stability This lecture we will concentrate on How to determine the stability of a system represented as a transfer function How to determine the stability of a system represented in state-space How to
More informationLecture 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 informationy[n] = = h[k]x[n k] h[k]z n k k= 0 h[k]z k ) = H(z)z n h[k]z h (7.1)
7. The Z-transform 7. Definition of the Z-transform We saw earlier that complex exponential of the from {e jwn } is an eigen function of for a LTI System. We can generalize this for signals of the form
More informationEFFICIENT REMEZ ALGORITHMS FOR THE DESIGN OF NONRECURSIVE FILTERS
EFFICIENT REMEZ ALGORITHMS FOR THE DESIGN OF NONRECURSIVE FILTERS Copyright 2003- Andreas Antoniou Victoria, BC, Canada Email: aantoniou@ieee.org July 24, 2007 Frame # 1 Slide # 1 A. Antoniou EFFICIENT
More informationState will have dimension 5. One possible choice is given by y and its derivatives up to y (4)
A Exercise State will have dimension 5. One possible choice is given by y and its derivatives up to y (4 x T (t [ y(t y ( (t y (2 (t y (3 (t y (4 (t ] T With this choice we obtain A B C [ ] D 2 3 4 To
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 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 informationECE317 : Feedback and Control
ECE317 : Feedback and Control Lecture : Routh-Hurwitz stability criterion Examples Dr. Richard Tymerski Dept. of Electrical and Computer Engineering Portland State University 1 Course roadmap Modeling
More informationCERTAIN ALGEBRAIC TESTS FOR ANALYZING APERIODIC AND RELATIVE STABILITY IN LINEAR DISCRETE SYSTEMS
CERTAIN ALGEBRAIC TESTS FOR ANALYZING APERIODIC AND RELATIVE STABILITY IN LINEAR DISCRETE SYSTEMS Ramesh P. and Manikandan V. 2 Department of Electrical and Electronics Engineering, University College
More informationIt is common to think and write in time domain. creating the mathematical description of the. Continuous systems- using Laplace or s-
It is common to think and write in time domain quantities, but this is not the best thing to do in creating the mathematical description of the system we are dealing with. Continuous systems- using Laplace
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 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 informationCHAPTER 2 LITERATURE REVIEW FOR STABILITY TESTING OF TWO DIMENSIONAL RECURSIVE DIGITAL FILTERS
0 CHAPTER 2 LITERATURE REVIEW FOR STABILITY TESTING OF TWO DIMENSIONAL RECURSIVE DIGITAL FILTERS The methods for testing the stability of two dimensional recursive digital filters fall into two categories.
More informationDSP-I DSP-I DSP-I DSP-I
DSP-I DSP-I DSP-I DSP-I Digital Signal Processing I (8-79) Fall Semester, 005 OTES FOR 8-79 LECTURE 9: PROPERTIES AD EXAPLES OF Z-TRASFORS Distributed: September 7, 005 otes: This handout contains in outline
More 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 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 informationECE317 : Feedback and Control
ECE317 : Feedback and Control Lecture : Stability Routh-Hurwitz stability criterion Dr. Richard Tymerski Dept. of Electrical and Computer Engineering Portland State University 1 Course roadmap Modeling
More information2.161 Signal Processing: Continuous and Discrete Fall 2008
IT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete all 2008 or information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. assachusetts
More informationDigital Control Systems
Digital Control Systems Lecture Summary #4 This summary discussed some graphical methods their use to determine the stability the stability margins of closed loop systems. A. Nyquist criterion Nyquist
More informationUNIT-II Z-TRANSFORM. This expression is also called a one sided z-transform. This non causal sequence produces positive powers of z in X (z).
Page no: 1 UNIT-II Z-TRANSFORM The Z-Transform The direct -transform, properties of the -transform, rational -transforms, inversion of the transform, analysis of linear time-invariant systems in the -
More informationAutomatic Control Systems theory overview (discrete time systems)
Automatic Control Systems theory overview (discrete time systems) Prof. Luca Bascetta (luca.bascetta@polimi.it) Politecnico di Milano Dipartimento di Elettronica, Informazione e Bioingegneria Motivations
More informationChemical Process Dynamics and Control. Aisha Osman Mohamed Ahmed Department of Chemical Engineering Faculty of Engineering, Red Sea University
Chemical Process Dynamics and Control Aisha Osman Mohamed Ahmed Department of Chemical Engineering Faculty of Engineering, Red Sea University 1 Chapter 4 System Stability 2 Chapter Objectives End of this
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 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 informationDamped Oscillators (revisited)
Damped Oscillators (revisited) We saw that damped oscillators can be modeled using a recursive filter with two coefficients and no feedforward components: Y(k) = - a(1)*y(k-1) - a(2)*y(k-2) We derived
More informationCompensation 8. f4 that separate these regions of stability and instability. The characteristic S 0 L U T I 0 N S
S 0 L U T I 0 N S Compensation 8 Note: All references to Figures and Equations whose numbers are not preceded by an "S"refer to the textbook. As suggested in Lecture 8, to perform a Nyquist analysis, we
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 informationRecursive, Infinite Impulse Response (IIR) Digital Filters:
Recursive, Infinite Impulse Response (IIR) Digital Filters: Filters defined by Laplace Domain transfer functions (analog devices) can be easily converted to Z domain transfer functions (digital, sampled
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 information8.4. Systems of Equations in Three Variables. Identifying Solutions 2/20/2018. Example. Identifying Solutions. Solving Systems in Three Variables
8.4 Systems of Equations in Three Variables Copyright 2010 Pearson Education, Inc. Publishing as Pearson Addison- Wesley Identifying Solutions Solving Systems in Three Variables Dependency, Inconsistency,
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 informationSTABILITY OF CLOSED-LOOP CONTOL SYSTEMS
CHBE320 LECTURE X STABILITY OF CLOSED-LOOP CONTOL SYSTEMS Professor Dae Ryook Yang Spring 2018 Dept. of Chemical and Biological Engineering 10-1 Road Map of the Lecture X Stability of closed-loop control
More informationSoftware Engineering/Mechatronics 3DX4. Slides 6: Stability
Software Engineering/Mechatronics 3DX4 Slides 6: Stability Dr. Ryan Leduc Department of Computing and Software McMaster University Material based on lecture notes by P. Taylor and M. Lawford, and Control
More informationControl Systems Engineering ( Chapter 6. Stability ) Prof. Kwang-Chun Ho Tel: Fax:
Control Systems Engineering ( Chapter 6. Stability ) Prof. Kwang-Chun Ho kwangho@hansung.ac.kr Tel: 02-760-4253 Fax:02-760-4435 Introduction In this lesson, you will learn the following : How to determine
More informationThe Z transform (2) Alexandra Branzan Albu ELEC 310-Spring 2009-Lecture 28 1
The Z transform (2) Alexandra Branzan Albu ELEC 310-Spring 2009-Lecture 28 1 Outline Properties of the region of convergence (10.2) The inverse Z-transform (10.3) Definition Computational techniques Alexandra
More 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 informationSECTION 5: ROOT LOCUS ANALYSIS
SECTION 5: ROOT LOCUS ANALYSIS MAE 4421 Control of Aerospace & Mechanical Systems 2 Introduction Introduction 3 Consider a general feedback system: Closed loop transfer function is 1 is the forward path
More information21.4. Engineering Applications of z-transforms. Introduction. Prerequisites. Learning Outcomes
Engineering Applications of z-transforms 21.4 Introduction In this Section we shall apply the basic theory of z-transforms to help us to obtain the response or output sequence for a discrete system. This
More informationECE503: Digital Signal Processing Lecture 6
ECE503: Digital Signal Processing Lecture 6 D. Richard Brown III WPI 20-February-2012 WPI D. Richard Brown III 20-February-2012 1 / 28 Lecture 6 Topics 1. Filter structures overview 2. FIR filter structures
More informationSTABILITY ANALYSIS TECHNIQUES
ECE4540/5540: Digital Control Systems 4 1 STABILITY ANALYSIS TECHNIQUES 41: Bilinear transformation Three main aspects to control-system design: 1 Stability, 2 Steady-state response, 3 Transient response
More informationSTABILITY ANALYSIS. Asystemmaybe stable, neutrallyormarginallystable, or unstable. This can be illustrated using cones: Stable Neutral Unstable
ECE4510/5510: Feedback Control Systems. 5 1 STABILITY ANALYSIS 5.1: Bounded-input bounded-output (BIBO) stability Asystemmaybe stable, neutrallyormarginallystable, or unstable. This can be illustrated
More informationAnother Algorithm for Computing π Attributable to Archimedes: Avoiding Cancellation Errors
POLYTECHNIC UNIVERSITY Department of Computer and Information Science Another Algorithm for Computing π Attributable to Archimedes: Avoiding Cancellation Errors K. Ming Leung Abstract: We illustrate how
More informationFilter structures ELEC-E5410
Filter structures ELEC-E5410 Contents FIR filter basics Ideal impulse responses Polyphase decomposition Fractional delay by polyphase structure Nyquist filters Half-band filters Gibbs phenomenon Discrete-time
More informationLecture 3 - Design of Digital Filters
Lecture 3 - Design of Digital Filters 3.1 Simple filters In the previous lecture we considered the polynomial fit as a case example of designing a smoothing filter. The approximation to an ideal LPF can
More information1 1.27z z 2. 1 z H 2
E481 Digital Signal Processing Exam Date: Thursday -1-1 16:15 18:45 Final Exam - Solutions Dan Ellis 1. (a) In this direct-form II second-order-section filter, the first stage has
More information(Refer Slide Time: )
Digital Signal Processing Prof. S. C. Dutta Roy Department of Electrical Engineering Indian Institute of Technology, Delhi FIR Lattice Synthesis Lecture - 32 This is the 32nd lecture and our topic for
More informationECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam.
ECE 35 Spring - Final Exam 9 May ECE 35 Signals and Systems Spring Final Exam - Solutions Three 8 ½ x sheets of notes, and a calculator are allowed during the exam Write all answers neatly and show your
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 informationAlgebraic Algorithm for 2D Stability Test Based on a Lyapunov Equation. Abstract
Algebraic Algorithm for 2D Stability Test Based on a Lyapunov Equation Minoru Yamada Li Xu Osami Saito Abstract Some improvements have been proposed for the algorithm of Agathoklis such that 2D stability
More informationELEC2400 Signals & Systems
ELEC2400 Signals & Systems Chapter 7. Z-Transforms Brett Ninnes brett@newcastle.edu.au. School of Electrical Engineering and Computer Science The University of Newcastle Slides by Juan I. Yu (jiyue@ee.newcastle.edu.au
More informationSIGNALS AND SYSTEMS LABORATORY 14: The Rudiments of Antenna Design
SIGNALS AND SYSTEMS LABORATORY 4: The Rudiments of Antenna Design INTRODUCTION By and large, in our study of signals and systems we have been concerned with rational functions. These are functions of exponential
More informationControl Systems Engineering ( Chapter 8. Root Locus Techniques ) Prof. Kwang-Chun Ho Tel: Fax:
Control Systems Engineering ( Chapter 8. Root Locus Techniques ) Prof. Kwang-Chun Ho kwangho@hansung.ac.kr Tel: 02-760-4253 Fax:02-760-4435 Introduction In this lesson, you will learn the following : The
More informationParallel Properties of Poles of. Positive Functions and those of. Discrete Reactance Functions
International Journal of Mathematical Analysis Vol. 11, 2017, no. 24, 1141-1150 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ima.2017.77106 Parallel Properties of Poles of Positive Functions and
More informationEE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley
University of California Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences Professors : N.Morgan / B.Gold EE225D Digital Filters Spring,1999 Lecture 7 N.MORGAN
More informationEC CONTROL SYSTEM UNIT I- CONTROL SYSTEM MODELING
EC 2255 - CONTROL SYSTEM UNIT I- CONTROL SYSTEM MODELING 1. What is meant by a system? It is an arrangement of physical components related in such a manner as to form an entire unit. 2. List the two types
More informationSoftware Engineering 3DX3. Slides 8: Root Locus Techniques
Software Engineering 3DX3 Slides 8: Root Locus Techniques Dr. Ryan Leduc Department of Computing and Software McMaster University Material based on Control Systems Engineering by N. Nise. c 2006, 2007
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 informationECE 345 / ME 380 Introduction to Control Systems Lecture Notes 8
Learning Objectives ECE 345 / ME 380 Introduction to Control Systems Lecture Notes 8 Dr. Oishi oishi@unm.edu November 2, 203 State the phase and gain properties of a root locus Sketch a root locus, by
More informationVALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203. DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING SUBJECT QUESTION BANK : EC6405 CONTROL SYSTEM ENGINEERING SEM / YEAR: IV / II year
More informationTable of Laplacetransform
Appendix Table of Laplacetransform pairs 1(t) f(s) oct), unit impulse at t = 0 a, a constant or step of magnitude a at t = 0 a s t, a ramp function e- at, an exponential function s + a sin wt, a sine fun
More informationKINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING QUESTION BANK SUB.NAME : CONTROL SYSTEMS BRANCH : ECE YEAR : II SEMESTER: IV 1. What is control system? 2. Define open
More informationR10. IV B.Tech II Semester Regular Examinations, April/May DIGITAL CONTROL SYSTEMS JNTUK
Set No. 1 1 a) Explain about the shifting and scaling operator. b) Discuss briefly about the linear time invariant and causal systems. 2 a) Write the mapping points between S-Plane and Z-plane. b) Find
More information20 ZIAD ZAHREDDINE For some interesting relationships between these two types of stability: Routh- Hurwitz for continuous-time and Schur-Cohn for disc
SOOCHOW JOURNAL OF MATHEMATICS Volume 25, No. 1, pp. 19-28, January 1999 ON SOME PROPERTIES OF HURWITZ POLYNOMIALS WITH APPLICATION TO STABILITY THEORY BY ZIAD ZAHREDDINE Abstract. Necessary as well as
More informationSynthesis of passband filters with asymmetric transmission zeros
Synthesis of passband filters with asymmetric transmission zeros Giuseppe Macchiarella Polytechnic of Milan, Italy Electronic and Information Department Passband filters with asymmetric zeros Placing asymmetric
More informationThe Laplace Transform
The Laplace Transform Syllabus ECE 316, Spring 2015 Final Grades Homework (6 problems per week): 25% Exams (midterm and final): 50% (25:25) Random Quiz: 25% Textbook M. Roberts, Signals and Systems, 2nd
More informationELEN E4810: Digital Signal Processing Topic 4: The Z Transform. 1. The Z Transform. 2. Inverse Z Transform
ELEN E480: Digital Signal Processing Topic 4: The Z Transform. The Z Transform 2. Inverse Z Transform . The Z Transform Powerful tool for analyzing & designing DT systems Generalization of the DTFT: G(z)
More informationDigital Signal Processing Lecture 8 - Filter Design - IIR
Digital Signal Processing - Filter Design - IIR Electrical Engineering and Computer Science University of Tennessee, Knoxville October 20, 2015 Overview 1 2 3 4 5 6 Roadmap Discrete-time signals and systems
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 informationSolutions. 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 informationSAMPLE SOLUTION TO EXAM in MAS501 Control Systems 2 Autumn 2015
FACULTY OF ENGINEERING AND SCIENCE SAMPLE SOLUTION TO EXAM in MAS501 Control Systems 2 Autumn 2015 Lecturer: Michael Ruderman Problem 1: Frequency-domain analysis and control design (15 pt) Given is a
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 informationResponses 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 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 informationVI. Z Transform and DT System Analysis
Summer 2008 Signals & Systems S.F. Hsieh VI. Z Transform and DT System Analysis Introduction Why Z transform? a DT counterpart of the Laplace transform in CT. Generalization of DT Fourier transform: z
More informationThe Z transform (2) 1
The Z transform (2) 1 Today Properties of the region of convergence (3.2) Read examples 3.7, 3.8 Announcements: ELEC 310 FINAL EXAM: April 14 2010, 14:00 pm ECS 123 Assignment 2 due tomorrow by 4:00 pm
More informationTHE EXTENSION OF DISCRETE-TIME FLUTTER MARGIN
8 TH INTERNATIONAL CONGRESS OF THE AERONAUTICAL SCIENCES THE ETENSION OF DISCRETE-TIME FLUTTER MARGIN Hiroshi Torii Meijo University htorii@meijo-u.ac.jp Keywords: aeroelasticity, flutter prediction, flutter
More informationOutline. Control systems. Lecture-4 Stability. V. Sankaranarayanan. V. Sankaranarayanan Control system
Outline Control systems Lecture-4 Stability V. Sankaranarayanan Outline Outline 1 Outline Outline 1 2 Concept of Stability Zero State Response: The zero-state response is due to the input only; all the
More informationDIGITAL SIGNAL PROCESSING UNIT III INFINITE IMPULSE RESPONSE DIGITAL FILTERS. 3.6 Design of Digital Filter using Digital to Digital
DIGITAL SIGNAL PROCESSING UNIT III INFINITE IMPULSE RESPONSE DIGITAL FILTERS Contents: 3.1 Introduction IIR Filters 3.2 Transformation Function Derivation 3.3 Review of Analog IIR Filters 3.3.1 Butterworth
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 informationSolutions. Number of Problems: 10
Final Exam February 2nd, 2013 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 informationHANDOUT E.22 - EXAMPLES ON STABILITY ANALYSIS
Example 1 HANDOUT E. - EXAMPLES ON STABILITY ANALYSIS Determine the stability of the system whose characteristics equation given by 6 3 = s + s + 3s + s + s + s +. The above polynomial satisfies the necessary
More informationTheory of Machines and Automatic Control Winter 2018/2019
Theory of Machines and Automatic Control Winter 2018/2019 Lecturer: Sebastian Korczak, PhD, Eng. Institute of Machine Design Fundamentals - Department of Mechanics http://www.ipbm.simr.pw.edu.pl/ Lecture
More informationDesign of IIR filters
Design of IIR filters Standard methods of design of digital infinite impulse response (IIR) filters usually consist of three steps, namely: 1 design of a continuous-time (CT) prototype low-pass filter;
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 informationEE480.3 Digital Control Systems. Part 2. z-transform
EE480.3 Digital Control Systems Part 2. z-transform Kunio Takaya Electrical and Computer Engineering University of Saskatchewan January 14, 2008 ** Go to full-screen mode now by hitting CTRL-L 1 Contents
More information