Design of IIR filters

Size: px
Start display at page:

Download "Design of IIR filters"

Transcription

1 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; 2 transformation of the low-pass filter to a CT filter of required kind; 3 discretization. Thus, let us start with a continuous-time impulse response h s (t) that is assumed to have a Laplace transform H c (s) = h c (t)e st dt, with s C, as well as a Fourier transform H c (jω) = H c (s) = s=jω h c (t)e jωt dt, with Ω R. As mentioned before, h c (t) is understood to be the impulse response of a continuous-time, linear, time-invariant system. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 1/47

2 Design of continuous-time lowpass filters Recall that, for a continuous-time filter with real coefficients, we have H c (jω) 2 = H c (s) H c ( s). s=jω We want H c (jω) 2 to approximate the magnitude-squared response of an ideal lowpass filter { H d (jω) 2 1, 0 Ω Ω c, = 0, Ω > Ω c, where Ω c is a cut-off frequency. Once H c (jω) 2 is computed, the problem is reduced to obtaining a causal and stable system H c (s) through spectral factorization. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 2/47

3 Design of continuous-time lowpass filters (cont.) The figure below depicts magnitude-squared specifications for lowpass analog filter design. Note that A p and A s are functions of parameters ɛ and A. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 3/47

4 The Butterworth approximation Classical approximation techniques use a magnitude-squared response of the form H c (jω) 2 = V 2 (Ω), where { V 2 (Ω) 1, for Ω Ω c, V 2 (Ω) 1, for Ω > Ω c. In particular, Butterworth (1930) suggested to use V 2 (Ω) = (Ω/Ω c ) 2N, with N = 1, 2,..., which results in H B (jω) 2 = (Ω/Ω c ) 2N. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 4/47

5 The Butterworth approximation (cont.) In this case, we have 1, if Ω = 0, H B (jω) 2 = 1/2, if Ω = Ω c, 0, if Ω =. Note that the transition approaches a brick wall, when N. Note also that H(jΩ) 2 is a monotone function of Ω. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 5/47

6 The Butterworth approximation (cont.) The poles of H B (s)h B ( s) are found by solving 1 + (s/jω c ) 2N = 0 (s/jω c ) 2N = 1 = e j(2k 1)π, with k = 1, 2,..., 2N. The solution yields s k = σ k + jω k = Ω c cos θ k + jω c sin θ k, where for k = 1, 2,..., 2N. θ k = π 2 + 2k 1 2N π, Thus, H B (s)h B ( s) has 2N poles, which are evenly distributed over a circle of radius Ω c in the complex plane. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 6/47

7 The Butterworth approximation (cont.) A stable system function H B (s) can be formed by choosing the (first) N poles which lie in the left-half plane, resulting in H B (s) = Ω N c (s s 1 )(s s 2 ) (s s N ). Note that the numerator is equal to Ω N c to assure H B (j 0) = 1. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 7/47

8 Design Procedure Suppose we wish to design a Butterworth lowpass filter specified by parameters Ω p, Ω s, ɛ, and A. Here 1/(1 + ɛ 2 ) and 1/A 2 define the passband and stopband ripple, respectively. Namely, ( ) ( ) 1 1 A p = 10 log ɛ 2 and A s = 10 log 10 A 2. Using the relative specification, we then have (Ω p /Ω c ) 2N ɛ 2 (Ω p /Ω c ) 2N ɛ 2, (Ω s /Ω c ) 2N 1 A 2 (Ω s /Ω c ) 2N A 2 1. The above inequalities can be combined to result in Ω N p A2 1 ɛ Ω N c A2 1 Ω N s. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 8/47

9 Design Procedure (cont.) Consequently, we obtain the following design equation. Butterworth design equation where α Ω s Ω p, N = ln α, ln β A A s/10 1 β = ɛ 10 A p/10 1. The cut-off frequency Ω c can be chosen anywhere in the interval Ω p (10 Ap/10 1) 1/(2N) Ω c Ω s (10 As/10 1) 1/(2N). In MATLAB, Butterworth filters can be designed using [N, Omegac] = buttord(omegap, Omegas, Ap, As, s ) [B, A] = butter(n, Omegac, s ) Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 9/47

10 Example We wish to design a Butterworth filter that satisfies 6 db 20 log 10 H(jΩ) 0, 0 Ω 2 rad/sec 20 log 10 H(jΩ) 20 db, 3 rad/sec Ω < Thus, A p = 6 and A s = 20. Therefore, ɛ = = and A = = 10. Using the above values, the filter design can now be completed in the following 5 steps. Step 1: Compute the parameters α and β as given by α = 3/2 = 1.5; β = Step 2: Compute order N using = N = ln α/ ln β = = 5. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 10/47

11 Example Step 3: Determine 3 db cutoff frequency Ω c, whose lower and upper values are respectively given by 2(10 6/10 1) 1/10 = and 3(10 20/10 1) 1/10 = It seems reasonable to choose Ω c = (Why?) Step 4: Compute pole locations. s k = cos(0.4π + 0.2πk) + j sin(0.4π + 0.2πk), with k = 1, 2, 3, 4, 5. Step 5: Compute the system function H B (s) as given by H B (s) = 5 k= = s s k s s s s s Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 11/47

12 The Chebyshev approximation The Chebyshev approximation results in equiripple design, which is optimal with respect to the minimax optimization criterion. The Chebyshev lowpass filter approximation is based on H C (jω) 2 = ɛ 2 T 2 N (Ω/Ω c), where T N is the Nth order Chebyshev polynomial. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 12/47

13 The Chebyshev approximation (cont.) Formally, Chebyshev polynomials are defined as { cos(n cos 1 x), x 1, T N (x) = cosh(n cosh 1 x), x > 1. Since the leading term of T N (x) is 2 N 1 x N, the values of T 2 N (x) grow very fast for x > 1. Thus, in the stopband, we have T 2 N (Ω/Ω c) 1 or, equivalently, H C (jω) 2 1, for Ω > Ω c. Moreover, and H C (j 0) 2 = { 1, if N is odd, 1/(1 + ɛ 2 ), if N is even, H C (j Ω c ) 2 = ɛ 2. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 13/47

14 The Chebyshev approximation (cont.) For Ω Ω c, H(jΩ) 2 has equiripple behaviour between 1 and 1/(1 + ɛ 2 ). For Ω Ω c, H(jΩ) 2 decreases monotonically toward zero, with the high-frequency roll-off of about 20N db/decade. The Chebyshev filter has 10 log 2 2(N 1) (or about 6(N 1) db) greater attenuation than the Butterworth filter. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 14/47

15 The Chebyshev approximation (cont.) The poles of H C (s)h C ( s) are obtained by solving T N (s/jω c ) = ±jɛ. Solving the equation yields s k = σ k + j Ω k = (Ω c sinh(φ)) cos θ k + j (Ω c cosh(φ)) sin θ k, where and θ k = π 2 + 2k 1 π, k = 1, 2,..., 2N, 2N φ = (1/N) sinh 1 (1/ɛ). One can see that, as opposed to the case of Butterworth filters, the poles of Chebyshev filters are located on an elliptic curve. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 15/47

16 The Chebyshev approximation (cont.) To obtain a stable system, we assign to H C (s) the poles located on the left-half plane (σ k < 0), which results in { G N H C (s) = N k=1 (s s k), with G = 1 ( s k ), N even, 1+ɛ 2 1, N odd. k=1 Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 16/47

17 Design procedure Starting with the specified parameters Ω p, A p, Ω s, and A s, for equiripple response in the passband, we choose Ω c = Ω p. Since H C (j Ω c ) 2 = 1/(1 + ɛ 2 ), the passband constraint is satisfied for all 0 Ω Ω p. In the stopband, we require that ɛ 2 T 2 N (Ω s/ω p ) 1 A 2 T N (Ω s /Ω p ) Since Ω s /Ω p > 1, this inequality is equivalent to cosh(n cosh 1 A2 1 (Ω s /Ω p )). ɛ A2 1. ɛ Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 17/47

18 Design procedure (cont.) Solving the above inequality produces the key design formulas. Chebyshev I design equation where N cosh 1 β cosh 1 α = ln(β + β2 1) ln(α + α 2 1), α = Ω s A A s/10 1, β = = Ω p ɛ 10 A p/10 1. In MATLAB, Chebyshev I filters can be designed using [N, Omegac] = cheb1ord(omegap, Omegas, Ap, As, s ) [B, A] = cheby1(n, Ap, Omegac, s ) Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 18/47

19 Example Once again, we design a filter that satisfies 6 db 20 log 10 H(jΩ) 0, 0 Ω 2 rad/sec 20 log 10 H(jΩ) 20 db, 3 rad/sec Ω < This time, however, we will use the Chebyshel I design. As before, we have ɛ = and A = 10. Step 1: Compute the parameters α and β as given by α = 3/2 = 1.5; β = Step 2: Compute order N using N = ( ln ) ln ( ) = = = 3. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 19/47

20 Example (cont.) Step 3: Set Ω c = Ω p = 2, and compute a = 2 sinh ( (1/3) sinh 1 (1/1.7266) ) = , b = 2 cosh ( (1/3) sinh 1 (1/1.7266) ) = Step 4: Compute pole locations. s 1 = cos(4π/6) + j sin(4π/6) = j1.7613, s 2 = cos(6π/6) + j sin(6π/6) = , s 3 = cos(8π/6) + j sin(8π/6) = j Step 5: Compute the filter gain G and the system function H C (s) G = ( j1.7613) ( j1.7613) 1 = H C (s) = k= = s s k s s s Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 20/47

21 Another example Let us design a Chebyshev I filter with F p = 40 Hz, A p = 1 db, F s = 50 Hz, A s = 30 db. using MATLAB. To this end, we use the following script. >> [N, Omegac] = cheb1ord(2*pi*40,2*pi*50,1,30,'s'); N = 7 >> Fc = Omegac/(2*pi); Fc = 40 >> [B, A] = cheby1(n,ap,omegac,'s'); Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 21/47

22 Another example (cont.) The group delay is more non-linear as compared to the case of a comparable Butterworth filter. Meeting the same specifications would require a Butterworth filter of order 19. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 22/47

23 The inverse Chebyshev approximation Replacing the frequency variable Ω/Ω c by Ω c /Ω converts the Chebyshev I low-pass filter into a Chebyshev highpass filter. If we subtract the highpass characteristic from unity, we obtain the inverse Chebyshev or Chebyshev II characteristic. H IC (jω) 2 = ɛ 2 TN 2(Ω c/ω) = ɛ2 TN 2(Ω c/ω) 1 + ɛ 2 TN 2(Ω c/ω). Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 23/47

24 The inverse Chebyshev approximation (cont.) The Chebyshev II approximation exhibits equiripple behavior in the stopband and monotonic maximally flat behavior in the passband. This filter has both zeros and poles. Specifically, the poles of the Chebyshev II filter are the reciprocals of those of the Chebyshev I filter, viz. s k = Ω c Ω c =. σ k /Ω c + jω k /Ω c σ k + jω k At the same time, the zeros of the Chebyshev II filter are Ω c ξ k = j, where u k = 2k 1 π, k = 1, 2,..., 2N. cos u k 2N 2 Thus, the zeros and poles of the Chebyshev II filter do not lie on any simple geometric curve. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 24/47

25 Example The design of Chebyshev II filter is very similar to that of the Chebyshev I filter. In MATLAB, Chebyshev II filters can be built using [N, Omegac] = cheb2ord(omegap, Omegas, Ap, As, s ) [B, A] = cheby2(n, As, Omegac, s ) Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 25/47

26 Continuous-to-discrete filter transformation Our next step is to transform CT filters to their DT counterparts. Each transformation is equivalent to a mapping function s = f(z) from the s-plane to the z-plane. Any useful mapping should satisfy three desirable conditions: 1. A rational H c (s) should be mapped to a rational H(z). 2. The imaginary axis of the s-plane is mapped on the unit circle of the z-plane, viz. {s = jω Ω R} {z = e jω ω (π, π]}. 3. The left-half s-plane is mapped into the interior of the unit circle of the z-plane, viz. {s R{s} < 0} {z z < 1}. Different procedures give rise to different mapping functions, and, hence, the resulting discrete-time filters are different. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 26/47

27 Impulse-invariance transformation (IIT) The most natural way to convert a CT filter to a DT filter is by sampling its impulse response h[n] T d h c (nt d ), n Z. This transformation is known as impulse-invariance transformation (IIT), since it preserves the shape of the impulse response. The resulting frequency response is H(e jω ) = ( H c j ω + j 2π ) k. T d T d k If the continuous-time filter is bandlimited, that is, H c (jω) = 0 for Ω π/t d, then, we have H(e jω ) = H c (jω/t d ), ω π. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 27/47

28 Mapping for the IIT What is the transformation s = f(z) in the case of IIT? To answer this question, we start with a system function H c (s) = N k=1 A k s s k, where the poles are assumed to be distinct. Taking the inverse Laplace transform yields h c (t) = N A k e skt u(t). k=1 Thus, the impulse response of the discrete-time filter is given by h[n] = N ( A k Td e s kt d n ) u[n] = T d k=1 N k=1 A k ( e s k T d ) n u[n]. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 28/47

29 Mapping for the IIT (cont.) The resulting system function of the discrete-time system is therefore given by H(z) = n N h[n]z n ( ) = T d A k e s k T d n z n. n=0 k=1 Interchanging the orders of summations yields H(z) = N k=1 where we assumed that e s kt d < 1. T d A k 1 e s kt dz 1, Thus, we have a transformation of the form 1 T d s s k 1 p k z 1, with p k = e s kt d. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 29/47

30 Mapping for the IIT (cont.) Note that the transformation 1 T d = s s k 1 p k z 1 maps the poles of the continuous-time filter to the poles of its discrete-time counterpart. Therefore, the mapping s = f(z) corresponding to impulse invariance is defined by z = e st d. More specifically, since s = σ + jω, we have r = e σ T d and ω = ΩT d. Note that σ < 0 implies 0 < r < 1, while σ > 0 implies r > 1. Since σ = 0 yields r = 1, the imaginary axis s = jω is mapped onto the UC. This map, however, is not one-to-one due to the effect of aliasing. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 30/47

31 Mapping for the IIT (cont.) Due to periodicity in ω, each horizontal strip of height 2π/T d in the s-plane is mapped into the entire z-pane. In fact, we have H(z) = z=e st d k= ( H c s + j 2πk ). T d Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 31/47

32 Example Consider a first-order continuous-time filter h c (t) = e 2t u(t) with H c (s) = 1/(s + 2) (and R(s) > 2). The discrete-time filter obtained by the IIT using T d = 0.1 is which results in H(z) = h[n] = 0.1 h c (0.1n) = 0.1 e 0.2n u[n], e 0.2 z 1 = 0.1, with z > z 1 We see that a 1st-order continuous-time system is transformed into a 1st-order discrete-time system. The mapping preserves stability and the lowpass characteristics of the magnitude response. The above system function could also be obtained using [B,A] = impinvar(1,[1,2],10). Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 32/47

33 Limitations of the IIT Consider the high-pass filter obtained by H c (s) = 1 H c (s) = = 1 1/(s + 2) = (s + 1)/(s + 2). The impulse response of the high-pass filter is h c (t) = δ(t) h c (t) = δ(t) e 2t u(t). The presence of δ(t) renders the IIT approach impractical. Since the delta function appears when N = M, the IIT cannot be used for systems with improper system functions (like high-pass & band-stop filters). Impulse-invariance can be applied to low-pass & band-pass filters that have strictly proper transfer functions. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 33/47

34 Design procedure Starting with the design parameters ω p, ω s, A p and A s, first compute Ω p = ω p /T d and Ω s = ω s /T d for some T d. Subsequently, design an equivalent continuos-time filter (such as, e.g., Butterworth or Chebyshev I). Finally, map the continuous poles into the discrete poles according to p k = e s kt d, k, to result in H(z). We note that the above design does not depend on a particular value of T d, which therefore may be set arbitrarily. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 34/47

35 Example >> omegap = 0.25*pi; omegas = 0.4*pi; Ap = 1; As = 30; >> Td = 0.1; Omegap = omegap/td; Omegas = omegas/td; >> [N, Omegac] = cheb1ord(omegap, Omegas, Ap, As, 's'); % N = 5 >> [C, D] = cheby1(n, Ap, Omegac, 's'); >> [B, A] = impinvar(c, D, 1/Td); Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 35/47

36 Bilinear transformation To avoid the aliasing-related problems of the IIT, a one-to-one mapping from the s-plane to the z-plane is required. One of such mapping is the bilinear transformation given by s = f(z) = 2 T d 1 z z 1. Here, T d is not interpreted as a sampling interval, and can have an arbitrary value. Given H c (s), the bilinear transform is applied as H(z) = H c (s). s= 2 1 z 1 T d 1+z 1 In this case, every zero/pole ν k is transformed according to s ν k = 2(1 T [ dν k /2) T d (1 + z T ] dν k /2 ) 1 T d ν k /2 z 1. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 36/47

37 Bilinear transformation (cont.) One can show that the mapping results in H(z) = G (1 + z 1 ) N M M k=1 (1 z kz 1 ) N k=1 (1 p, kz 1 ) where and z k = 1 + T dξ k /2 1 T d ξ k /2, p k = 1 + T ds k /2 1 T d s k /2, G = β 0(T d /2) N M M k=1 (1 ξ kt d /2) N k=1 (1 s, kt d /2) where β 0 is the gain of the CT filter. In MATLAB, the above transformations are implemented by functions [zd, pd, G] = bilinear(zc, pc, beta0, Fd) [B, A] = bilinear(c, D, Fd) Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 37/47

38 Example Consider the following CT system: H c (s) = 5(s + 2) 5s + 10 = (s + 3)(s + 4) s 2 + 7s In this case, we obtain (using T d /2 = 1) z 1 = 1 + ( 2) 1 ( 2) = 1 3, z 2 = 1, p 1 = 1 + ( 3) 1 ( 3) = 1 2, 1 + ( 4) 1 ( 4) = 3 5, as well as G = 5 1 (1 ( 2)) (1 ( 3))(1 ( 4)) = 3 4. Hence, H(z) = 3 (1 + z 1 )(1 + 1/3z 1 ) 4 (1 + 1/2z 1 )(1 + 3/5z 1 ) = z z z z 2. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 38/47

39 Mapping properties In terms of the s variable, we have z = re jω = 2/T d + s 2/T d s = 2/T d + σ + jω 2/T d σ jω. One can then show that: 1) r < 1 if σ < 0, 2) r = 1 if σ = 0, and 3) r > 1 if σ > 0. Thus, the bilinear transformation preserves stability. At the same time, ω and Ω are related as which shows that ω = 2 tan 1 (ΩT d /2) or Ω = (2/T d ) tan(ω/2), Ω = 0 ω = 0 Ω = ω = π Ω = ω = π. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 39/47

40 Mapping properties (cont.) Therefore, we have the following type of mapping. Since the entire jω axis is mapped onto the UC, the transformation is free of aliasing artifacts. However, the highly nonlinear relation between Ω and ω needs to be treated with precaution. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 40/47

41 Frequency warping The nonlinear relation between Ω and ω is known as frequency warping. The relation is approximately linear for ω 0.3π. Thus, any shape of magnitude response in this range is preserved. Frequency warping does not distort flat magnitude responses. Frequency warping distorts non-flat magnitude responses. (So, a CT differentiator cannot be converted to a DT one.) Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 41/47

42 Frequency warping (cont.) Frequency warping distors the location of frequency bands and their width. Therefore, the design specifications for the CT filter have to be determined by prewarping according to Ω k = 2 T d tan ω k 2, where ω k is a required band edge. During the bilinear transformation, the frequencies are properly unwarped, in which case the effect of T d is cancelled. In practice, it is often convenient to use T d = 2. In summary, the use of bilinear transformation should be avoided when designing wideband discrete-time differentiators and linearphase filters. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 42/47

43 Frequency warping (cont.) Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 43/47

44 Design procedure Starting with the design parameters ω p, ω s, A p and A s, first set T d = 2 and compute Ω p = tan(ω p /2) and Ω s = tan(ω s /2). Subsequently, design an equivalent continuos-time filter (such as, e.g., Butterworth, Chebyshev I, or Chebyshev II) H c (s). Determine zeros, poles, and gain of H c (s) and map these quantities into corresponding zeros, poles, and gain of H(z). Finally, assemble the desired digital filter system function H(z). Note that all the above procedures are performed by MATLAB function bilinear. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 44/47

45 Frequency transformations of low-pass filters Frequency transformations are needed to transform low-pass filters to high-pass, band-pass, and band-stop filters. Given a prototype CT low-pass filter H c (s) and its discrete counterpart H(z), one can apply frequency transformation to either H c (s) (continuous) or H(z) (discrete). If the bilinear transformation is used to convert H c (s) into H(z), the frequency transformation can be applied to either of the two. If the IIT is used instead, the frequency transformation should be applied to H(z). (Why?) Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 45/47

46 Continuous-time frequency transformation The table below shows a typical set of frequency transformations that transform a normalized prototype low-pass filter H c (s) with cutoff frequency Ω c = 1 rad/s to filters with cutoff frequencies Ω c, Ω 1, and Ω 2. Note that the lowpass to bandpass, and lowpass to bandstop transformations double the order of the filter. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 46/47

47 Discrete-time frequency transformation Discrete-time frequency transformations are usually performed through z 1 G(z 1 ), where with α k < 1. G(z 1 ) = ± N k=1 z 1 α k 1 α k z 1, By properly choosing the values of N and α k, one can obtain a variety of mappings. For specific formulas, see p.678 of the course textbook. In MATLAB, frequency transformations are performed by functions lp2lp, lp2hp, lp2bp, and lp2bs. The FDATool of MATLAB provides a convenient environment for designing a variety of different digital filters. Prof. O. Michailovich, Dept of ECE, Winter 2017 ECE 413: Digital Signal Processing / Section 9 47/47

Digital Signal Processing IIR Filter Design via Bilinear Transform

Digital Signal Processing IIR Filter Design via Bilinear Transform Digital Signal Processing IIR Filter Design via Bilinear Transform D. Richard Brown III D. Richard Brown III 1 / 12 Basic Procedure We assume here that we ve already decided to use an IIR filter. The basic

More information

Digital Control & Digital Filters. Lectures 21 & 22

Digital Control & Digital Filters. Lectures 21 & 22 Digital Controls & Digital Filters Lectures 2 & 22, Professor Department of Electrical and Computer Engineering Colorado State University Spring 205 Review of Analog Filters-Cont. Types of Analog Filters:

More information

Filter Analysis and Design

Filter Analysis and Design Filter Analysis and Design Butterworth Filters Butterworth filters have a transfer function whose squared magnitude has the form H a ( jω ) 2 = 1 ( ) 2n. 1+ ω / ω c * M. J. Roberts - All Rights Reserved

More information

Digital Signal Processing

Digital Signal Processing COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #24 Tuesday, November 4, 2003 6.8 IIR Filter Design Properties of IIR Filters: IIR filters may be unstable Causal IIR filters with rational system

More information

Lecture 16: Filter Design: Impulse Invariance and Bilinear Transform

Lecture 16: Filter Design: Impulse Invariance and Bilinear Transform EE58 Digital Signal Processing University of Washington Autumn 2 Dept. of Electrical Engineering Lecture 6: Filter Design: Impulse Invariance and Bilinear Transform Nov 26, 2 Prof: J. Bilmes

More information

EE482: Digital Signal Processing Applications

EE482: Digital Signal Processing Applications Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:30-15:45 CBC C222 Lecture 05 IIR Design 14/03/04 http://www.ee.unlv.edu/~b1morris/ee482/

More information

An Iir-Filter Example: A Butterworth Filter

An Iir-Filter Example: A Butterworth Filter An Iir-Filter Example: A Butterworth Filter Josef Goette Bern University of Applied Sciences, Biel Institute of Human Centered Engineering - microlab JosefGoette@bfhch February 7, 2017 Contents 1 Introduction

More information

Digital Signal Processing Lecture 8 - Filter Design - IIR

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

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

DIGITAL SIGNAL PROCESSING. Chapter 6 IIR Filter Design

DIGITAL SIGNAL PROCESSING. Chapter 6 IIR Filter Design DIGITAL SIGNAL PROCESSING Chapter 6 IIR Filter Design OER Digital Signal Processing by Dr. Norizam Sulaiman work is under licensed Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

More information

ECE 410 DIGITAL SIGNAL PROCESSING D. Munson University of Illinois Chapter 12

ECE 410 DIGITAL SIGNAL PROCESSING D. Munson University of Illinois Chapter 12 . ECE 40 DIGITAL SIGNAL PROCESSING D. Munson University of Illinois Chapter IIR Filter Design ) Based on Analog Prototype a) Impulse invariant design b) Bilinear transformation ( ) ~ widely used ) Computer-Aided

