EEE 303 HW#2 Solutions 1.43 a.

Size: px
Start display at page:

Download "EEE 303 HW#2 Solutions 1.43 a."

Transcription

1 EEE 33 HW # SOLUTIONS Problem.5 Since x(t) =fort<3, we have that x(t) =U(t 3)x(t). a. x( t) =x( t)u( t 3) = x( t)u( t ) which is zero for t>. b. x( t)+x( t) =x( t)u( t ) + x( t)u( t ) which is zero for t>. c. x( t)x( t) =x( t)u( t )x( t)u( t ) = x( t)x( t)u( t ) which is zero for t>. d. x(3t) =x(3t)u(3t 3) which is zero for t<. e. x(t=3) = x(t=3)u(t=3 3) which is zero for t<9.

2 EEE 33 HW# Solutions.43 a. Let H denote a TI system such that y = H[x] and suppose that x is periodic. That is, x(t+t)=x(t), for all t. Alternatively, in terms of the shift operator T, T -T [x] = x. Now, for y to be periodic, we should also have T -T [y] = y. Substituting y = H[x], we get T -T [y] = T -T H[x] = HT -T [x] (TI system, commutes with shifts) = H[x] (x is periodic) = y (The derivations hold in discrete time as well.) b. The zero system (y = ) is an easy but trivial example. A more interesting case is a low-pass filter eliminating the high frequency component of, say, x(t) = sin t + sin πt. (More details later.)

3 EEE 33 HW#3 Solutions. a. ( ) cos( ) ( )cos( ) ( )cos() u t t dt δ t t dt = 5 sin( = δ t dt = b. π ) ( 3), because δ(t+3) = for t in [,5]. 5 t δ t + dt = d[cos(πt)] = t dt u ( t c. u τ )cos(πτ ) dτ π sin(π ), since is in [-5,5]. 5 ( = = = Alternatively, using integration by parts and Then, 5 5 u ( τ )cos(πτ ) dτ = ) d =, we have that ( τ ) = δ ( ) τ dδ ( t) dt dδ ( τ ) cos(πτ ) dτ = dτ 5 5 d cos πτ [ δ ( t)cos(πt) ] + δ ( τ ) dτ = sin(π) = where we used the fact that δ(-5)= δ(+5) =. dτ u. τ d.47 Let y = h *x. Then, a. [ h ( t)]*[x ( t)] = ( h * x ) = y, (linearity of convolution) b. [ h ( t)]*[ x ( t) x ( t )] = ( h * x )( t) [ h ( t)]*[ x ( t )] = y ( t) y ( t ), where the first equality follows from linearity and the second from time-invariance. c. Using time-invariance, [ h ( t + )]*[ x ( t )] = ([ h ( t)]*[ x ( t )])( t + ). But, [ h ( t)]*[ x ( t )] = ([ h ( t)]*[ x ( t)])( t ) = y ( t ). Hence, [ h ( t + )]*[ x ( t )] = y ( t + ) = y ( t ). Alternatively, using the definition of the shift operator T and its commutativity with convolution, [ h = y ( t + )]*[ x ( t )] = ( T h ) *( T x ) = T T ( h * x ) T. d. There is not enough information to determine the output in this case. To prove this statement we need to find two pairs (h,x ) that produce the same response y and such that their corresponding transformations produce different responses. For this, consider h (t) = U(t) (a unit step) and x (t) = {a pulse in [,] with amplitude ½}. As a second pair, consider h (t) = y (t), x (t) = δ(t). For the first pair, it follows that [h (t)]*[x (-t)] = y (t+). But for the second pair, [h (t)]*[x (-t)] = y (t). e. Reflections are not time-invariant operations so we need to work with the convolution integral itself. Using a transformation of the integration variable σ = τ, we have that y (-t) can be expressed as: ( t y t) = h ( t τ ) x ( τ ) dτ = h ( t + σ ) x ( σ ) dσ = h( t σ ) x( σ ) dσ = ( h * x)( ) Notice that this is not a simple transformation of the independent variable. That is, we may not simply state that since y (t) = h (t)*x (t), then y (-t) = h (-t)*x (-t). Even though the final relationship is true, this statement is wrong as an implication! The error is caused by the bad notation (h(t)*x(t) is nonsense). This error becomes apparent when we consider scaling of the independent variable. That is, using the previous derivation it follows that y (at) = a [h (at)]*[x (at)] (and not h (at)*x (at), as one might expect!) f. Using the property of the unit doublet u, that x = u *x, we have that y = h * x = h' = y * x' = ( u * h ) *( u * x ) = u * u *( h * x ) From the graph of y, it follows that y(t) = ½ δ(t) ½ δ(t-). ''

4 EEE 33 HW # 4 SOLUTIONS Problem.3 Using the linearity and time invariance of convolution, we have that (T denotes the shift) Ã! X h x = h T kt ± k = X h (T kt ±) k = X k = X k T kt (h ±) T kt h So, nally, y(t) = X k h(t kt) T = 4 T = T =.5 T =

5 EEE 33 HW#4 Solutions 3.5 The Fourier series coefficients of the output y(t), say b k are related to the Fourier series coefficients of the input (a k ) by b k = H(jkw ) a k where w = π / T =. Since H(jw) = for w >, it follows that b k = for k >, or k > /, or k 9. Since it is given that x(t) = y(t), then a k = b k (uniqueness of the FS expansion), implying that a k must be zero for k 9.

6 EEE 33 HW Solutions 3..a.a Consider the derivative of the given function: dx ( t) = δ ( t n ) dt n= The train of deltas is periodic with period. Its Fourier Series expansion can be found either directly (integrals of delta-times-a-function) or by using the tables and applying the shift property. We have, jkw jkwt e ak = FS δ ( t n ) = δ ( t ) e dt = n where w = π/ = π. The FS coefficients of the function are if k = and otherwise. Thus, the coefficients of the derivative are jkπ e if k = b = FS{ dx k t } dt ( ) = jkπ e otherwise Next, the FS coefficients of x(t), say c k, are related to b k by b k = jkw c k. This can be solved for c k except for k =. This can be found by applying the FS definition directly to x(t). Thus, we find if k = ck = FS{ x( t) } = jkπ e /( jkπ ) otherwise Notice that the direct computation of c here is essential. Both x(t) and x(t)+const. have the same derivative and their FS cannot be distinguished after differentiation. REMARK: Applying Parseval s theorem on x(t) we find: ck = = = = t dt k k π k = k π 3 This yields the well-known expression π = k 6 k = 3..a.b Using the same technique as in a.a, let x be the square wave t <.5 x ( t) =, x ( t + 6) = x ( t) otherwise whose Fourier Series coefficients are given in Table 4.. Differentiating the given signal, we find dx ( t) = x ( t +.5) x ( t.5) dt Hence, applying the linearity and time-shift properties of the Fourier Series, we get sin( kπ / 6) π / π / sin( kπ / 6) FS{ ( )} ( ) dx jk jk dt t = e e j sin( kπ / ) kπ = kπ Next, using the differentiation property, we find dx sin( kπ / 6) ak = FS{ x( t)} = FS{ ( )} dt t /( jkw ) = 6 sin( kπ / ), k ( kπ ) while for k =, the FS coefficient is found by direct integration as a = (+/+/)/6 = ½.

