Homework 8 Solutions
|
|
- Ernest McCoy
- 5 years ago
- Views:
Transcription
1 EE264 Dec 3, 2004 Fall HO#27 Problem Interpolation (5 points) Homework 8 Solutions 30 points total Ω = 2π/T f(t) = sin( Ω 0 t) T f (t) DAC ˆf(t) interpolated output In this problem I ll use the notation from the lecture notes for the Fourier Transform. Preliminaries: The power of a sinusoid A sin(ω o t) or A cos(ω o t) is A 2 /2. The Fourier Transform (using Widrow s notation) of f(t) = Asin(Ω o t) is F(jω) = j2π Aδ(ω ω 2 o)+j2π Aδ(ω +ω 2 o). The power associated to a delta dirac Aδ(ω ω o ) in the frequency domain is A 2. The power 2π of a sinusoid can also be found by adding the power associated with each of its delta diracs in its Fourier Transform (Please confirm that to convince yourself). The delta function has the sifting porperty: f(ω)δ(ω ω o ) = f(ω o )δ(ω ω o ) Let H(jω) be the transfer function of the DAC. then we have that ˆF(jω) = F (jω)h(jω) The DAC Interpolator is a zero order hold with interpolating period T. Therefore its Fourier Transform is H(jω) = Te jωt/2sin(ωt/2) (ωt/2) f s (t) consists of a train of deltas obtained by sampling f(t) with a sampling period T. Therefore its Fourier Transform is F (jω) = T F(jω r2π/t) = T F(jω rω) Now, in particular we have f(t) = sin( Ω t), therefore 0 F(jω) = j2π 2 δ(ω Ω 0 ) + j2π 2 δ(ω + Ω 0 )
2 F (jω) will consist of replicas (scaled by /T ) of this pair of deltas centered at frequencies rω with r integer. That is F (jω) = r2π/t) = T F(jω j2π T 2 δ(ω Ω 0 rω) + j2π 2 δ(ω + Ω 0 rω) Try to make a picture of this, it s very useful. So we have concluded that F (jω) consists of deltas located at frequencies rω ± Ω/0 with r integer. The next step is to find ˆF(jω). ˆF(jω) = H(jω)F (jω) = H(jω) jπδ(ω Ω T 0 rω) + jπδ(ω + Ω 0 rω) ˆF(jω) = T jπh(jω)δ(ω Ω 0 rω) + jπh(jω)δ(ω + Ω 0 rω) Using the sifting property of the delta dirac function we have ˆF(jω) = jπ T H(j( Ω 0 + rω))δ(ω Ω 0 rω) + jπ T H(j( Ω 0 + rω))δ(ω + Ω 0 rω) Therefore we obtained that also ˆF(jω) consists of deltas located at frequencies rω ± Ω/0 with r integer. The power associated to one of these deltas, located at a frequency rω ± Ω/0 will be H(j(rΩ ± Ω 2T 0 )) 2 = ( H(j(rΩ ± Ω 2T 0 )) )2 For the zero order hold case we have (recall ΩT = 2π) ( 2T H(j(rΩ ± Ω 0 )) )2 = sin 2 (T(rΩ ± Ω )/2) 0 4 (T(rΩ ± Ω = sin 2 (rπ ± π ) 0 0 )/2))2 4 (rπ ± π 0 )2 The signal component in the interpolated output is the sinuoidal correponding to the deltas located at ±Ω/0. Therefore the power of the signal component in the interpolated output is: sin 2 ( π ) 0 4 ( π + sin 2 ( π ) 0 0 )2 4 ( π = 2 sin 2 ( π ) 0 0 )2 4 ( π = )2 The ripple consists of all the other undesired sinusoids correponding to the deltas located at frequencies different from ±Ω/0. The power of the ripple in the interpolated output in the vecinity of the sampling frequency correponds to the power of the sinusoid with frequencies Ω ± Ω/0 which corresponds to the power for the deltas at frequencies ±Ω ± Ω/0, that is, for the cases when r = ±. Therefore that power is sin 2 (π + π ) 0 4 (π + π + sin 2 ( π π ) 0 0 )2 4 ( π π + sin 2 ( π + π ) 0 0 )2 4 ( π + π + sin 2 (π π ) 0 0 )2 4 (π π = )2 2
3 (c) (5 points) Analogously, the ripple power in the vecinity of twice the sampling frequency, i.e., at frequencies 2Ω ± Ω/0 will be sin 2 (2π + π ) 0 4 (2π + π + sin 2 ( 2π π ) 0 0 )2 4 ( 2π π + sin 2 ( 2π + π ) 0 0 )2 4 ( 2π + π + sin 2 (2π π ) 0 0 )2 4 (2π π = )2 Problem 2 Interpolation (5 points) This problem is exactly the same as the previous problem, the only difference is that the interpolator is a First Order Hold, therefore we need to find what H(jω) is for this case and apply the same procedure as in the previous section. To find H(jω) we can observe that convolving two rectangular functions give us a triangular one, or we can just look at Fourier Transforms tables to get: H(jω) = T Hence, for the First Order Hold we have: ( sin(ωt/2) (ωt/2) ( 2T H(j(rΩ ± Ω 0 )) )2 = sin 4 (T(rΩ ± Ω )/2) 0 4 (T(rΩ ± Ω = sin 4 (rπ ± π ) 0 0 )/2))4 4 (rπ ± π 0 )4 The power of the signal component in the interpolated output is: sin 4 ( π ) 0 4 ( π + sin 4 ( π ) 0 0 )4 4 ( π = 2 sin 4 ( π ) 0 0 )4 4 ( π = )4 The power of the ripple in the interpolated output in the vecinity of the sampling frequency is sin 4 (π + π ) 0 4 (π + π + sin 4 ( π π ) 0 0 )4 4 ( π π + sin 4 ( π + π ) 0 0 )4 4 ( π + π + sin 4 (π π ) 0 0 )4 4 (π π = )4 (c) (5 points) The ripple power in the vecinity of twice the sampling frequency, i.e., at frequencies 2Ω ± Ω/0 will be sin 4 (2π + π ) 0 4 (2π + π + sin 4 ( 2π π ) 0 0 )4 4 ( 2π π + sin 4 ( 2π + π ) 0 0 )4 4 ( 2π + π + sin 4 (2π π ) 0 0 )4 4 (2π π = )4 3 ) 2
4 Problem 3 O&S 8. (20 points) x c (t) is obviously periodic since it consists of a sumation of periodic functions. For k 0, e j(2πkt/0 3) has period of 0 3 s. The period of x k c(t) is the minimum common multiple of the periods of the exponentials, therefore its period is 0 3 s. Now, x[n] is sampled with a sampling period of 0 3 s.,therefore, x[n + 6] = x 6 c( (n+6)0 3 ) = 6 x c ( n ) = x 6 c ( n0 3 ) = x[n], that is, 6 samples cover one period of x 6 c (t), which prduces the sequence to repeat every 6 samples. Therefore x[n] is periodic with period 6. Note: Since x[n] is periodic, we ll refer to it from now on as x[n]. The highest frequency component is at 2π9t/0 3 radians, the Nyquist rate is therefore 2π8t/0 3. The sampling frequency is 2π6/0 3 radians which is less than the Nyquist rate. Therefore T is not suficiently small to avoid aliasing. (c) (0 points) This problem can be done in two ways (i and ii below), the first one is applying directly the definition for the DFS coefficients and works the sumation expressions. The second one is a more insightful one, using the relation between the DTFT and the DFS. i) Using that we obtain X[k] = x c (t) = 6 k= 9 a k e j(2πkt/0 3 ) x[n]e j2πnk/6 = N 5 i= 9 x[n] = x c ( n0 3 ) = 6 a i e j(2πin/6) e j2πnk/6 = k= 9 { e j2πn(m) N N if m = ln for some integer l = 0 otherwise X[k] = 6 a 0 + a 6 + a 6 k = 0 a + a 7 + a 5 k = a 2 + a 8 + a 4 k = 2 a 3 + a 9 + a 3 + a 9 k = 3 a 4 + a 2 + a 8 k = 4 a 5 + a + a 7 k = 5 4 a k e j(2πkn/6) 5 a i i= 9 e j2πn(i k) 6
5 ii) First let s find the relation between the DTFT of x[n], X(e jω ), and its DSF coefficients. For reasons I ll describe further, the DTFT of a periodic sequence x[n] with period N is always of the form: X(e jω ) = k= b k δ(ω k2π/n) Note that since X(e jω ) is always periodic with period 2π, the sequence b k has to be periodic with period N. We can now express x[n] in terms of the b k s using the Inverse DTFT: x[n] = 2π ɛ 2π 0 ɛ = 2π = N 2π ɛ 0 ɛ X(e jω )e jωn dω = 2π ɛ 2π 0 ɛ N 2π b ke j2πkn N k= b k δ(ω k2π/n)e jωn dω = We can also express x[n] in term of its DFS coefficients: N b k δ(ω k2π/n)e jωn dω 2π ɛ b k δ(ω k2π/n)e jωn dω 2π 0 ɛ x[n] = N N X[k]e j2πn(m) N Comparing both expressions for x[n] we can easily observe that X[k] = N 2π b k Therefore we can obtain the DFS coefficients of x[n] by finding its DTFT X(e jω ). To do that, recall the result from example 2.24 from O&S (page 54). It states that Hence, x[n] = i= 9 x[n] = e jωon = X(e jω ) = a k e j(2πin/6) = X(e jω ) = X(e jω ) = i= 9 i= 9 2πδ(ω ω o + 2πr) 2πa k δ(ω 2πi/6 + 2πr) 2πa k δ(ω 2πi/6 + 2πr) 5
6 This last equation can be interpreted as the superposition of replicas of 9 i= 9 2πa k δ(ω 2πi/6) that are centered at frequencies 2πr. So we can rewrite X(e jω ) as: X(e jω ) = 2π [(a 0 + a 6 + a 6 )δ(ω + 2πr) + (a + a 7 + a 5 )δ(ω π/6 + 2πr)+ +(a 2 + a 8 + a 4 )δ(ω 2π/6 + 2πr) + (a 3 + a 9 + a 3 + a 9 )δ(ω 2π/6 + 3πr) + +(a 4 + a 2 + a 8 )δ(ω 4π/6 + 2πr) + (a 5 + a + a 7 )δ(ω 5π/6 + 2πr)] Therefore, in the range 0 ω < 2π we have: X(e jω ) = (a 0 + a 6 + a 6 )δ(ω + 2πr) + (a + a 7 + a 5 )δ(ω π/6) + +(a 2 + a 8 + a 4 )δ(ω 2π/6) + (a 3 + a 9 + a 3 + a 9 )δ(ω 2π/6) + +(a 4 + a 2 + a 8 )δ(ω 4π/6) + (a 5 + a + a 7 )δ(ω 5π/6) From this expression is easy to identify b k for k = 0,..., 5, and therefore we obtain: X[k] = 6 a 0 + a 6 + a 6 k = 0 a + a 7 + a 5 k = a 2 + a 8 + a 4 k = 2 a 3 + a 9 + a 3 + a 9 k = 3 a 4 + a 2 + a 8 k = 4 a 5 + a + a 7 k = 5 Problem 4 O&S 8.3 (20 points) In order for X[k] to be real, x[n] should be even, that is, x[ n] = x[n]. The only sequence for which a time origin can be chosen so that happens is x 2 [n]. In order for X[k] to be imaginary (except for k an integer multiple of N), x[n] should be odd, that is, x[ n] = x[n]. For none of the sequences a time origin can be chosen so that happens. Notice that the problem does not require X[k] to be imginary for k multiple of N, so this relaxes the condition on the sequences. So we need to verify that despite of this relaxation on the condition, none of the sequences satisfies the overall requirement. This is left to be done as an exercise to you. (c) (0 points) All the sequences in these problem are periodic with period N = 8. Therefore their DFS are: X[k] = x[n]e j2πnk/8 = x[n]e j2πnm/4 = x[n](j) nm for k = 2m with m = ±, ±2, ±3 6
7 With this observation is easy to verify that X [k] = X 3 [k] = 0 for k = ±2, ±4, ±6, disregarding where the time origin is. Problem 5 O&S 8.7 (0 points) 5 X [k] = X(z) z=e j2πk/4 = x[n]e j2πnk/4 for k = 0,, 2, 3 X [k] is regarded as a 4-point sequence when its inverse DFT is taken to obtain a 4-point sequence x [n]. So we have x [n] = 3 [k]e 4 X j2πnk/4 = 4 3 As in problem part a) version i), using the fact that N 5 i=0 x[i]e j2πki/4 e j2πnk/4 = 4 { e j2πn(m) N N if m = ln for some integer l = 0 otherwise 5 3 i=0 x[i]e j2πk(n i) 4 we can conclude that x [n] = x[0] + x[4] = 2 n = 0 x[] + x[5] = 2 n = x[2] = k = 2 x[3] = k = 3 The sketch of x [n] is trivial. Problem 6 O&S #7.(5 points) (a)(5 points) From tables or by finding the poles of H c (s) and doing partial fraction expansion we can find that s + a H c (s) = = h (s + a) 2 + b 2 c (t) = 2 e( a+jb)t + 2 e( a jb)t = e at cos(bt) h [n] = h c (nt) = 2 e( a+jb)nt + 2 e( a jb)nt = H (z) = 2 e ( a jb)t z + 2 e ( a+jb)t z After some manipulations it simplifies to H (z) = e at cos(bt)z 2e at cos(bt)z + e 2aT z 2 7
8 Also, you can do this problem by doing the Partial fraction expasion of H c (s) and then applying equation (7.2) from O&S, just remove the T d factor in the numerators since for that formula they defined h[n] = T d h c (nt d ), and in our case we have h [n] = h c (nt) only. Anyway, please take a look at the deduction procedure for equation (7.2) and you ll realize that is equivalent to what we did. (b)(5 points) The continuous-time step response of the system is S c (s) = s H c(s) = s + a s((s + a) 2 + b 2 ) = a a 2 +b 2 s Applying the same procedure as in part a) we obtain 2(a+jb) s + (a + jb)t 2(a jb) s + (a jb)t Finally (c)(5 points) S 2 (z) = a a 2 +b 2 z 2(a+jb) e (a+jb)t z 2(a jb) e (a jb)t z z H 2(z) = S 2 (z) = H 2 (z) = ( z )S 2 (z) You can verify that and H 2 (z) H (z) = S (z) = Problem 7 O&S #7.2 (20 points) h 2 [n] h [n] z H (z) S 2 (z) Whe we use impulse invarinace method, the relation between the continuous-time frequency Ω and the discrete-time frequency ω is ω = ΩT. Therefore, the specifications for the discrete-time system imply the following specifications for the continuous-time system: H(jΩ), 0 Ω 0.2π T d H(jΩ) , 0.3π T d Ω π T d Notice the similarity with equations (7.4a) and (7.4b) from example 7.2 from O&S. 8
9 For the sketch, please look at the Answers to Basic Problems for chapter 7 (O&S page 842). Notice that we can use the same procedure indicated in example 7.2 from O&S just replacing π by π/t d in equations (7.4) to (7.7). Therefore we can conclude that N = 6 and ΩT d = (c) (0 points) Please look at the Answers to Basic Problems for chapter 7 (O&S page 842), there it is explained why the poles of the discrete-time filter remain unchanged after using T d, but what about the residues corresponding to each pole? Well, it happens that scaling the poles of the continuous time filter by T d requires to scale the filter by /T d in order to keep the same gain of the filter and since the impulse invariance method defines h[n] = T d h c (nt d ) (Notice the factor T d ), the factor T d gets also canceled on the residues. Another way to look at this is in the frequency domain. Sampling h c (t) with T d scales the replicas of H c (jω) by /T d, but the factor T d from h[n] = T d h c (nt d ) cancels that out, producing the same gain in the discrete-time filter. Problem 8 O&S #7.9 (5 points) ω c = Ω c T d = (2π000)(.0002) = 0.4πrad Problem 9 O&S #7.0 (5 points) ω c = 2 tan ( Ω ct d 2 ) = 2 tan ( 2π2000(0.0004) ) = 2tan (0.8π) = rad 2 Problem 0 O&S #7.2 (5 points) Ω c = 2 T d tan( ω c 2 ) = 2000 tan(π 4 ) = 2000rad/s 9
Lecture 19: Discrete Fourier Series
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 19: Discrete Fourier Series Dec 5, 2001 Prof: J. Bilmes TA: Mingzhou
More informationDiscrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is
Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its
More informationDiscrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz
Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W.
More informationDiscrete Time Fourier Transform (DTFT)
Discrete Time Fourier Transform (DTFT) 1 Discrete Time Fourier Transform (DTFT) The DTFT is the Fourier transform of choice for analyzing infinite-length signals and systems Useful for conceptual, pencil-and-paper
More informationUNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 9th, 011 Examination hours: 14.30 18.30 This problem set
More informationX. 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 informationSignals and Systems Spring 2004 Lecture #9
Signals and Systems Spring 2004 Lecture #9 (3/4/04). The convolution Property of the CTFT 2. Frequency Response and LTI Systems Revisited 3. Multiplication Property and Parseval s Relation 4. The DT Fourier
More informationReview of Discrete-Time System
Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.
More informationECE 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 informationDiscrete Time Fourier Transform
Discrete Time Fourier Transform Recall that we wrote the sampled signal x s (t) = x(kt)δ(t kt). We calculate its Fourier Transform. We do the following: Ex. Find the Continuous Time Fourier Transform of
More informationMultimedia 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 informationComplex symmetry Signals and Systems Fall 2015
18-90 Signals and Systems Fall 015 Complex symmetry 1. Complex symmetry This section deals with the complex symmetry property. As an example I will use the DTFT for a aperiodic discrete-time signal. The
More informationUNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 1th, 016 Examination hours: 14:30 18.30 This problem set
More informationChap 4. Sampling of Continuous-Time Signals
Digital Signal Processing Chap 4. Sampling of Continuous-Time Signals Chang-Su Kim Digital Processing of Continuous-Time Signals Digital processing of a CT signal involves three basic steps 1. Conversion
More informationDigital Signal Processing Lecture 10 - Discrete Fourier Transform
Digital Signal Processing - Discrete Fourier Transform Electrical Engineering and Computer Science University of Tennessee, Knoxville November 12, 2015 Overview 1 2 3 4 Review - 1 Introduction Discrete-time
More information2.161 Signal Processing: Continuous and Discrete
MIT OpenCourseWare http://ocw.mit.edu.6 Signal Processing: Continuous and Discrete Fall 008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. M MASSACHUSETTS
More informationDefinition of Discrete-Time Fourier Transform (DTFT)
Definition of Discrete-Time ourier Transform (DTT) {x[n]} = X(e jω ) + n= {X(e jω )} = x[n] x[n]e jωn Why use the above awkward notation for the transform? X(e jω )e jωn dω Answer: It is consistent with
More informationOverview of Discrete-Time Fourier Transform Topics Handy Equations Handy Limits Orthogonality Defined orthogonal
Overview of Discrete-Time Fourier Transform Topics Handy equations and its Definition Low- and high- discrete-time frequencies Convergence issues DTFT of complex and real sinusoids Relationship to LTI
More informationEEL3135: Homework #3 Solutions
EEL335: Homework #3 Solutions Problem : (a) Compute the CTFT for the following signal: xt () cos( πt) cos( 3t) + cos( 4πt). First, we use the trigonometric identity (easy to show by using the inverse Euler
More information7.16 Discrete Fourier Transform
38 Signals, Systems, Transforms and Digital Signal Processing with MATLAB i.e. F ( e jω) = F [f[n]] is periodic with period 2π and its base period is given by Example 7.17 Let x[n] = 1. We have Π B (Ω)
More informationDigital Signal Processing. Midterm 1 Solution
EE 123 University of California, Berkeley Anant Sahai February 15, 27 Digital Signal Processing Instructions Midterm 1 Solution Total time allowed for the exam is 8 minutes Some useful formulas: Discrete
More informationChapter 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 informationChap 2. Discrete-Time Signals and Systems
Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,
More informationDiscrete Fourier Transform
Discrete Fourier Transform Virtually all practical signals have finite length (e.g., sensor data, audio records, digital images, stock values, etc). Rather than considering such signals to be zero-padded
More informationECE-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 informationDiscrete-Time Fourier Transform (DTFT)
Discrete-Time Fourier Transform (DTFT) 1 Preliminaries Definition: The Discrete-Time Fourier Transform (DTFT) of a signal x[n] is defined to be X(e jω ) x[n]e jωn. (1) In other words, the DTFT of x[n]
More informationEE Homework 13 - Solutions
EE3054 - Homework 3 - Solutions. (a) The Laplace transform of e t u(t) is s+. The pole of the Laplace transform is at which lies in the left half plane. Hence, the Fourier transform is simply the Laplace
More informationELEN 4810 Midterm Exam
ELEN 4810 Midterm Exam Wednesday, October 26, 2016, 10:10-11:25 AM. One sheet of handwritten notes is allowed. No electronics of any kind are allowed. Please record your answers in the exam booklet. Raise
More informationDigital Signal Processing Lecture 8 - Filter Design - IIR
Digital Signal Processing - Filter Design - IIR Electrical Engineering and Computer Science University of Tennessee, Knoxville October 20, 2015 Overview 1 2 3 4 5 6 Roadmap Discrete-time signals and systems
More informationSignals and Systems. Problem Set: The z-transform and DT Fourier Transform
Signals and Systems Problem Set: The z-transform and DT Fourier Transform Updated: October 9, 7 Problem Set Problem - Transfer functions in MATLAB A discrete-time, causal LTI system is described by the
More informationHomework 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 informationZ-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1.
84 5. Z-TRANSFORMS 5 z-transforms Solution: Using the definition (5..2), we find: for case (a), and H(z) h 0 + h z + h 2 z 2 + h 3 z 3 2 + 3z + 5z 2 + 2z 3 H(z) h 0 + h z + h 2 z 2 + h 3 z 3 + h 4 z 4
More informationDiscrete-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 informationReview 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 informationEE 224 Signals and Systems I Review 1/10
EE 224 Signals and Systems I Review 1/10 Class Contents Signals and Systems Continuous-Time and Discrete-Time Time-Domain and Frequency Domain (all these dimensions are tightly coupled) SIGNALS SYSTEMS
More informationELEN 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 information8 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 informationYour solutions for time-domain waveforms should all be expressed as real-valued functions.
ECE-486 Test 2, Feb 23, 2017 2 Hours; Closed book; Allowed calculator models: (a) Casio fx-115 models (b) HP33s and HP 35s (c) TI-30X and TI-36X models. Calculators not included in this list are not permitted.
More informationGrades 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 informationLecture 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 informationHomework 7 Solution EE235, Spring Find the Fourier transform of the following signals using tables: te t u(t) h(t) = sin(2πt)e t u(t) (2)
Homework 7 Solution EE35, Spring. Find the Fourier transform of the following signals using tables: (a) te t u(t) h(t) H(jω) te t u(t) ( + jω) (b) sin(πt)e t u(t) h(t) sin(πt)e t u(t) () h(t) ( ejπt e
More informationSeries FOURIER SERIES. Graham S McDonald. A self-contained Tutorial Module for learning the technique of Fourier series analysis
Series FOURIER SERIES Graham S McDonald A self-contained Tutorial Module for learning the technique of Fourier series analysis Table of contents Begin Tutorial c 24 g.s.mcdonald@salford.ac.uk 1. Theory
More informationEach problem is worth 25 points, and you may solve the problems in any order.
EE 120: Signals & Systems Department of Electrical Engineering and Computer Sciences University of California, Berkeley Midterm Exam #2 April 11, 2016, 2:10-4:00pm Instructions: There are four questions
More informationx[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn
Sampling Let x a (t) be a continuous time signal. The signal is sampled by taking the signal value at intervals of time T to get The signal x(t) has a Fourier transform x[n] = x a (nt ) X a (Ω) = x a (t)e
More informationDigital Signal Processing: Signal Transforms
Digital Signal Processing: Signal Transforms Aishy Amer, Mohammed Ghazal January 19, 1 Instructions: 1. This tutorial introduces frequency analysis in Matlab using the Fourier and z transforms.. More Matlab
More 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
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 informationBME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY
1 Lucas Parra, CCNY BME 50500: Image and Signal Processing in Biomedicine Lecture 2: Discrete Fourier Transform Lucas C. Parra Biomedical Engineering Department CCNY http://bme.ccny.cuny.edu/faculty/parra/teaching/signal-and-image/
More informationFourier transform representation of CT aperiodic signals Section 4.1
Fourier transform representation of CT aperiodic signals Section 4. A large class of aperiodic CT signals can be represented by the CT Fourier transform (CTFT). The (CT) Fourier transform (or spectrum)
More informationOverview of Sampling Topics
Overview of Sampling Topics (Shannon) sampling theorem Impulse-train sampling Interpolation (continuous-time signal reconstruction) Aliasing Relationship of CTFT to DTFT DT processing of CT signals DT
More informationQuestion Paper Code : AEC11T02
Hall Ticket No Question Paper Code : AEC11T02 VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad Four Year B. Tech III Semester Tutorial Question Bank 2013-14 (Regulations: VCE-R11)
More informationDigital Signal Processing. Lecture Notes and Exam Questions DRAFT
Digital Signal Processing Lecture Notes and Exam Questions Convolution Sum January 31, 2006 Convolution Sum of Two Finite Sequences Consider convolution of h(n) and g(n) (M>N); y(n) = h(n), n =0... M 1
More informationLecture 7 ELE 301: Signals and Systems
Lecture 7 ELE 30: Signals and Systems Prof. Paul Cuff Princeton University Fall 20-2 Cuff (Lecture 7) ELE 30: Signals and Systems Fall 20-2 / 22 Introduction to Fourier Transforms Fourier transform as
More informationA system that is both linear and time-invariant is called linear time-invariant (LTI).
The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Lecture Notes: Time, Frequency & Transform Domains February 28, 2012 Signals & Systems Signals are mapped
More informationPS403 - Digital Signal processing
PS403 - Digital Signal processing III. DSP - Digital Fourier Series and Transforms Key Text: Digital Signal Processing with Computer Applications (2 nd Ed.) Paul A Lynn and Wolfgang Fuerst, (Publisher:
More informationDiscrete Fourier transform (DFT)
Discrete Fourier transform (DFT) Signal Processing 2008/9 LEA Instituto Superior Técnico Signal Processing LEA (IST) Discrete Fourier transform 1 / 34 Periodic signals Consider a periodic signal x[n] with
More informationLecture 3 January 23
EE 123: Digital Signal Processing Spring 2007 Lecture 3 January 23 Lecturer: Prof. Anant Sahai Scribe: Dominic Antonelli 3.1 Outline These notes cover the following topics: Eigenvectors and Eigenvalues
More informationUniversity of Connecticut Lecture Notes for ME5507 Fall 2014 Engineering Analysis I Part III: Fourier Analysis
University of Connecticut Lecture Notes for ME557 Fall 24 Engineering Analysis I Part III: Fourier Analysis Xu Chen Assistant Professor United Technologies Engineering Build, Rm. 382 Department of Mechanical
More informationSignals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions
8-90 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 08 Midterm Solutions Name: Andrew ID: Problem Score Max 8 5 3 6 4 7 5 8 6 7 6 8 6 9 0 0 Total 00 Midterm Solutions. (8 points) Indicate whether
More informationFourier series for continuous and discrete time signals
8-9 Signals and Systems Fall 5 Fourier series for continuous and discrete time signals The road to Fourier : Two weeks ago you saw that if we give a complex exponential as an input to a system, the output
More informationLike bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform.
Inversion of the z-transform Focus on rational z-transform of z 1. Apply partial fraction expansion. Like bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform. Let X(z)
More informationFourier Analysis and Spectral Representation of Signals
MIT 6.02 DRAFT Lecture Notes Last update: April 11, 2012 Comments, questions or bug reports? Please contact verghese at mit.edu CHAPTER 13 Fourier Analysis and Spectral Representation of Signals We have
More informationLecture 9 Infinite Impulse Response Filters
Lecture 9 Infinite Impulse Response Filters Outline 9 Infinite Impulse Response Filters 9 First-Order Low-Pass Filter 93 IIR Filter Design 5 93 CT Butterworth filter design 5 93 Bilinear transform 7 9
More informationReview of Fundamentals of Digital Signal Processing
Chapter 2 Review of Fundamentals of Digital Signal Processing 2.1 (a) This system is not linear (the constant term makes it non linear) but is shift-invariant (b) This system is linear but not shift-invariant
More informationHomework 6 Solutions
8-290 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 208 Homework 6 Solutions. Part One. (2 points) Consider an LTI system with impulse response h(t) e αt u(t), (a) Compute the frequency response
More informationANALOG AND DIGITAL SIGNAL PROCESSING CHAPTER 3 : LINEAR SYSTEM RESPONSE (GENERAL CASE)
3. Linear System Response (general case) 3. INTRODUCTION In chapter 2, we determined that : a) If the system is linear (or operate in a linear domain) b) If the input signal can be assumed as periodic
More informationDigital Signal Processing Lecture 3 - Discrete-Time Systems
Digital Signal Processing - Discrete-Time Systems Electrical Engineering and Computer Science University of Tennessee, Knoxville August 25, 2015 Overview 1 2 3 4 5 6 7 8 Introduction Three components of
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 8: February 7th, 2017 Sampling and Reconstruction Lecture Outline! Review " Ideal sampling " Frequency response of sampled signal " Reconstruction " Anti-aliasing
More informationSignals & Systems. Lecture 5 Continuous-Time Fourier Transform. Alp Ertürk
Signals & Systems Lecture 5 Continuous-Time Fourier Transform Alp Ertürk alp.erturk@kocaeli.edu.tr Fourier Series Representation of Continuous-Time Periodic Signals Synthesis equation: x t = a k e jkω
More informationECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3
ECE 30 Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3 Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out
More informationGrades 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 information6.003: Signal Processing
6.003: Signal Processing Discrete Fourier Transform Discrete Fourier Transform (DFT) Relations to Discrete-Time Fourier Transform (DTFT) Relations to Discrete-Time Fourier Series (DTFS) October 16, 2018
More informationFrequency-Domain C/S of LTI Systems
Frequency-Domain C/S of LTI Systems x(n) LTI y(n) LTI: Linear Time-Invariant system h(n), the impulse response of an LTI systems describes the time domain c/s. H(ω), the frequency response describes the
More informationFilter 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 informationFourier Representations of Signals & LTI Systems
3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n] 2. LTI system: LTI System Output = A weighted superposition of the system response to each complex
More information! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals
ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling
More informationLecture 14: Windowing
Lecture 14: Windowing ECE 401: Signal and Image Analysis University of Illinois 3/29/2017 1 DTFT Review 2 Windowing 3 Practical Windows Outline 1 DTFT Review 2 Windowing 3 Practical Windows DTFT Review
More informationThe Discrete-Time Fourier
Chapter 3 The Discrete-Time Fourier Transform 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 3-1-1 Continuous-Time Fourier Transform Definition The CTFT of
More informationEE-210. Signals and Systems Homework 7 Solutions
EE-20. Signals and Systems Homework 7 Solutions Spring 200 Exercise Due Date th May. Problems Q Let H be the causal system described by the difference equation w[n] = 7 w[n ] 2 2 w[n 2] + x[n ] x[n 2]
More informationThe Fourier Transform (and more )
The Fourier Transform (and more ) imrod Peleg ov. 5 Outline Introduce Fourier series and transforms Introduce Discrete Time Fourier Transforms, (DTFT) Introduce Discrete Fourier Transforms (DFT) Consider
More information4.1 Introduction. 2πδ ω (4.2) Applications of Fourier Representations to Mixed Signal Classes = (4.1)
4.1 Introduction Two cases of mixed signals to be studied in this chapter: 1. Periodic and nonperiodic signals 2. Continuous- and discrete-time signals Other descriptions: Refer to pp. 341-342, textbook.
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 9: February 13th, 2018 Downsampling/Upsampling and Practical Interpolation Lecture Outline! CT processing of DT signals! Downsampling! Upsampling 2 Continuous-Time
More informationEE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet
EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, 2012 Cover Sheet Test Duration: 75 minutes. Coverage: Chaps. 5,7 Open Book but Closed Notes. One 8.5 in. x 11 in. crib sheet Calculators
More informationEE 438 Essential Definitions and Relations
May 2004 EE 438 Essential Definitions and Relations CT Metrics. Energy E x = x(t) 2 dt 2. Power P x = lim T 2T T / 2 T / 2 x(t) 2 dt 3. root mean squared value x rms = P x 4. Area A x = x(t) dt 5. Average
More informationGATE EE Topic wise Questions SIGNALS & SYSTEMS
www.gatehelp.com GATE EE Topic wise Questions YEAR 010 ONE MARK Question. 1 For the system /( s + 1), the approximate time taken for a step response to reach 98% of the final value is (A) 1 s (B) s (C)
More informationChapter 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 information6.003 (Fall 2011) Quiz #3 November 16, 2011
6.003 (Fall 2011) Quiz #3 November 16, 2011 Name: Kerberos Username: Please circle your section number: Section Time 2 11 am 3 1 pm 4 2 pm Grades will be determined by the correctness of your answers (explanations
More informationECE 3084 QUIZ 2 SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING GEORGIA INSTITUTE OF TECHNOLOGY APRIL 2, Name:
ECE 3084 QUIZ 2 SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING GEORGIA INSTITUTE OF TECHNOLOGY APRIL 2, 205 Name:. The quiz is closed book, except for one 2-sided sheet of handwritten notes. 2. Turn off
More informationProblem 1. Suppose we calculate the response of an LTI system to an input signal x(n), using the convolution sum:
EE 438 Homework 4. Corrections in Problems 2(a)(iii) and (iv) and Problem 3(c): Sunday, 9/9, 10pm. EW DUE DATE: Monday, Sept 17 at 5pm (you see, that suggestion box does work!) Problem 1. Suppose we calculate
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 22: April 10, 2018 Adaptive Filters Penn ESE 531 Spring 2018 Khanna Lecture Outline! Circular convolution as linear convolution with aliasing! Adaptive Filters Penn
More informationTTT4120 Digital Signal Processing Suggested Solutions for Problem Set 2
Norwegian University of Science and Technology Department of Electronics and Telecommunications TTT42 Digital Signal Processing Suggested Solutions for Problem Set 2 Problem (a) The spectrum X(ω) can be
More informationLAB 6: FIR Filter Design Summer 2011
University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 6: FIR Filter Design Summer 011
More informationChapter 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 informationProblem Score Total
UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN Department of Electrical and Computer Engineering ECE 417 Principles of Signal Analysis Spring 14 EXAM 3 SOLUTIONS Friday, May 9, 14 This is a CLOSED BOOK exam.
More informationECE 413 Digital Signal Processing Midterm Exam, Spring Instructions:
University of Waterloo Department of Electrical and Computer Engineering ECE 4 Digital Signal Processing Midterm Exam, Spring 00 June 0th, 00, 5:0-6:50 PM Instructor: Dr. Oleg Michailovich Student s name:
More informationVoiced Speech. Unvoiced Speech
Digital Speech Processing Lecture 2 Homomorphic Speech Processing General Discrete-Time Model of Speech Production p [ n] = p[ n] h [ n] Voiced Speech L h [ n] = A g[ n] v[ n] r[ n] V V V p [ n ] = u [
More informationGEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL and COMPUTER ENGINEERING
GEORGIA INSIUE OF ECHNOLOGY SCHOOL of ELECRICAL and COMPUER ENGINEERING ECE 6250 Spring 207 Problem Set # his assignment is due at the beginning of class on Wednesday, January 25 Assigned: 6-Jan-7 Due
More informationReview 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 informationLECTURE 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 informationDigital Signal Processing
COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #21 Friday, October 24, 2003 Types of causal FIR (generalized) linear-phase filters: Type I: Symmetric impulse response: with order M an even
More information