More information

Lecture 9 Infinite Impulse Response Filters

Lecture 9 Infinite Impulse Response Filters Lecture 9 Infinite Impulse Response Filters Outline 9 Infinite Impulse Response Filters 9 First-Order Low-Pass Filter 93 IIR Filter Design 5 93 CT Butterworth filter design 5 93 Bilinear transform 7 9

More information

INFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters 4. THE BUTTERWORTH ANALOG FILTER

INFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters 4. THE BUTTERWORTH ANALOG FILTER INFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters. INTRODUCTION 2. IIR FILTER DESIGN 3. ANALOG FILTERS 4. THE BUTTERWORTH ANALOG FILTER 5. THE CHEBYSHEV-I

More information

Multirate signal processing

Multirate signal processing Multirate signal processing Discrete-time systems with different sampling rates at various parts of the system are called multirate systems. The need for such systems arises in many applications, including

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

Filter Design Problem

Filter Design Problem Filter Design Problem Design of frequency-selective filters usually starts with a specification of their frequency response function. Practical filters have passband and stopband ripples, while exhibiting

More information

V. IIR Digital Filters

V. IIR Digital Filters Digital Signal Processing 5 March 5, V. IIR Digital Filters (Deleted in 7 Syllabus). (dded in 7 Syllabus). 7 Syllabus: nalog filter approximations Butterworth and Chebyshev, Design of IIR digital filters