7 EEE 33 HW # 9 SOLUTIONS Problem 3.6b x [n] is composed of two periodic functions, so we can apply superposition: y s [n] = H(e j ) + jh(e j3¼=8 )j sin(n3¼=8+¼=4+argfh(e j3¼=8 )g) But H(e j )=andh(e j3¼=8 )=,so y s [n] = sin(n3¼=8+¼=4) Alternatively, one could write the Fourier series expansion for x and use the ltering property. Problem 3.3 The set of equations for a k is fá nk g n;k fa k g k = fx[n]g n where f:g k denotes the vector or matrix indexed by k and Á = e j¼=4. Expanding the matrices, we get Á Á Á Á a x() 6 Á Á Á Á a 7 4 Á Á Á 4 Á a 5 = 6 x() 7 4 x() 5 = Á Á 3 Á 6 {z Á 9 } a 3 x(3) The matrix has a very special structure. Its columns are of the form [; ½ i ;½ i ;½3 i ]>. Such matrices are called Vandermonde matrices and they are nonsingular if the ½ i 's are distinct. In our case ½ = Á =,½ = Á = j, ½ 3 = Á =, ½ 4 = Á 3 = j, which are indeed distinct. In general, Vandermonde matrices are numerically ill-conditioned except when the ½ i 's are the n-th roots of unity, which is our case. When this happens, the columns of the matrix are orthogonal to each other and the matrix is easy to invert. (Observe that P k (Ákn ) Á kn = P k Ák(n n ) which is if n 6= n. This property is precisely the reason why we can write a simple expression for the Fourier series coe±cients a k.) Regardless of any simpli cations, we can use Matlab (or any other numerical package) to solve the above system of equations. Substituting the numerical values we have 6 4 j j j j a a a a = and Matlab produces the solution a ==, a =( j)=4, a =,a 3 =( +j)=4. Needless to say, we arrive at the same result with the Fourier Series equation

8 EEE 33 HW # 5 SOLUTIONS Problem 4.34 a. From the de nition of the transfer function as the Fourier transform of the impulse response, we have Y (jw) X(jw) = (jw)+4 (jw) +5(jw)+6 ) [(jw) +5(jw)+6]Y (jw)=[(jw)+4]x(jw) Taking the inverse Fourier transform of both sides, we recover the di erential equation that describes the input-output relationship for the system d dt y(t)+5d dt y(t)+6y(t) = d dt x(t)+4x(t) b. We have that h(t) =F fh(jw)g; using a partial fraction expansion, the roots of the denominator are ; 3 and H(jw)= A jw + + B jw +3 where A =[(jw +)H(jw)]j jw= =andb =[(jw +3)H(jw)]j jw= 3 =. From the tables, ½ ¾ ½ ¾ F fh(jw)g = F + F =e t U(t) e 3t U(t) jw + jw +3 c. The response of the system to the input x(t) =e 4t U(t) te 4t U(t) can be found by either a direct evaluation of the convolution of the impulse response with the input or by Fourier transform methods. Using the latter approach, we nd the Fourier transform of x(t) as Then, Y (jw) =H(jw)X(jw) so, Y (jw) = = = = X(jw)= jw +4 (jw +4) µ jw +4 (jw +)(jw +3) jw +4 (jw +4) (jw +)(jw +3) (jw +)(jw +3)(jw +4) (jw +) + (jw +3) = (jw +) (jw +3) = (jw +4) = (jw +) = (jw +4) It is now straightforward to evaluate the time response: y(t) =F fy (jw)g = e t U(t) e 4t U(t) Notice the cancellation of the pole at 3 by the zero of X(jw) =(jw + 3)=(jw + 4). Also, the transfer function zero at 4 cancelled one of the poles of X(jw) and we did not need to evaluate the partial fraction expansion for multiple poles. Problem 4.35 a. For the transfer function H(jw)= a jw a + jw we have that jh(jw)j = p a +( w) = p a + w =. Such transfer functions are called \all-pass." Further, 6H(jw)=tan ( w=a) tan (w=a) = tan (w=a).

9 b. The impulse response of the system is the inverse Fourier transform of its transfer function: ½ ¾ ½ ¾ a + a a jw a h(t) =F fh(jw)g = F = F a + jw a + jw =ae at U(t) ±(t) c. The response of the system to the input x(t) =cos(t= p 3) + cos(t)+cos( p 3t) can be evaluated through Fourier transforms. X(jw) will contain 6 impulses and so will the product X(jw)H(jw). Then the inverse transform will contain 6 complex exponentials, but the simpli cation of that formula is quite tedious. Alternatively, using the sinusoid response formula and for a =, y(t) = cos(t= p 3 tan (= p 3)) + cos(t tan ()) + cos( p 3t tan ( p 3)) = cos(t= p 3 ¼=3) + cos(t ¼=) + cos( p 3t ¼=3) The following gure shows the response of the all-pass lter to the three cosines. For comparison, the response of the lter to the input is x(t)u(t) is also included. In the latter case, notice that the appearance of the ±(t) in the impulse response causes the initial output to be y(+) = x(+) = 3. 3 output response to 3 cosines 3 Transient vs. steady state response detail Figure : Left: Output response to the three cosines. Right: Detail showing the di erence between the steadystate response and the transient response. (Steady-state response: solid line.) TheresponseofH(jw) tocos(w t)isjh(jw )j cos(w t + 6 H(jw )).