More information

Chapter 7: IIR Filter Design Techniques

Chapter 7: IIR Filter Design Techniques IUST-EE Chapter 7: IIR Filter Design Techniques Contents Performance Specifications Pole-Zero Placement Method Impulse Invariant Method Bilinear Transformation Classical Analog Filters DSP-Shokouhi Advantages

More information

Lecture 8 - IIR Filters (II)

Lecture 8 - IIR Filters (II) Lecture 8 - IIR Filters (II) James Barnes (James.Barnes@colostate.edu) Spring 2009 Colorado State University Dept of Electrical and Computer Engineering ECE423 1 / 27 Lecture 8 Outline Introduction Digital

More information

MITOCW watch?v=jtj3v Rx7E

MITOCW watch?v=jtj3v Rx7E MITOCW watch?v=jtj3v Rx7E The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. To

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

2.161 Signal Processing: Continuous and Discrete Fall 2008

2.161 Signal Processing: Continuous and Discrete Fall 2008 MIT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. I Reading:

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

Digital Signal Processing

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

UNIT - III PART A. 2. Mention any two techniques for digitizing the transfer function of an analog filter?

UNIT - III PART A. 2. Mention any two techniques for digitizing the transfer function of an analog filter? UNIT - III PART A. Mention the important features of the IIR filters? i) The physically realizable IIR filters does not have linear phase. ii) The IIR filter specification includes the desired characteristics

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

Analog and Digital Filter Design

Analog and Digital Filter Design Analog and Digital Filter Design by Jens Hee http://jenshee.dk October 208 Change log 28. september 208. Document started.. october 208. Figures added. 6. october 208. Bilinear transform chapter extended.

More information

Lecture 3 - Design of Digital Filters

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

Signals and Systems. Lecture 11 Wednesday 22 nd November 2017 DR TANIA STATHAKI

Signals and Systems. Lecture 11 Wednesday 22 nd November 2017 DR TANIA STATHAKI Signals and Systems Lecture 11 Wednesday 22 nd November 2017 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON Effect on poles and zeros on frequency response

More information

Lecture 8 - IIR Filters (II)

Lecture 8 - IIR Filters (II) Lecture 8 - IIR Filters (II) James Barnes (James.Barnes@colostate.edu) Spring 24 Colorado State University Dept of Electrical and Computer Engineering ECE423 1 / 29 Lecture 8 Outline Introduction Digital

More information

Chapter 5 Frequency Domain Analysis of Systems

Chapter 5 Frequency Domain Analysis of Systems Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this

More information

ELEG 5173L Digital Signal Processing Ch. 5 Digital Filters

ELEG 5173L Digital Signal Processing Ch. 5 Digital Filters Department of Electrical Engineering University of Aransas ELEG 573L Digital Signal Processing Ch. 5 Digital Filters Dr. Jingxian Wu wuj@uar.edu OUTLINE 2 FIR and IIR Filters Filter Structures Analog Filters