10 EEE 33 HW # 9 SOLUTIONS Problem 5. Let A = P n and de ne the sequence x[n] = n u[n]. Then X(e jw )= n e jw =. The transform of the sequence nx[n] isj dx(ejw ) dw = e jw = ( e jw =). Then, A = Ffnx[n]gj e j = = ( =) = Problem 5.9 By inspection, the transfer function is H(z) = 6 z 6 z where z = e jw. The poles (roots of denominator) are z = = and =3. Taking the Partial Fraction Expansion we have Using the tables to nd the inverse Fourier, we get h[n] = 3 µ 5 3 H(z) = ( z )( + 3 z ) = z n u[n]+ 5 µ 3 n u[n] + 3 z Note: The impulse response can also be computed directly from the recursion. First, since the system is linear, its response to the zero input sequence is zero. Furthermore since it is causal, then its response to ±[n] must be identical to the zero-input response up to the index n =. So,y[n] =,forn<. Then, y[] = ++x[] = y[] = =6 + = =6 y[] = (=6)(=6) + =6 + = 7=36. which is the same as the previous analytical computations.

11 EEE 33 HW # 6 SOLUTIONS Problem 6.9 The lterisstablesothesteady-stateresponseiswell-de ned. Thesteady-statepartofthestepisthe constant function. The lter transfer function is H(jw) = jw+5 which at w = is /5. Therefore, the steady-state part of the step response is the constant function (/5)() = /5, which is also the nal value of y s (t); t!. The step response is Y s (s) = s+5 s. Taking the inverse Laplace via partial fraction expansion we nd: ½ ¾ ½ y s (t) =L =5 = L s +5s s + =5 ¾ = s +5 5 u(t) 5 e 5t u(t) = 5 ( e 5t )u(t) The same result is obtained by using the Fourier transform, but notice the di erence in the transform of the step function: µ Y s (jw) = jw +5 jw + ¼±(w) = 5 ¼±(w)+ jw +5jw ½ ¾ ½ y s (t) = F fy s (jw)g = F 5 ¼±(w)+ = F jw +5jw 5 ¼±(w)+=5 jw + =5 ¾ jw +5 ½ µ = F 5 jw + ¼±(w) + =5 ¾ = jw +5 5 u(t) 5 e 5t u(t) As t!, this expression yields y s () = =5, as found in the rst part. Then, the time t at which y s (t )=y s ()( e )ist ==5. Problem 6. The transfer function of the cascade connection is H(jw) =H (jw)h (jw). Hence, H (jw) = H(jw) H (jw). Taking the magnitude and log of both sides, log jh (jw)j =log jh(jw)j log jh (jw)j )jh (jw)j db = jh(jw)j db jh (jw)j db Thus the straight-line approximation of jh (jw)j db is described as follows: for w<: constant with magnitude (-)-(6) = -6 db; for < w < 8: straight line with slope ()-() = - db/dec; for 8 <w<4: straight line with slope (-4)-() = -4 db/dec; for 4 <w: straight line with slope (-4)-(-) = - db/dec;

12 EEE 33 HW # 6 SOLUTIONS Problem 6.7 (a.) Using the di erentiation property of the Fourier transform (or Laplace) the transfer function of the system is: H(jw)= jw + or, H(s) ==(s + ). The Laplace version is more advantageous since in the subsequent derivations it is convenient to keep jw as one argument. With s = jw, the frequency response of this transfer function has the following magnitude and phase: jh(jw)j = p w + 6H(jw) = tan (w=) These are easy to plot; in MATLAB, the relevant command is bode([],[ ]); (see also help bode). (b.) For the group delay, di erentiate tan (w=) with respect to w. (c. & d.) When x(t) =e t U(t), Ffxg ==(s + ), with s = jw. Using the convolution property, Y (jw)= (s +)(s +) s=jw For its partial fraction expansion (PFE), we need to nd A; B such that Y (s) = A (s +) + B (s +) The values of A; B can be computed using the formulas in the Appendix, or simply by converting the partial fractions into one fraction and equating the coe±cients of equal powers of s in the numerator. (This is e ective when only a few terms are involved.) A = ; B = (s +) s= (s +) Now, the time response can be computed easily by using the tables: (e-i.) Here X(jw)= +jw +jw,so Converting the PFE back to one fraction we have that y(t) =()e t U(t)+( )e t U(t) s= Y (s) = s + (s +) = A (s +) + A (s +) A s +A + A = s +) A =; A = Hence, y(t) =()e t U(t)+( )te t U(t). Alternatively, since the fraction involves only one pole, we have that y(t) =y (t)+ d dt y (t), where y (t) = F =(jw +) ª = te t U(t). (Verify this!) s+ (e-ii.) Here Y (s) = (s+)(s+) = (s+) and, clearly, y(t) =e t U(t). (e-iii.) Here Y (s) = (s +) (s +) = A (s +) + B (s +) + B (s +) Using the PFE formulas, we nd A =,B =, B =. Hence, y(t) =()e t U(t)+( )e t U(t)+( )te t U(t).

13 EEE 33 HW # 6 SOLUTIONS Problem 7.4 The Nyquist rate of x(t) isw,sox(t) is bandlimited in ( w =; w =). In other words, the maximum frequency where x(t) has energy is w M = w =.. Ffx(t )g = e jw Ffx(t)g is also bandlimited in ( w M ;w M ). Hence, Ffx(t ) + x(t)g is bandlimited in ( w M ;w M ), and the Nyquist rate of x(t ) + x(t) isw m = w.. F dx dt ª = jwffx(t)g which is again bandlimited in ( wm ;w M ) and, hence, the Nyquist rate of dx=dt is w. Notice that this result hinges on the assumption that X(jw) is zero for jwj >w M. This can be deceptive in a practical situation where the Nyquist rate is de ned in terms of the signal \bandwidth," i.e., the frequency beyond which the energy content of the signal is small. In such a case, di erentiation of the signal will increase the magnitude (and energy) of the signal at high frequencies and will change the e ective Nyquist rate. 3. Let y(t) =x (t). Then Ffyg = ¼ Ffxg Ffxg. Since Ffxg is bandlimited in ( w M;w M ), we have that Ffyg is bandlimited in ( w M ; w M ); hence the Nyquist rate of y(t) isw. 4. Let y(t) =x(t)cos(w t). Then Ffyg = ¼ FfxgFfcos w tg = [X(j(w w )) + X(j(w + w ))]. Hence, Ffyg is bandlimited in ( w w M ;w + w M )=( 3w M ; 3w M )andthenyquistrateofy(t) is6w M =3w. Problem 7. Let x (t) be bandlimited in ( ¼; ¼) andx (t) be bandlimited in ( ¼; ¼). a. Let y(t) =(x x )(t). Then Ffyg = Ffx gffx g which is bandlimited in the intersection of the two frequency intervals, that is ( ¼; ¼). Hence the Nyquist rate of y(t) is¼ and the maximum sampling time to allow perfect reconstruction is T = ¼=(¼) = =. b. Let y(t) =¼x (t)x (t). Then Ffyg = Ffx g Ffx g which is bandlimited in the frequency interval ( ¼ ¼; ¼ +¼). Hence the Nyquist rate of y(t) is6¼ and the maximum sampling time to allow perfect reconstruction is T =¼=(6¼) ==3.