More information

INF3440/INF4440. Design of digital filters

INF3440/INF4440. Design of digital filters Last week lecture Today s lecture: Chapter 8.1-8.3, 8.4.2, 8.5.3 INF3440/INF4440. Design of digital filters October 2004 Last week lecture Today s lecture: Chapter 8.1-8.3, 8.4.2, 8.5.3 Last lectures:

More information

Filters and Tuned Amplifiers

Filters and Tuned Amplifiers Filters and Tuned Amplifiers Essential building block in many systems, particularly in communication and instrumentation systems Typically implemented in one of three technologies: passive LC filters,

More information

PS403 - Digital Signal processing

PS403 - Digital Signal processing PS403 - Digital Signal processing 6. DSP - Recursive (IIR) Digital Filters Key Text: Digital Signal Processing with Computer Applications (2 nd Ed.) Paul A Lynn and Wolfgang Fuerst, (Publisher: John Wiley

More information

The Approximation Problem

The Approximation Problem EE 508 Lecture 3 The Approximation Problem Classical Approximating Functions - Thompson and Bessel Approximations Review from Last Time Elliptic Filters Can be thought of as an extension of the CC approach

More information

2.161 Signal Processing: Continuous and Discrete Fall 2008

2.161 Signal Processing: Continuous and Discrete Fall 2008 MT OpenCourseWare http://ocw.mit.edu 2.6 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Massachusetts

More 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

Chapter 7: Filter Design 7.1 Practical Filter Terminology

Chapter 7: Filter Design 7.1 Practical Filter Terminology hapter 7: Filter Design 7. Practical Filter Terminology Analog and digital filters and their designs constitute one of the major emphasis areas in signal processing and communication systems. This is due

More information

1 1.27z z 2. 1 z H 2

1 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

Chapter 5 Frequency Domain Analysis of Systems

Chapter 5 Frequency Domain Analysis of Systems Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this

More information

Quadrature-Mirror Filter Bank

Quadrature-Mirror Filter Bank Quadrature-Mirror Filter Bank In many applications, a discrete-time signal x[n] is split into a number of subband signals { v k [ n]} by means of an analysis filter bank The subband signals are then processed

More information

Computer-Aided Design of Digital Filters. Digital Filters. Digital Filters. Digital Filters. Design of Equiripple Linear-Phase FIR Filters

Computer-Aided Design of Digital Filters. Digital Filters. Digital Filters. Digital Filters. Design of Equiripple Linear-Phase FIR Filters Computer-Aided Design of Digital Filters The FIR filter design techniques discussed so far can be easily implemented on a computer In addition, there are a number of FIR filter design algorithms that rely

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

The Approximation Problem

The Approximation Problem EE 508 Lecture The Approximation Problem Classical Approximating Functions - Elliptic Approximations - Thompson and Bessel Approximations Review from Last Time Chebyshev Approximations T Type II Chebyshev

More information

LINEAR-PHASE FIR FILTERS DESIGN

LINEAR-PHASE FIR FILTERS DESIGN LINEAR-PHASE FIR FILTERS DESIGN Prof. Siripong Potisuk inimum-phase Filters A digital filter is a minimum-phase filter if and only if all of its zeros lie inside or on the unit circle; otherwise, it is

More information

2.161 Signal Processing: Continuous and Discrete

2.161 Signal Processing: Continuous and Discrete MIT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete Fall 28 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. MASSACHUSETTS

More information

Cast of Characters. Some Symbols, Functions, and Variables Used in the Book

Cast of Characters. Some Symbols, Functions, and Variables Used in the Book Page 1 of 6 Cast of Characters Some s, Functions, and Variables Used in the Book Digital Signal Processing and the Microcontroller by Dale Grover and John R. Deller ISBN 0-13-081348-6 Prentice Hall, 1998

More information

Lectures: Lumped element filters (also applies to low frequency filters) Stub Filters Stepped Impedance Filters Coupled Line Filters

Lectures: Lumped element filters (also applies to low frequency filters) Stub Filters Stepped Impedance Filters Coupled Line Filters ECE 580/680 Microwave Filter Design Lectures: Lumped element filters (also applies to low frequency filters) Stub Filters Stepped Impedance Filters Coupled Line Filters Lumped Element Filters Text Section

More information

Grades will be determined by the correctness of your answers (explanations are not required).

Grades will be determined by the correctness of your answers (explanations are not required). 6.00 (Fall 20) Final Examination December 9, 20 Name: Kerberos Username: Please circle your section number: Section Time 2 am pm 4 2 pm Grades will be determined by the correctness of your answers (explanations

More information

Multimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2

Multimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Multimedia Signals and Systems - Audio and Video Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Kunio Takaya Electrical and Computer Engineering University of Saskatchewan December

More information

Digital Signal Processing

Digital Signal Processing Digital Signal Proceing IIR Filter Deign Manar Mohaien Office: F8 Email: manar.ubhi@kut.ac.kr School of IT Engineering Review of the Precedent Lecture Propertie of FIR Filter Application of FIR Filter

More information

FROM ANALOGUE TO DIGITAL

FROM ANALOGUE TO DIGITAL SIGNALS AND SYSTEMS: PAPER 3C1 HANDOUT 7. Dr David Corrigan 1. Electronic and Electrical Engineering Dept. corrigad@tcd.ie www.mee.tcd.ie/ corrigad FROM ANALOGUE TO DIGITAL To digitize signals it is necessary

More information

DSP. Chapter-3 : Filter Design. Marc Moonen. Dept. E.E./ESAT-STADIUS, KU Leuven

DSP. Chapter-3 : Filter Design. Marc Moonen. Dept. E.E./ESAT-STADIUS, KU Leuven DSP Chapter-3 : Filter Design Marc Moonen Dept. E.E./ESAT-STADIUS, KU Leuven marc.moonen@esat.kuleuven.be www.esat.kuleuven.be/stadius/ Filter Design Process Step-1 : Define filter specs Pass-band, stop-band,

More information

Filter structures ELEC-E5410

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

ESE 531: Digital Signal Processing

ESE 531: Digital Signal Processing ESE 531: Digital Signal Processing Lec 8: February 12th, 2019 Sampling and Reconstruction Lecture Outline! Review " Ideal sampling " Frequency response of sampled signal " Reconstruction " Anti-aliasing

More information

Optimum Ordering and Pole-Zero Pairing of the Cascade Form IIR. Digital Filter

Optimum Ordering and Pole-Zero Pairing of the Cascade Form IIR. Digital Filter Optimum Ordering and Pole-Zero Pairing of the Cascade Form IIR Digital Filter There are many possible cascade realiations of a higher order IIR transfer function obtained by different pole-ero pairings

More information

Today. ESE 531: Digital Signal Processing. IIR Filter Design. Impulse Invariance. Impulse Invariance. Impulse Invariance. ω < π.

Today. ESE 531: Digital Signal Processing. IIR Filter Design. Impulse Invariance. Impulse Invariance. Impulse Invariance. ω < π. Today ESE 53: Digital Signal Processing! IIR Filter Design " Lec 8: March 30, 207 IIR Filters and Adaptive Filters " Bilinear Transformation! Transformation of DT Filters! Adaptive Filters! LMS Algorithm

More information

Lecture 8: Signal Reconstruction, DT vs CT Processing. 8.1 Reconstruction of a Band-limited Signal from its Samples

Lecture 8: Signal Reconstruction, DT vs CT Processing. 8.1 Reconstruction of a Band-limited Signal from its Samples EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 8: Signal Reconstruction, D vs C Processing Oct 24, 2001 Prof: J. Bilmes

More information

DSP-CIS. Chapter-4: FIR & IIR Filter Design. Marc Moonen

DSP-CIS. Chapter-4: FIR & IIR Filter Design. Marc Moonen DSP-CIS Chapter-4: FIR & IIR Filter Design Marc Moonen Dept. E.E./ESAT-STADIUS, KU Leuven marc.moonen@esat.kuleuven.be www.esat.kuleuven.be/stadius/ PART-II : Filter Design/Realization Step-1 : Define

More information

EE 354 Fall 2013 Lecture 10 The Sampling Process and Evaluation of Difference Equations

EE 354 Fall 2013 Lecture 10 The Sampling Process and Evaluation of Difference Equations EE 354 Fall 203 Lecture 0 The Sampling Process and Evaluation of Difference Equations Digital Signal Processing (DSP) is centered around the idea that you can convert an analog signal to a digital signal

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

Multirate Digital Signal Processing

Multirate Digital Signal Processing Multirate Digital Signal Processing Basic Sampling Rate Alteration Devices Up-sampler - Used to increase the sampling rate by an integer factor Down-sampler - Used to decrease the sampling rate by an integer

More information

Discrete-time first-order systems

Discrete-time first-order systems Discrete-time first-order systems 1 Start with the continuous-time system ẏ(t) =ay(t)+bu(t), y(0) Zero-order hold input u(t) =u(nt ), nt apple t

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

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

The Approximation Problem

The Approximation Problem EE 508 Lecture The Approximation Problem Classical Approximating Functions - Elliptic Approximations - Thompson and Bessel Approximations Review from Last Time Chebyshev Approximations T Type II Chebyshev

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

APPLIED SIGNAL PROCESSING

APPLIED SIGNAL PROCESSING APPLIED SIGNAL PROCESSING DIGITAL FILTERS Digital filters are discrete-time linear systems { x[n] } G { y[n] } Impulse response: y[n] = h[0]x[n] + h[1]x[n 1] + 2 DIGITAL FILTER TYPES FIR (Finite Impulse

More information

EE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley

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

Time Series Analysis: 4. Linear filters. P. F. Góra

Time Series Analysis: 4. Linear filters. P. F. Góra Time Series Analysis: 4. Linear filters P. F. Góra http://th-www.if.uj.edu.pl/zfs/gora/ 2012 Linear filters in the Fourier domain Filtering: Multiplying the transform by a transfer function. g n DFT G

More information

LTI Systems (Continuous & Discrete) - Basics

LTI Systems (Continuous & Discrete) - Basics LTI Systems (Continuous & Discrete) - Basics 1. A system with an input x(t) and output y(t) is described by the relation: y(t) = t. x(t). This system is (a) linear and time-invariant (b) linear and time-varying

More information

Design of Stable IIR filters with prescribed flatness and approximately linear phase

Design of Stable IIR filters with prescribed flatness and approximately linear phase Design of Stable IIR filters with prescribed flatness and approximately linear phase YASUNORI SUGITA Nagaoka University of Technology Dept. of Electrical Engineering Nagaoka city, Niigata-pref., JAPAN

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

Butterworth Filter Properties

Butterworth Filter Properties OpenStax-CNX module: m693 Butterworth Filter Properties C. Sidney Burrus This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 3. This section develops the properties

More information

UNIVERSITI SAINS MALAYSIA. EEE 512/4 Advanced Digital Signal and Image Processing

UNIVERSITI SAINS MALAYSIA. EEE 512/4 Advanced Digital Signal and Image Processing -1- [EEE 512/4] UNIVERSITI SAINS MALAYSIA First Semester Examination 2013/2014 Academic Session December 2013 / January 2014 EEE 512/4 Advanced Digital Signal and Image Processing Duration : 3 hours Please

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

Matched Second Order Digital Filters

Matched Second Order Digital Filters Matched Second Order Digital Filters Martin Vicanek 14. February 016 1 Introduction Second order sections are universal building blocks for digital filters. They are characterized by five coefficients,

More information

Transform Representation of Signals

Transform Representation of Signals C H A P T E R 3 Transform Representation of Signals and LTI Systems As you have seen in your prior studies of signals and systems, and as emphasized in the review in Chapter 2, transforms play a central

More information

Electronic Circuits EE359A

Electronic Circuits EE359A Electronic Circuits EE359A Bruce McNair B26 bmcnair@stevens.edu 21-216-5549 Lecture 22 569 Second order section Ts () = s as + as+ a 2 2 1 ω + s+ ω Q 2 2 ω 1 p, p = ± 1 Q 4 Q 1 2 2 57 Second order section

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

The Laplace Transform

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

NAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response.

NAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response. University of California at Berkeley Department of Electrical Engineering and Computer Sciences Professor J. M. Kahn, EECS 120, Fall 1998 Final Examination, Wednesday, December 16, 1998, 5-8 pm NAME: 1.

More information

Speaker: Arthur Williams Chief Scientist Telebyte Inc. Thursday November 20 th 2008 INTRODUCTION TO ACTIVE AND PASSIVE ANALOG

Speaker: Arthur Williams Chief Scientist Telebyte Inc. Thursday November 20 th 2008 INTRODUCTION TO ACTIVE AND PASSIVE ANALOG INTRODUCTION TO ACTIVE AND PASSIVE ANALOG FILTER DESIGN INCLUDING SOME INTERESTING AND UNIQUE CONFIGURATIONS Speaker: Arthur Williams Chief Scientist Telebyte Inc. Thursday November 20 th 2008 TOPICS Introduction

More information

w n = c k v n k (1.226) w n = c k v n k + d k w n k (1.227) Clearly non-recursive filters are a special case of recursive filters where M=0.

w n = c k v n k (1.226) w n = c k v n k + d k w n k (1.227) Clearly non-recursive filters are a special case of recursive filters where M=0. Random Data 79 1.13 Digital Filters There are two fundamental types of digital filters Non-recursive N w n = c k v n k (1.226) k= N and recursive N M w n = c k v n k + d k w n k (1.227) k= N k=1 Clearly

More information

Computer Engineering 4TL4: Digital Signal Processing

Computer Engineering 4TL4: Digital Signal Processing Computer Engineering 4TL4: Digital Signal Processing Day Class Instructor: Dr. I. C. BRUCE Duration of Examination: 3 Hours McMaster University Final Examination December, 2003 This examination paper includes

More information

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n. ECE 3 Fall Division Homework Solutions Problem. Reconstruction of a continuous-time signal from its samples. Consider the following periodic signal, depicted below: {, if n t < n +, for any integer n,

More information

Grades will be determined by the correctness of your answers (explanations are not required).

Grades will be determined by the correctness of your answers (explanations are not required). 6.00 (Fall 2011) Final Examination December 19, 2011 Name: Kerberos Username: Please circle your section number: Section Time 2 11 am 1 pm 4 2 pm Grades will be determined by the correctness of your answers

More information

A system that is both linear and time-invariant is called linear time-invariant (LTI).

A system that is both linear and time-invariant is called linear time-invariant (LTI). The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Lecture Notes: Time, Frequency & Transform Domains February 28, 2012 Signals & Systems Signals are mapped

More 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

X. Chen More on Sampling

X. Chen More on Sampling X. Chen More on Sampling 9 More on Sampling 9.1 Notations denotes the sampling time in second. Ω s = 2π/ and Ω s /2 are, respectively, the sampling frequency and Nyquist frequency in rad/sec. Ω and ω denote,

More information

Time Series Analysis: 4. Digital Linear Filters. P. F. Góra

Time Series Analysis: 4. Digital Linear Filters. P. F. Góra Time Series Analysis: 4. Digital Linear Filters P. F. Góra http://th-www.if.uj.edu.pl/zfs/gora/ 2018 Linear filters Filtering in Fourier domain is very easy: multiply the DFT of the input by a transfer

More information

ECE 8440 Unit 17. Parks- McClellan Algorithm

ECE 8440 Unit 17. Parks- McClellan Algorithm Parks- McClellan Algorithm ECE 8440 Unit 17 The Parks- McClellan Algorithm is a computer method to find the unit sample response h(n for an op=mum FIR filter that sa=sfies the condi=ons of the Alterna=on

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

# 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

Electronic Circuits EE359A

Electronic Circuits EE359A Electronic Circuits EE359A Bruce McNair B26 bmcnair@stevens.edu 21-216-5549 Lecture 22 578 Second order LCR resonator-poles V o I 1 1 = = Y 1 1 + sc + sl R s = C 2 s 1 s + + CR LC s = C 2 sω 2 s + + ω

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

There are two main classes of digital lter FIR (Finite impulse response) and IIR (innite impulse reponse).

There are two main classes of digital lter FIR (Finite impulse response) and IIR (innite impulse reponse). FIR Filters I There are two main classes of digital lter FIR (Finite impulse response) and IIR (innite impulse reponse). FIR Digital Filters These are described by dierence equations of the type: y[n]

More information