14 EEE 3 3 HW # 7 SOLUT I ONS Problem 8.4 Since v(t) = g(t)sin4¼t is passed through an ideal lowpass lter and this operation is best described in the frequency domain, we need to compute V (jw). This can be achieved by either trigonometric identities (for this speci c problem) or by performing the various frequency-domain convolutions. Let w =¼. Then, X(jw) = ¼ j ±(w w ) ¼ j ±(w + w )+ ¼ j ±(w w ) ¼ j ±(w +w ) G(jw) = ¼ ¼ X(jw) j ±(w w ) ¼ j ±(w +w ) = j X(j(w w )) j X(j(w +w )) V (jw) = ¼ ¼ G(jw) j ±(w w ) ¼ j ±(w +w ) = j G(j(w w )) j G(j(w +w )) = 4 X(j(w 4w )) 4 X(jw) 4 X(jw)+ 4 X(j(w +4w )) = 4 X(j(w 4w )) + X(jw) 4 X(j(w +4w )) = ¼ 4 j ±(w 5w ) ¼ j ±(w 3w )+ ¼ j ±(w 6w ) ¼ j ±(w w ) + ¼ j ±(w w ) ¼ j ±(w + w )+ ¼ j ±(w w ) ¼ j ±(w +w ) ¼ 4 j ±(w +3w ) ¼ j ±(w +5w )+ ¼ j ±(w +w ) ¼ j ±(w +6w ) = ¼ j ±(w 6w ) ¼ 4j ±(w 5w )+ ¼ 4j ±(w 3w )+ 3¼ j ±(w w )+ ¼ j ±(w w ) ¼ j ±(w + w ) 3¼ j ±(w +w ) ¼ 4j ±(w +3w )+ ¼ 4j ±(w +5w )+ ¼ j ±(w +6w ) Filtering v(t) with a lowpass lter with cuto frequency w and passband gain of we get an output, say y(t), that has frequency content in jwj w. This operation is ambiguous in that there is an impulse exactly at the cuto frequency. Formally, the ideal lowpass lter will only allow half of that impulse to go through. Y (jw)=h(jw)v (jw)=+ 3¼ j ±(w w )+ ¼ j ±(w w ) ¼ j ±(w + w ) 3¼ j ±(w +w ) Hence, converting back to time domain y(t) =F fy (jw)g =sin¼t + 3 sin 4¼t Problem 8.34 Let us rst de ne the intermediate signals v(t) =x(t)+cosw c t, z(t) =v (t). Then V (jw) = X(jw)+¼±(w w c )+¼±(w + w c ) Z(jw) = V (jw) V (jw) ¼

15 = X(j(w w c)) + ¼ ±(w w c)+ ¼ ±(w) + X(j(w + w c)) + ¼ ±(w)+ ¼ ±(w +w c) + X(j(w w c)) + X(j(w + w c)) + X(jw) X(jw) ¼ = X(j(w w c )) + X(j(w + w c )) + ¼ ±(w w c)+ ¼ ±(w +w c)+¼±(w)+ X(jw) X(jw) ¼ The exact expression of X(jw) X(jw) is irrelevant here; we only need the fact that, since X(jw) is bandlimited in ( w M ;w M ), then X(jw) X(jw) is bandlimited in ( w M ; w M ). The same result is obtained by squaring v(t) in time-domain and then taking its Fourier transform z(t) = x (t)+cos w c t +x(t)cosw c t = x (t)+ + cos w ct +x(t)cosw c t Z(jw) = ¼ X(jw) X(jw)+¼±(w)¼ ±(w w c)+ ¼ ±(w +w c)+x(j(w w c )) + X(j(w + w c )) For y(t) =x(t)cosw c t, we need to have that Y (jw) =H(jw)Z(jw)= [X(j(w w c)) + X(j(w + w c ))] Hence, H should be a bandpass lter with a gain A == and w M <w l <w c W M, w c + w M <w h < w c. The feasibility constraints for this solution are w M <w c W M,or w c > 3w M. (This also imples that w c + w M < w c.)

16

17

18

19

20 EEE 3 3 HW # 8 SOLUT I ONS Problem.54 a. Let S N = P N n= an. Then, as N = P N n= an.therefore,( a)s N = a a N,fromwhichweget S N = N X n= a n = an a provided that a 6=. Ifa =, then simply S N = P N n= n = N. b. Let S = P n= an = lim N! S N, provided that the limit exists. For this, the limit of a N should exist as N!which occurs if jaj <. In the complex case, a N =(jaje jµ ) N = jaj N e jµn. So, if jaj <, lim N! a N =, implying X S = a n = a c. Observe that for jaj <, a ds da = a X da n da = X n= n= n= na n = a d µ = da a ( a) Notice that the exchange of summation and di erentiation makes sense since the series are absolutely convergent. d. Again for jaj <, X X k X a n = a n a n = a ak a = ak a n=k n= Problem. a. Let x(n) =a n U(n), h(n) =b n U(n). Then n= y(n) = (h x)(n) = = nx b n k a k k= X k= b n k U(n k)a k U(k) X n ³ a = b n k ; (assuming b 6= a) b k= = b n (a=b)n+ (a=b) = an+ b n+ a b Obviously, if a = b, theny(n) =(n +)b n. b. Let x(n) =U(n) U(n 5), h(n) =h (n ) + h (n ), where h (n) =U(n) U(n 6). Then, x(n) h(n) =y (n ) + y (n ), where y (n) =x(n) h (n). The last sequence is easy to compute: n y (n) From this, we get n y (n ) y (n ) x(n) h(n) Problem.3

21 Consider the di erence equation y(n)+y(n ) = x(n)+x(n ) with x(n) =f:::; ; ; 3; ; ; ; ;:::g for n = f:::; 3; ; ; ; ; ; 3; 4;:::g, respectively. Assuming that y(n) is\atrest"at, the above recursion (y(n) = y(n ) + x(n)+x(n )) yields:. (y(n) = ; for n< 3) y( 3) = y( 4) + x( 3) + x( 5) = y( ) = y( 3) + x( ) + x( 4) = y( ) = y( ) + x( ) + x( 3) = y() = y( ) + x() + x( ) = 5 y() = y() + x() + x( ) = 4 y() = y() + x() + x() = 6 y(3) = y() + x(3) + x() = 7 y(4) = y(3) + x(4) + x() = 58 y(5) = y(4) + x(5) + x(3) = 4 y(6) = y(5) + x(6) + x(4) = 4 y(7) = y(6) + x(7) + x(5) = 4 4 y(8) = y(7) + x(8) + x(6) = 8 4. (y(n) = 4( ) n 5 ; for n 5) Problem.55 a (extra) y[] = x[] =. h[n] satis es the equation h[n] = h[n ]; n with axuliary condition h[] =. The characteristic polynomial is given by: z = then the solution for the homogeneous di erence equation is h[n] = C µ n U[n] h[] = so C =then h[n] = µ n U[n]

22

GATE EE Topic wise Questions SIGNALS & SYSTEMS

GATE EE Topic wise Questions SIGNALS & SYSTEMS www.gatehelp.com GATE EE Topic wise Questions YEAR 010 ONE MARK Question. 1 For the system /( s + 1), the approximate time taken for a step response to reach 98% of the final value is (A) 1 s (B) s (C)

More information

Digital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung

Digital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung Digital Signal Processing, Homework, Spring 203, Prof. C.D. Chung. (0.5%) Page 99, Problem 2.2 (a) The impulse response h [n] of an LTI system is known to be zero, except in the interval N 0 n N. The input

More 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

Question Paper Code : AEC11T02

Question Paper Code : AEC11T02 Hall Ticket No Question Paper Code : AEC11T02 VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad Four Year B. Tech III Semester Tutorial Question Bank 2013-14 (Regulations: VCE-R11)

More information

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

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) 1. For the signal shown in Fig. 1, find x(2t + 3). i. Fig. 1 2. What is the classification of the systems? 3. What are the Dirichlet s conditions of Fourier

More information

ECE 301: Signals and Systems Homework Assignment #5

ECE 301: Signals and Systems Homework Assignment #5 ECE 30: Signals and Systems Homework Assignment #5 Due on November, 205 Professor: Aly El Gamal TA: Xianglun Mao Aly El Gamal ECE 30: Signals and Systems Homework Assignment #5 Problem Problem Compute

More information

Review of Linear Time-Invariant Network Analysis

Review of Linear Time-Invariant Network Analysis D1 APPENDIX D Review of Linear Time-Invariant Network Analysis Consider a network with input x(t) and output y(t) as shown in Figure D-1. If an input x 1 (t) produces an output y 1 (t), and an input x

More information

Fourier Transform for Continuous Functions

Fourier Transform for Continuous Functions Fourier Transform for Continuous Functions Central goal: representing a signal by a set of orthogonal bases that are corresponding to frequencies or spectrum. Fourier series allows to find the spectrum

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

Chapter 6: Applications of Fourier Representation Houshou Chen

Chapter 6: Applications of Fourier Representation Houshou Chen Chapter 6: Applications of Fourier Representation Houshou Chen Dept. of Electrical Engineering, National Chung Hsing University E-mail: houshou@ee.nchu.edu.tw H.S. Chen Chapter6: Applications of Fourier

More information

EE 224 Signals and Systems I Review 1/10

EE 224 Signals and Systems I Review 1/10 EE 224 Signals and Systems I Review 1/10 Class Contents Signals and Systems Continuous-Time and Discrete-Time Time-Domain and Frequency Domain (all these dimensions are tightly coupled) SIGNALS SYSTEMS

More information

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

3.2 Complex Sinusoids and Frequency Response of LTI Systems

3.2 Complex Sinusoids and Frequency Response of LTI Systems 3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex

More information

Review of Fundamentals of Digital Signal Processing

Review of Fundamentals of Digital Signal Processing Chapter 2 Review of Fundamentals of Digital Signal Processing 2.1 (a) This system is not linear (the constant term makes it non linear) but is shift-invariant (b) This system is linear but not shift-invariant

More information

Line Spectra and their Applications

Line Spectra and their Applications In [ ]: cd matlab pwd Line Spectra and their Applications Scope and Background Reading This session concludes our introduction to Fourier Series. Last time (http://nbviewer.jupyter.org/github/cpjobling/eg-47-

More information

ECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are

ECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are ECE-7 Review Phil Schniter January 5, 7 ransforms Using x c (t) to denote a continuous-time signal at time t R, Laplace ransform: X c (s) x c (t)e st dt, s C Continuous-ime Fourier ransform (CF): ote that:

More information

Representing a Signal

Representing a Signal The Fourier Series Representing a Signal The convolution method for finding the response of a system to an excitation takes advantage of the linearity and timeinvariance of the system and represents the

More information

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2) E.5 Signals & Linear Systems Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & ) 1. Sketch each of the following continuous-time signals, specify if the signal is periodic/non-periodic,

More information

Control Systems I. Lecture 6: Poles and Zeros. Readings: Emilio Frazzoli. Institute for Dynamic Systems and Control D-MAVT ETH Zürich

Control Systems I. Lecture 6: Poles and Zeros. Readings: Emilio Frazzoli. Institute for Dynamic Systems and Control D-MAVT ETH Zürich Control Systems I Lecture 6: Poles and Zeros Readings: Emilio Frazzoli Institute for Dynamic Systems and Control D-MAVT ETH Zürich October 27, 2017 E. Frazzoli (ETH) Lecture 6: Control Systems I 27/10/2017

More information

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches Difference Equations (an LTI system) x[n]: input, y[n]: output That is, building a system that maes use of the current and previous

More information

Continuous-Time Fourier Transform

Continuous-Time Fourier Transform Signals and Systems Continuous-Time Fourier Transform Chang-Su Kim continuous time discrete time periodic (series) CTFS DTFS aperiodic (transform) CTFT DTFT Lowpass Filtering Blurring or Smoothing Original

More information

Chapter 6: The Laplace Transform. Chih-Wei Liu

Chapter 6: The Laplace Transform. Chih-Wei Liu Chapter 6: The Laplace Transform Chih-Wei Liu Outline Introduction The Laplace Transform The Unilateral Laplace Transform Properties of the Unilateral Laplace Transform Inversion of the Unilateral Laplace

More information

06/12/ rws/jMc- modif SuFY10 (MPF) - Textbook Section IX 1

06/12/ rws/jMc- modif SuFY10 (MPF) - Textbook Section IX 1 IV. Continuous-Time Signals & LTI Systems [p. 3] Analog signal definition [p. 4] Periodic signal [p. 5] One-sided signal [p. 6] Finite length signal [p. 7] Impulse function [p. 9] Sampling property [p.11]

More information

EC Signals and Systems

EC Signals and Systems UNIT I CLASSIFICATION OF SIGNALS AND SYSTEMS Continuous time signals (CT signals), discrete time signals (DT signals) Step, Ramp, Pulse, Impulse, Exponential 1. Define Unit Impulse Signal [M/J 1], [M/J

More information

Fourier Series and Fourier Transforms

Fourier Series and Fourier Transforms Fourier Series and Fourier Transforms Houshou Chen Dept. of Electrical Engineering, National Chung Hsing University E-mail: houshou@ee.nchu.edu.tw H.S. Chen Fourier Series and Fourier Transforms 1 Why

More information

Chapter 3 Convolution Representation

Chapter 3 Convolution Representation Chapter 3 Convolution Representation DT Unit-Impulse Response Consider the DT SISO system: xn [ ] System yn [ ] xn [ ] = δ[ n] If the input signal is and the system has no energy at n = 0, the output yn

More information

The Laplace Transform

The Laplace Transform The Laplace Transform Generalizing the Fourier Transform The CTFT expresses a time-domain signal as a linear combination of complex sinusoids of the form e jωt. In the generalization of the CTFT to the

More information

X (z) = n= 1. Ã! X (z) x [n] X (z) = Z fx [n]g x [n] = Z 1 fx (z)g. r n x [n] ª e jnω

X (z) = n= 1. Ã! X (z) x [n] X (z) = Z fx [n]g x [n] = Z 1 fx (z)g. r n x [n] ª e jnω 3 The z-transform ² Two advantages with the z-transform:. The z-transform is a generalization of the Fourier transform for discrete-time signals; which encompasses a broader class of sequences. The z-transform

More information

3 Fourier Series Representation of Periodic Signals

3 Fourier Series Representation of Periodic Signals 65 66 3 Fourier Series Representation of Periodic Signals Fourier (or frequency domain) analysis constitutes a tool of great usefulness Accomplishes decomposition of broad classes of signals using complex

More information

New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam

New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Name: Solve problems 1 3 and two from problems 4 7. Circle below which two of problems 4 7 you

More information

Module 4. Related web links and videos. 1. FT and ZT

Module 4. Related web links and videos. 1.  FT and ZT Module 4 Laplace transforms, ROC, rational systems, Z transform, properties of LT and ZT, rational functions, system properties from ROC, inverse transforms Related web links and videos Sl no Web link

More information

EE Experiment 11 The Laplace Transform and Control System Characteristics

EE Experiment 11 The Laplace Transform and Control System Characteristics EE216:11 1 EE 216 - Experiment 11 The Laplace Transform and Control System Characteristics Objectives: To illustrate computer usage in determining inverse Laplace transforms. Also to determine useful signal

More information

Chapter 4 The Fourier Series and Fourier Transform

Chapter 4 The Fourier Series and Fourier Transform Chapter 4 The Fourier Series and Fourier Transform Representation of Signals in Terms of Frequency Components Consider the CT signal defined by N xt () = Acos( ω t+ θ ), t k = 1 k k k The frequencies `present

More information

EECS20n, Solution to Mock Midterm 2, 11/17/00

EECS20n, Solution to Mock Midterm 2, 11/17/00 EECS20n, Solution to Mock Midterm 2, /7/00. 5 points Write the following in Cartesian coordinates (i.e. in the form x + jy) (a) point j 3 j 2 + j =0 (b) 2 points k=0 e jkπ/6 = ej2π/6 =0 e jπ/6 (c) 2 points(

More information

Z-Transform. x (n) Sampler

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

LECTURE 12 Sections Introduction to the Fourier series of periodic signals

LECTURE 12 Sections Introduction to the Fourier series of periodic signals Signals and Systems I Wednesday, February 11, 29 LECURE 12 Sections 3.1-3.3 Introduction to the Fourier series of periodic signals Chapter 3: Fourier Series of periodic signals 3. Introduction 3.1 Historical

More information

Review of Fundamentals of Digital Signal Processing

Review of Fundamentals of Digital Signal Processing Solution Manual for Theory and Applications of Digital Speech Processing by Lawrence Rabiner and Ronald Schafer Click here to Purchase full Solution Manual at http://solutionmanuals.info Link download

More 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

7.17. Determine the z-transform and ROC for the following time signals: Sketch the ROC, poles, and zeros in the z-plane. X(z) = x[n]z n.

7.17. Determine the z-transform and ROC for the following time signals: Sketch the ROC, poles, and zeros in the z-plane. X(z) = x[n]z n. Solutions to Additional Problems 7.7. Determine the -transform and ROC for the following time signals: Sketch the ROC, poles, and eros in the -plane. (a) x[n] δ[n k], k > 0 X() x[n] n n k, 0 Im k multiple

More information

Laplace Transforms and use in Automatic Control

Laplace Transforms and use in Automatic Control Laplace Transforms and use in Automatic Control P.S. Gandhi Mechanical Engineering IIT Bombay Acknowledgements: P.Santosh Krishna, SYSCON Recap Fourier series Fourier transform: aperiodic Convolution integral

More information

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals SIGNALS AND SYSTEMS Unit IV Analysis of DT signals Contents: 4.1 Discrete Time Fourier Transform 4.2 Discrete Fourier Transform 4.3 Z Transform 4.4 Properties of Z Transform 4.5 Relationship between Z

More information

Digital Signal Processing. Midterm 1 Solution

Digital Signal Processing. Midterm 1 Solution EE 123 University of California, Berkeley Anant Sahai February 15, 27 Digital Signal Processing Instructions Midterm 1 Solution Total time allowed for the exam is 8 minutes Some useful formulas: Discrete

More information

DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010

DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010 [E2.5] IMPERIAL COLLEGE LONDON DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010 EEE/ISE PART II MEng. BEng and ACGI SIGNALS AND LINEAR SYSTEMS Time allowed: 2:00 hours There are FOUR

More information

Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt

Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt Homework 4 May 2017 1. An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt Determine the impulse response of the system. Rewriting as y(t) = t e (t

More information

Core Concepts Review. Orthogonality of Complex Sinusoids Consider two (possibly non-harmonic) complex sinusoids

Core Concepts Review. Orthogonality of Complex Sinusoids Consider two (possibly non-harmonic) complex sinusoids Overview of Continuous-Time Fourier Transform Topics Definition Compare & contrast with Laplace transform Conditions for existence Relationship to LTI systems Examples Ideal lowpass filters Relationship

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

EEE 303 Notes: System properties

EEE 303 Notes: System properties EEE 303 Notes: System properties Kostas Tsakalis January 27, 2000 1 Introduction The purpose of this note is to provide a brief background and some examples on the fundamental system properties. In particular,

More information

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals 1. Sampling and Reconstruction 2. Quantization 1 1. Sampling & Reconstruction DSP must interact with an analog world: A to D D to A x(t)

More information

Chapter 4 The Fourier Series and Fourier Transform

Chapter 4 The Fourier Series and Fourier Transform Chapter 4 The Fourier Series and Fourier Transform Fourier Series Representation of Periodic Signals Let x(t) be a CT periodic signal with period T, i.e., xt ( + T) = xt ( ), t R Example: the rectangular

More information

Chapter 8 The Discrete Fourier Transform

Chapter 8 The Discrete Fourier Transform Chapter 8 The Discrete Fourier Transform Introduction Representation of periodic sequences: the discrete Fourier series Properties of the DFS The Fourier transform of periodic signals Sampling the Fourier

More information

NAME: 11 December 2013 Digital Signal Processing I Final Exam Fall Cover Sheet

NAME: 11 December 2013 Digital Signal Processing I Final Exam Fall Cover Sheet NAME: December Digital Signal Processing I Final Exam Fall Cover Sheet Test Duration: minutes. Open Book but Closed Notes. Three 8.5 x crib sheets allowed Calculators NOT allowed. This test contains four

More information

Laplace Transform Part 1: Introduction (I&N Chap 13)

Laplace Transform Part 1: Introduction (I&N Chap 13) Laplace Transform Part 1: Introduction (I&N Chap 13) Definition of the L.T. L.T. of Singularity Functions L.T. Pairs Properties of the L.T. Inverse L.T. Convolution IVT(initial value theorem) & FVT (final

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

Discrete-time Signals and Systems in

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

More information

Module 4 : Laplace and Z Transform Problem Set 4

Module 4 : Laplace and Z Transform Problem Set 4 Module 4 : Laplace and Z Transform Problem Set 4 Problem 1 The input x(t) and output y(t) of a causal LTI system are related to the block diagram representation shown in the figure. (a) Determine a differential

More information

Digital Filters Ying Sun

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

More information

Topic 3: Fourier Series (FS)

Topic 3: Fourier Series (FS) ELEC264: Signals And Systems Topic 3: Fourier Series (FS) o o o o Introduction to frequency analysis of signals CT FS Fourier series of CT periodic signals Signal Symmetry and CT Fourier Series Properties

More information

EE/ME/AE324: Dynamical Systems. Chapter 7: Transform Solutions of Linear Models

EE/ME/AE324: Dynamical Systems. Chapter 7: Transform Solutions of Linear Models EE/ME/AE324: Dynamical Systems Chapter 7: Transform Solutions of Linear Models The Laplace Transform Converts systems or signals from the real time domain, e.g., functions of the real variable t, to the

More information

信號與系統 Signals and Systems

信號與系統 Signals and Systems Spring 2015 信號與系統 Signals and Systems Chapter SS-2 Linear Time-Invariant Systems Feng-Li Lian NTU-EE Feb15 Jun15 Figures and images used in these lecture notes are adopted from Signals & Systems by Alan

More information

ECEN 420 LINEAR CONTROL SYSTEMS. Lecture 2 Laplace Transform I 1/52

ECEN 420 LINEAR CONTROL SYSTEMS. Lecture 2 Laplace Transform I 1/52 1/52 ECEN 420 LINEAR CONTROL SYSTEMS Lecture 2 Laplace Transform I Linear Time Invariant Systems A general LTI system may be described by the linear constant coefficient differential equation: a n d n

More information

4 The Continuous Time Fourier Transform

4 The Continuous Time Fourier Transform 96 4 The Continuous Time ourier Transform ourier (or frequency domain) analysis turns out to be a tool of even greater usefulness Extension of ourier series representation to aperiodic signals oundation

More information

DESIGN OF CMOS ANALOG INTEGRATED CIRCUITS

DESIGN OF CMOS ANALOG INTEGRATED CIRCUITS DESIGN OF CMOS ANALOG INEGRAED CIRCUIS Franco Maloberti Integrated Microsistems Laboratory University of Pavia Discrete ime Signal Processing F. Maloberti: Design of CMOS Analog Integrated Circuits Discrete

More information

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

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

More information

Laplace Transforms Chapter 3

Laplace Transforms Chapter 3 Laplace Transforms Important analytical method for solving linear ordinary differential equations. - Application to nonlinear ODEs? Must linearize first. Laplace transforms play a key role in important

More information

Solutions to Problems in Chapter 4

Solutions to Problems in Chapter 4 Solutions to Problems in Chapter 4 Problems with Solutions Problem 4. Fourier Series of the Output Voltage of an Ideal Full-Wave Diode Bridge Rectifier he nonlinear circuit in Figure 4. is a full-wave

More information

The Johns Hopkins University Department of Electrical and Computer Engineering Introduction to Linear Systems Fall 2002.

The Johns Hopkins University Department of Electrical and Computer Engineering Introduction to Linear Systems Fall 2002. The Johns Hopkins University Department of Electrical and Computer Engineering 505.460 Introduction to Linear Systems Fall 2002 Final exam Name: You are allowed to use: 1. Table 3.1 (page 206) & Table

More information

Interconnection of LTI Systems

Interconnection of LTI Systems EENG226 Signals and Systems Chapter 2 Time-Domain Representations of Linear Time-Invariant Systems Interconnection of LTI Systems Prof. Dr. Hasan AMCA Electrical and Electronic Engineering Department (ee.emu.edu.tr)

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

EC6303 SIGNALS AND SYSTEMS

EC6303 SIGNALS AND SYSTEMS EC 6303-SIGNALS & SYSTEMS UNIT I CLASSIFICATION OF SIGNALS AND SYSTEMS 1. Define Signal. Signal is a physical quantity that varies with respect to time, space or a n y other independent variable.(or) It

More information

1 Signals and systems

1 Signals and systems 978--52-5688-4 - Introduction to Orthogonal Transforms: With Applications in Data Processing and Analysis Signals and systems In the first two chapters we will consider some basic concepts and ideas as

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

SIGNALS AND SYSTEMS LABORATORY 14: The Rudiments of Antenna Design

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

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

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

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform Signals and Systems Problem Set: The z-transform and DT Fourier Transform Updated: October 9, 7 Problem Set Problem - Transfer functions in MATLAB A discrete-time, causal LTI system is described by the

More information

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

Chapter 2 Time-Domain Representations of LTI Systems

Chapter 2 Time-Domain Representations of LTI Systems Chapter 2 Time-Domain Representations of LTI Systems 1 Introduction Impulse responses of LTI systems Linear constant-coefficients differential or difference equations of LTI systems Block diagram representations

More information

信號與系統 Signals and Systems

信號與系統 Signals and Systems Spring 2010 信號與系統 Signals and Systems Chapter SS-2 Linear Time-Invariant Systems Feng-Li Lian NTU-EE Feb10 Jun10 Figures and images used in these lecture notes are adopted from Signals & Systems by Alan

More information

The Discrete-Time Fourier

The Discrete-Time Fourier Chapter 3 The Discrete-Time Fourier Transform 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 3-1-1 Continuous-Time Fourier Transform Definition The CTFT of

More information

Linear Convolution Using FFT

Linear Convolution Using FFT Linear Convolution Using FFT Another useful property is that we can perform circular convolution and see how many points remain the same as those of linear convolution. When P < L and an L-point circular

More information

SIGNAL PROCESSING. B14 Option 4 lectures. Stephen Roberts

SIGNAL PROCESSING. B14 Option 4 lectures. Stephen Roberts SIGNAL PROCESSING B14 Option 4 lectures Stephen Roberts Recommended texts Lynn. An introduction to the analysis and processing of signals. Macmillan. Oppenhein & Shafer. Digital signal processing. Prentice

More information

Theory and Problems of Signals and Systems

Theory and Problems of Signals and Systems SCHAUM'S OUTLINES OF Theory and Problems of Signals and Systems HWEI P. HSU is Professor of Electrical Engineering at Fairleigh Dickinson University. He received his B.S. from National Taiwan University

More information

The different frequency components in a sound signal are processed first by the sensory system in the ear then some specialized cortical areas in the

The different frequency components in a sound signal are processed first by the sensory system in the ear then some specialized cortical areas in the Signals Represented in Terms of Magnitude Phase The physical interpretation of the Fourier transform of a time signal is its decomposition into a linear combination of frequency components with different

More information

VU Signal and Image Processing

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

More information

EC1305-SIGNALS AND SYSTEMS UNIT-1 CLASSIFICATION OF SIGNALS AND SYSTEMS

EC1305-SIGNALS AND SYSTEMS UNIT-1 CLASSIFICATION OF SIGNALS AND SYSTEMS EC1305-SIGNALS AND SYSTEMS UNIT-1 CLASSIFICATION OF SIGNALS AND SYSTEMS 1. Define Signal? Signal is a physical quantity that varies with respect to time, space or any other independent variable. ( Or)

More information

NAME: 23 February 2017 EE301 Signals and Systems Exam 1 Cover Sheet

NAME: 23 February 2017 EE301 Signals and Systems Exam 1 Cover Sheet NAME: 23 February 2017 EE301 Signals and Systems Exam 1 Cover Sheet Test Duration: 75 minutes Coverage: Chaps 1,2 Open Book but Closed Notes One 85 in x 11 in crib sheet Calculators NOT allowed DO NOT

More information

Review of Frequency Domain Fourier Series: Continuous periodic frequency components

Review of Frequency Domain Fourier Series: Continuous periodic frequency components Today we will review: Review of Frequency Domain Fourier series why we use it trig form & exponential form how to get coefficients for each form Eigenfunctions what they are how they relate to LTI systems

More information

x(t) = t[u(t 1) u(t 2)] + 1[u(t 2) u(t 3)]

x(t) = t[u(t 1) u(t 2)] + 1[u(t 2) u(t 3)] ECE30 Summer II, 2006 Exam, Blue Version July 2, 2006 Name: Solution Score: 00/00 You must show all of your work for full credit. Calculators may NOT be used.. (5 points) x(t) = tu(t ) + ( t)u(t 2) u(t

More information

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM. COURSE: ECE 3084A (Prof. Michaels)

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM. COURSE: ECE 3084A (Prof. Michaels) GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM DATE: 30-Apr-14 COURSE: ECE 3084A (Prof. Michaels) NAME: STUDENT #: LAST, FIRST Write your name on the front page

More information

Properties of LTI Systems

Properties of LTI Systems Properties of LTI Systems Properties of Continuous Time LTI Systems Systems with or without memory: A system is memory less if its output at any time depends only on the value of the input at that same

More information

2A1H Time-Frequency Analysis II

2A1H Time-Frequency Analysis II 2AH Time-Frequency Analysis II Bugs/queries to david.murray@eng.ox.ac.uk HT 209 For any corrections see the course page DW Murray at www.robots.ox.ac.uk/ dwm/courses/2tf. (a) A signal g(t) with period

More information

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions 8-90 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 08 Midterm Solutions Name: Andrew ID: Problem Score Max 8 5 3 6 4 7 5 8 6 7 6 8 6 9 0 0 Total 00 Midterm Solutions. (8 points) Indicate whether

More information

Discussion Section #2, 31 Jan 2014

Discussion Section #2, 31 Jan 2014 Discussion Section #2, 31 Jan 2014 Lillian Ratliff 1 Unit Impulse The unit impulse (Dirac delta) has the following properties: { 0, t 0 δ(t) =, t = 0 ε ε δ(t) = 1 Remark 1. Important!: An ordinary function

More information

8 The Discrete Fourier Transform (DFT)

8 The Discrete Fourier Transform (DFT) 8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration

More information

Circuit Analysis Using Fourier and Laplace Transforms

Circuit Analysis Using Fourier and Laplace Transforms EE2015: Electrical Circuits and Networks Nagendra Krishnapura https://wwweeiitmacin/ nagendra/ Department of Electrical Engineering Indian Institute of Technology, Madras Chennai, 600036, India July-November

More information

Ch 2: Linear Time-Invariant System

Ch 2: Linear Time-Invariant System Ch 2: Linear Time-Invariant System A system is said to be Linear Time-Invariant (LTI) if it possesses the basic system properties of linearity and time-invariance. Consider a system with an output signal

More information

Fourier Series Representation of

Fourier Series Representation of Fourier Series Representation of Periodic Signals Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Outline The response of LIT system

More information

Design of IIR filters

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