Solutions. Number of Problems: 10
|
|
- Candice Morton
- 5 years ago
- Views:
Transcription
1 Final Exam February 4th, 01 Signals & Systems ( ) Prof. R. D Andrea Solutions Exam Duration: 150 minutes Number of Problems: 10 Permitted aids: One double-sided A4 sheet. Questions can be answered in English or German. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors.
2 Page Final Exam Signals & Systems Problem 1 5 points Given a system as below: x[n] + Σ q[n] + Σ + + y[n] β z 1 α z 1 a) Calculate the transfer function Y(z) Q(z). b) Calculate the transfer function Q(z) X(z). c) Calculate the system transfer function H(z) Y(z) X(z). d) For what (real) values of α and β is the system bounded input bounded output stable? (1 point) (1 point) (1 point) ( points) Solution 1 a) We begin by writing down the difference equation: y[n] q[n]+αq[n ], from which we have b) q[n] x[n]+βq[n 1]: Y(z) Q(z)(1+αz ) Y(z) Q(z) 1+αz Q(z) X(z) 1 1 βz 1 c) H(z) Y(z) Q(z) Q(z) X(z) 1+αz 1 βz 1 d) The system is stable if all the poles lie inside the unit circle. 1 βz 1 0 z β
3 Final Exam Signals & Systems Page 3 Therefore the system is stable if β < 1.
4 Page 4 Final Exam Signals & Systems Problem 5 points You are given a system described by the following difference equation. n y[n] x[k] a) Is the system linear? Prove/disprove this. ( points) b) Is the system time invariant? Prove/disprove this. ( points) c) Using an example, show that the system is not bounded (1 point) input bounded output stable. Solution a) Define y 1 [n] : y [n] : n n Now let x 1 : αx 1 [n]+βx [n], from which y 1 n n x 1 [k] x 1 [k] x [k] (αx 1 [k]+βx [k]) αy 1 [n]+βy [n] The system satisfies the principle of superposition, and is therefore linear. b) Let x[n] : x[n l], and then ȳ[n] n n x[k] x[k l]
5 Final Exam Signals & Systems Page 5 If we now define m : k l, then we have from which we get k m k n m n l ȳ[n] n l m y[n l]. x[m] This implies that a time shift in the input yields the corresponding time shift in the output. c) Let x[n] u[n], then x[n] 1 < for all n, and y[n] n, from which we have that y[n] grows unbounded.
6 Page 6 Final Exam Signals & Systems Problem 3 5 points Given a continuous time first-order low-pass filter of the form H(s) 1 τs+1. a) Given a sampling time T s, use the bilinear transformation to convert the continuous time filter to a discrete time filter of the form ( points) H(z) 1+z 1 a 0 +a 1 z 1. b) An impulse is applied to the filter as input and the output is measured. Determine the time constant τ of the continuous time filter given that the first element of the measured impulse response is (3 points) y[0] 1 41 and that the sampling time is T s Solution 3 a) The bilinear transformation mapping continuous time to discrete time is defined as s ( ) z 1. T s z +1
7 Final Exam Signals & Systems Page 7 The transfer function H(z) becomes then H(s ( ) z 1 ) T s z +1 1 ( τ z 1 T s z+1 ) +1 z +1 (1 τ T s )+z(1+ τ 1+z 1 (1+ τ T s )+(1 τ T s )z 1. z +1 τ T s (z 1)+(z +1) T s ) z 1 (z +1) z ((1 1 τ T s )+z(1+ τ b) The difference equation can be derived from the transfer function H(z) and reads as or where a 0 y[n] x[n]+x[n 1] a 1 y[n 1] y[n] 1 a 0 x[n]+ 1 a 0 x[n 1] a 1 a 0 y[n 1]. a 0 1+ τ T s a 1 1 τ T s. Applying an impulse as input, the coefficient a 0 can directly be determined as Thus y[0] a 0. τ (a 0 1) Ts 0.. T s ) )
8 Page 8 Final Exam Signals & Systems Problem 4 5 points Design a first-order finite impulse response (FIR) filter of the form y[n] b 0 x[n]+b 1 x[n 1] that simultaneously fulfils the following requirements: 1. When the input of the filter equals the output is x[n] 1 n, lim y[n] 1. n. The 3dB-bandwith of the filter equals π. (Hint: H(Ω 3dB ) 1 H(0) ) Solution 4 The first requirement implies unity gain and imposes following condition on the filter coefficients lim y[n] 1 b 0 1+b 1 1 b 0 +b 1. n The second requirement combined with the fact that the filter has unity gain or H(0) 1 yields or H( π ) H( π ) 1. The transfer function of the filter equals H(z) b 0 +b 1 z 1 1 b 0 +b 1 z 1.
9 Final Exam Signals & Systems Page 9 Evaluating the transfer function on the unit circle z e jω yields the frequency response H(Ω) b 0 +b 1 e jω b 0 +b 1 (cos(ω) jsin(ω)) b 0 +b 1 cos(ω) +j( b }{{} 1 sin(ω)). }{{} Re(H(Ω)) Im(H(Ω)) The square magnitude of the frequency response equals H(Ω) Re (H(Ω))+Im (H(Ω)) b 0 +b 0b 1 cos(ω)+b 1 cos (Ω)+b 1 sin (Ω) b 0 +b 0b 1 cos(ω)+b 1. Thus combining the first requirement with the second requirement b 0 1 b 1 yields b 0 +b 0 b 1 cos( π )+b 1 b 0 +b 1 1 (1 b 1 ) +b 1 1 b 1 +b 1 1 or b 1 b The unique solution of this quadratic equation is and therefore b 1 1 b 0 1 b 1 1.
10 Page 10 Final Exam Signals & Systems Problem 5 5 points You want to identify a linear time invariant system T with input x[n] and output y[n] y[n] T{x[n]} which you assume is causal and has the form H ID (z) b 0 +z 1 1+a 1 z 1. You apply a causal input to the system that has four elements and you measure the noisy output x {x[0],x[1],x[],x[3]} y {y[0],y[1],y[],y[3]}. a) Define Θ [b 0,a 1 ] T. Write a matrix equation (3 points) G FΘ where G and F consist only of known entities. b) Given the input ( points) x {1,0,0,0} and the output y {,3,,} calculatethecoefficientsb 0 anda 1 intheleastsquaressense. Solution 5 a) The difference equation of the system reads as y[n] b 0 x[n]+x[n 1] a 1 y[n 1].
11 Final Exam Signals & Systems Page 11 Applying a causal input, the output y[n],n 0,1,,3 becomes y[0] b 0 x[0] y[1] b 0 x[1]+x[0] a 1 y[0] y[] b 0 x[]+x[1] a 1 y[1] y[3] b 0 x[3]+x[] a 1 y[] This can be written in a matrix equation where the LHS consists only of known elements independent of the filter coefficients y[0] x[0] 0 [ ] y[1] x[0] y[] x[1] x[1] y[0] b0 x[] y[1]. a 1 y[3] x[] x[3] y[] b) Solving for the vector Θ in the least squares sense results in Θ (F T F) 1 F T G. Setting the elements of F and G according to the given input and output yields G and Thus 1 0 F [ ] (F T F) 1 F T G ( 0 3 [ ][ ] [ [ ] ) ] [ ] b0. a 1
12 Page 1 Final Exam Signals & Systems Problem 6 5 points Given a finite impulse response filter (FIR) of the form y[n] x[n]+4x[n 1]+x[n ] 6 and a zero-mean white noise input signal x[n] with variance σx. a) Determine the frequency response of the filter in polar description ( points) H(Ω) R(Ω)e jφ(ω). b) Using the result of a), determine the power spectral density function S yy (Ω) of the output y[n]. (1 points) c) Using the result of b), calculate the ratio σ y σ x. ( points) (Hint : cos (Ω) 1 (1+cos(Ω))) Solution 6 a) Transforming the difference equation in the z-domain yields Y(z) X(z)+4z 1 X(z)+z X(z). 6 The transfer function therefore equals H(z) Y(z) X(z) 1+4z 1 +z. 6 Evaluating the transfer function on the unit circle z e jω defines the frequency response H(Ω) 1+4e jω +e jω, 6 which can be transformed to polar description in the following way H(Ω) e jω 6 (ejω +4+e jω ) e jω 6 (cos(ω)+jsin(ω)+4+cos(ω) jsin(ω)) (cos(ω)+4) e jω R(Ω)e jφ(ω). 6
13 Final Exam Signals & Systems Page 13 b) The power spectral density (PSD) of the output depends on the PSD of the input and the square magnitude of the frequency response S yy (Ω) H(Ω) S xx (Ω). The PSD of zero-mean white noise is constant and equals S xx (Ω) σ x. The magnitude of the frequency response equals R(Ω) and therefore the PSD of the output becomes S yy (Ω) R (Ω)σ x 1 36 (4cos (Ω)+16cos(Ω)+16)σ x 1 9 (cos (Ω)+4cos(Ω)+4)σ x. c) The variance σ y of the output can be calculated from the inverse Fourier transform of the PSD S yy (Ω) as following σy R yy [k 0] 1 π 1 π π π σ x 18π σ x 18π π π S yy e jω 0 dω 1 9 (cos (Ω)+4cos(Ω)+4)dΩ σx π π 1 1 π (1+cos(Ω))dΩ+4 π π ( σ x 1 π +4 π 18π Therefore the ratio σ y σ x π π 1dΩ+ 1 cos(ω)dω π }{{} 0 ) σ x. equals 1. cos(ω)dω } {{ } 0 π +4 π π +4 π 1dΩ 1dΩ
14 Page 14 Final Exam Signals & Systems Problem 7 5 points You are given a signal x[n], below, to analyze. x[n] {1, 1,0,0} a) What is the Discrete Fourier Transform (DFT), X[k]? ( points) You want to isolate the low frequency content of x[n], and keep only frequencies in the range Ω [0, π ], to yield the (real) signal y[n]. b) Write down the DFT Y[k], and from that calculate the (3 points) signal y[n]. Solution 7 a) We have x[n] {1, 1,0,0}, N 4, W N e j π N e j π This gives: X[k] N 1 n0 x[n]w kn N 1e jπ 0k 1e j π 1k 1 e j π k X[0] 0 X[1] 1+j X[] X[3] 1 j b) Because it is a real signal, the DFT containsonly three distinct frequencies: Ω 0 0, Ω 1 π, Ω π. To eliminate the frequencies above π, we set: Y[0] X[0] 0 Y[1] X[1] 1+j Y[] 0 Y[3] Y[N 3] 1 j
15 Final Exam Signals & Systems Page 15 Note that Y[3] is not zero. If one sets Y[3] 0, but keeps Y[1] 1+j the inverse DFT would yield a signal with imaginary components. The time series y[n] is now calculated using the inverse DFT: N 1 y[n] 1 Y[k]WN kn N k0 1 ( (1+j)e j π n +(1 j)e 3n) jπ 4 y[0] 1 4 ((1+j)+(1 j)) 1 y[1] 1 4 ((1+j)(j)+(1 j)( j)) 1 y[] 1 4 ((1+j)( 1)+(1 j)( 1)) 1 y[3] 1 4 ((1+j)( j)+(1 j)(j)) 1 { } 1 y[n], 1, 1,1
16 Page 16 Final Exam Signals & Systems Problem 8 5 points Given the linearized motion equation of an inverted pendulum on a cart φ(t) aφ(t)+bu(t). where φ(t) is the deviation of the pendulum from the upper equilibrium and u(t) is the input to the system. The output of the system is the deviation φ(t). a) Discretize the equation using the Euler Method (3 points) φ(t) φ(t) φ(t T s)+φ(t T s ) T s and provide the discrete state space representation with two states. b) Let a 3, b 1 and T s 1. Is the system controllable? (1 point) c) Is the system observable? (1 point) Solution 8 a) Define y[n] φ(t) and u(t) x[n] for t [nt s,(n+1)t s ). Then y[n] y[n 1]+y[n ] T s ay[n]+bx[n] or y[n] T sb x[n]+ 1 ats y[n 1] 1 ats 1 y[n ]. 1 ats Introducing the states [ ] q1 [n] q [n] [ ] y[n ] y[n 1]
17 Final Exam Signals & Systems Page 17 the state space representation reads as follows [ ] [ ][ ] q1 [n+1] 0 1 q1 [n] 1 + q [n+1] 1 ats 1 at q s [n] [ ] [ ] y[n] 1 q 1 [n] 1 ats 1 at + s q [n] or q[n+1] Aq[n]+Bx[n] y[n] Cq[n]+Dx[n]. b) The system is controllable if the matrix [ B AB ] has full rank. From a) [ ] 0 B 1 [ ][ ] [ ] AB Thus the system is controllable as [ ] [ ] 0 1 B AB 1 1 [ ] 0 Tsb x[n] 1 ats [ T s b 1 at s ] x[n] has full rank. This can readily be seen as the rows are linearly independent. c) Similarly, the system is observable if [ ] C CA has full rank. From a) C [ 1 1 ] CA [ 1 1 ][ ] [ 1 1 and thus the system is observable as [ ] [ C 1 ] 1 CA 1 has full rank as the rows are linearly independent. 3 ] 3
18 Page 18 Final Exam Signals & Systems Problem 9 5 points Consider a linear, time-invariant system y[n] T{x[n]}, with transfer function H(z). a) Give an equation for the step response s[n] T{u[n]} as a (1 point) function of the system s impulse response h[n] T{δ[n]}. b) Show that the steady state step response of the system can be calculated by evaluating the transfer function at z 1, i.e. lim n s[n] H(z) z1. (3 points) c) If the system is unstable, we expect lim n s[n] to be unbounded. However, H(z) z1 may still be finite. How is this possible, considering your answer above in b)? (1 point) Solution 9 a) For any input, the output is: y[n] h[n] x[n] h[k]x[n k]. Specifically, for a step input we have s[n] h[k]u[n k]. n h[k]. b) By definition, H(z) h[k]z k H(1) h[k]
19 Final Exam Signals & Systems Page 19 Using the result for b) above, we have lims[n] lim n n H(1) n h[k] h[k] c) For unstable systems, the unit circle is excluded from the region of convergence, i.e. it is meaningless to evaluate the transfer function at z 1. The transfer function on its own does not contain any information about stability.
20 Page 0 Final Exam Signals & Systems Problem 10 5 points You are given a continuous time system, of the form q(t) Aq(t)+Bx(t) y(t) Cq(t)+Dx(t) You are to discretize the system over a sample time of T s by using a hold device at the input, such that x(t) x d [n] for t [nt s,(n+1)t s ), to yield a discrete time system of the form q d [n+1] A d q d [n]+b d x d [n] y d [n] C d q d [n]+d d x d [n]. a) Determine the exact discretizationa d, B d, C d and D d using A, B, C and D; such that y d [n] y(nt s ). [ ] For some system you calculate A d, B d and D d 0. b) What is the system transfer function H(z) Y(z) X(z)? (1 point) [ ] 3, C 3 d [ 0 1 ] ( points) c) Is this system bounded input bounded output stable? Why/why not? ( points) Solution 10 a) We define matrices M and G, and use the sampling time T s, to get [ ] A B M 0 0 [ ] G e MT s Ad B d g 1 g C d C D d D
21 Final Exam Signals & Systems Page 1 b) There are two ways of approaching this problem: H(z) C(zI A) 1 B +D 1 (z 0.5)(z 0.75) 3(z 0.5) (z 0.5)(z 0.75) 3 z 0.75 Alternatively, we notice that y[n] q [n] from which we can directly write [ 0 1 ] [ z z q [n 1]+3u[n 1] 0.75y[n 1]+3u[n 1] H(z) 3z z 1 ][ ] c) The transfer function has a pole at z 0.75, which lies inside the unit circle, so it is BIBO stable. Alternatively, we can directly read off the eigenvalues of A, which are λ and λ Both of these eigenvalues lie inside the unit circle, so the system is stable (states decay to zero), and therefore also BIBO stable.
Solutions. Number of Problems: 10
Final Exam February 9th, 2 Signals & Systems (5-575-) Prof. R. D Andrea Solutions Exam Duration: 5 minutes Number of Problems: Permitted aids: One double-sided A4 sheet. Questions can be answered in English
More informationSolutions. Number of Problems: 10
Final Exam February 2nd, 2013 Signals & Systems (151-0575-01) Prof. R. D Andrea Solutions Exam Duration: 150 minutes Number of Problems: 10 Permitted aids: One double-sided A4 sheet. Questions can be answered
More informationFinal Exam January 31, Solutions
Final Exam January 31, 014 Signals & Systems (151-0575-01) Prof. R. D Andrea & P. Reist Solutions Exam Duration: Number of Problems: Total Points: Permitted aids: Important: 150 minutes 7 problems 50 points
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 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 informationQuiz. Good luck! Signals & Systems ( ) Number of Problems: 19. Number of Points: 19. Permitted aids:
Quiz November th, Signals & Systems (--) Prof. R. D Andrea Quiz Exam Duration: Min Number of Problems: Number of Points: Permitted aids: Important: None Questions must be answered on the provided answer
More informationUniversity of Illinois at Urbana-Champaign ECE 310: Digital Signal Processing
University of Illinois at Urbana-Champaign ECE 0: Digital Signal Processing Chandra Radhakrishnan PROBLEM SET : SOLUTIONS Peter Kairouz Problem. Hz z 7 z +/9, causal ROC z > contains the unit circle BIBO
More informationZ Transform (Part - II)
Z Transform (Part - II). The Z Transform of the following real exponential sequence x(nt) = a n, nt 0 = 0, nt < 0, a > 0 (a) ; z > (c) for all z z (b) ; z (d) ; z < a > a az az Soln. The given sequence
More 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 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 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 informationDiscrete-time signals and systems
Discrete-time signals and systems 1 DISCRETE-TIME DYNAMICAL SYSTEMS x(t) G y(t) Linear system: Output y(n) is a linear function of the inputs sequence: y(n) = k= h(k)x(n k) h(k): impulse response of the
More 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 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 informationEEL3135: Homework #4
EEL335: Homework #4 Problem : For each of the systems below, determine whether or not the system is () linear, () time-invariant, and (3) causal: (a) (b) (c) xn [ ] cos( 04πn) (d) xn [ ] xn [ ] xn [ 5]
More 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 informationNAME: 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 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 informationECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION
FINAL EXAMINATION 9:00 am 12:00 pm, December 20, 2010 Duration: 180 minutes Examiner: Prof. M. Vu Assoc. Examiner: Prof. B. Champagne There are 6 questions for a total of 120 points. This is a closed book
More informationECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam.
ECE 35 Spring - Final Exam 9 May ECE 35 Signals and Systems Spring Final Exam - Solutions Three 8 ½ x sheets of notes, and a calculator are allowed during the exam Write all answers neatly and show your
More informationExamination with solution suggestions SSY130 Applied Signal Processing
Examination with solution suggestions SSY3 Applied Signal Processing Jan 8, 28 Rules Allowed aids at exam: L. Råde and B. Westergren, Mathematics Handbook (any edition, including the old editions called
More informationDigital Signal Processing I Final Exam Fall 2008 ECE Dec Cover Sheet
Digital Signal Processing I Final Exam Fall 8 ECE538 7 Dec.. 8 Cover Sheet Test Duration: minutes. Open Book but Closed Notes. Calculators NOT allowed. This test contains FIVE problems. All work should
More informationNAME: 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 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 informationEE538 Final Exam Fall :20 pm -5:20 pm PHYS 223 Dec. 17, Cover Sheet
EE538 Final Exam Fall 005 3:0 pm -5:0 pm PHYS 3 Dec. 17, 005 Cover Sheet Test Duration: 10 minutes. Open Book but Closed Notes. Calculators ARE allowed!! This test contains five problems. Each of the five
More informationZ-Transform. x (n) Sampler
Chapter Two A- Discrete Time Signals: The discrete time signal x(n) is obtained by taking samples of the analog signal xa (t) every Ts seconds as shown in Figure below. Analog signal Discrete time signal
More informationSignals & Systems Handout #4
Signals & Systems Handout #4 H-4. Elementary Discrete-Domain Functions (Sequences): Discrete-domain functions are defined for n Z. H-4.. Sequence Notation: We use the following notation to indicate the
More informationDiscrete-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 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 informationFinal Exam ECE301 Signals and Systems Friday, May 3, Cover Sheet
Name: Final Exam ECE3 Signals and Systems Friday, May 3, 3 Cover Sheet Write your name on this page and every page to be safe. Test Duration: minutes. Coverage: Comprehensive Open Book but Closed Notes.
More informationDESIGN 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 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 informationLecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.
Lecture 10 Digital Signal Processing Chapter 7 Discrete Fourier transform DFT Mikael Swartling Nedelko Grbic Bengt Mandersson rev. 016 Department of Electrical and Information Technology Lund University
More informationECGR4124 Digital Signal Processing Exam 2 Spring 2017
ECGR4124 Digital Signal Processing Exam 2 Spring 2017 Name: LAST 4 NUMBERS of Student Number: Do NOT begin until told to do so Make sure that you have all pages before starting NO TEXTBOOK, NO CALCULATOR,
More informationLTI 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 informationEC 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 informationMultidimensional digital signal processing
PSfrag replacements Two-dimensional discrete signals N 1 A 2-D discrete signal (also N called a sequence or array) is a function 2 defined over thex(n set 1 of, n 2 ordered ) pairs of integers: y(nx 1,
More informationEE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley
University of California Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences Professors : N.Morgan / B.Gold EE225D Digital Filters Spring,1999 Lecture 7 N.MORGAN
More informationGEORGIA 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 informationVI. Z Transform and DT System Analysis
Summer 2008 Signals & Systems S.F. Hsieh VI. Z Transform and DT System Analysis Introduction Why Z transform? a DT counterpart of the Laplace transform in CT. Generalization of DT Fourier transform: z
More informationAnalog vs. discrete signals
Analog vs. discrete signals Continuous-time signals are also known as analog signals because their amplitude is analogous (i.e., proportional) to the physical quantity they represent. Discrete-time signals
More 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 informationThe 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 informationDiscrete-Time Signals and Systems
ECE 46 Lec Viewgraph of 35 Discrete-Time Signals and Systems Sequences: x { x[ n] }, < n
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 informationELC 4351: Digital Signal Processing
ELC 4351: Digital Signal Processing Liang Dong Electrical and Computer Engineering Baylor University liang dong@baylor.edu October 18, 2016 Liang Dong (Baylor University) Frequency-domain Analysis of LTI
More informationModule 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 informationEEM 409. Random Signals. Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Problem 2:
EEM 409 Random Signals Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Consider a random process of the form = + Problem 2: X(t) = b cos(2π t + ), where b is a constant,
More informationECE538 Final Exam Fall 2017 Digital Signal Processing I 14 December Cover Sheet
ECE58 Final Exam Fall 7 Digital Signal Processing I December 7 Cover Sheet Test Duration: hours. Open Book but Closed Notes. Three double-sided 8.5 x crib sheets allowed This test contains five problems.
More informationVery useful for designing and analyzing signal processing systems
z-transform z-transform The z-transform generalizes the Discrete-Time Fourier Transform (DTFT) for analyzing infinite-length signals and systems Very useful for designing and analyzing signal processing
More 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 informationSolutions: Homework Set # 5
Signal Processing for Communications EPFL Winter Semester 2007/2008 Prof. Suhas Diggavi Handout # 22, Tuesday, November, 2007 Solutions: Homework Set # 5 Problem (a) Since h [n] = 0, we have (b) We can
More informationProperties 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 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 informationECE503: Digital Signal Processing Lecture 5
ECE53: Digital Signal Processing Lecture 5 D. Richard Brown III WPI 3-February-22 WPI D. Richard Brown III 3-February-22 / 32 Lecture 5 Topics. Magnitude and phase characterization of transfer functions
More information/ (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 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 informationECGR4124 Digital Signal Processing Final Spring 2009
ECGR4124 Digital Signal Processing Final Spring 2009 Name: LAST 4 NUMBERS of Student Number: Do NOT begin until told to do so Make sure that you have all pages before starting Open book, 2 sheet front/back
More informationModule 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 informationEE 521: Instrumentation and Measurements
Aly El-Osery Electrical Engineering Department, New Mexico Tech Socorro, New Mexico, USA November 1, 2009 1 / 27 1 The z-transform 2 Linear Time-Invariant System 3 Filter Design IIR Filters FIR Filters
More informationNAME: 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 informationCMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation
CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University January 23, 2006 1 Exponentials The exponential is
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 informationFinal Exam of ECE301, Section 3 (CRN ) 8 10am, Wednesday, December 13, 2017, Hiler Thtr.
Final Exam of ECE301, Section 3 (CRN 17101-003) 8 10am, Wednesday, December 13, 2017, Hiler Thtr. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, and
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 informationTransform Analysis of Linear Time-Invariant Systems
Transform Analysis of Linear Time-Invariant Systems Discrete-Time Signal Processing Chia-Ping Chen Department of Computer Science and Engineering National Sun Yat-Sen University Kaohsiung, Taiwan ROC Transform
More informationFourier Methods in Digital Signal Processing Final Exam ME 579, Spring 2015 NAME
Fourier Methods in Digital Signal Processing Final Exam ME 579, Instructions for this CLOSED BOOK EXAM 2 hours long. Monday, May 8th, 8-10am in ME1051 Answer FIVE Questions, at LEAST ONE from each section.
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 informationDigital 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 informationEE 3054: Signals, Systems, and Transforms Spring A causal discrete-time LTI system is described by the equation. y(n) = 1 4.
EE : Signals, Systems, and Transforms Spring 7. A causal discrete-time LTI system is described by the equation Test y(n) = X x(n k) k= No notes, closed book. Show your work. Simplify your answers.. A discrete-time
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 information7.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 informationProbability Space. J. McNames Portland State University ECE 538/638 Stochastic Signals Ver
Stochastic Signals Overview Definitions Second order statistics Stationarity and ergodicity Random signal variability Power spectral density Linear systems with stationary inputs Random signal memory Correlation
More informationNeed for transformation?
Z-TRANSFORM In today s class Z-transform Unilateral Z-transform Bilateral Z-transform Region of Convergence Inverse Z-transform Power Series method Partial Fraction method Solution of difference equations
More informationDiscrete-Time Signals and Systems. Frequency Domain Analysis of LTI Systems. The Frequency Response Function. The Frequency Response Function
Discrete-Time Signals and s Frequency Domain Analysis of LTI s Dr. Deepa Kundur University of Toronto Reference: Sections 5., 5.2-5.5 of John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing:
More 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 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 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 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 informationsummable Necessary and sufficient for BIBO stability of an LTI system. Also see poles.
EECS 206 DSP GLOSSARY c Andrew E. Yagle Fall 2005 absolutely impulse response: h[n] is finite. EX: n=0 ( 3 4 )n = 1 = 4 but 1 3 n=1 1 n. 4 summable Necessary and sufficient for BIBO stability of an LI
More 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 informationUniversity of Waterloo Department of Electrical and Computer Engineering ECE 413 Digital Signal Processing. Spring Home Assignment 2 Solutions
University of Waterloo Department of Electrical and Computer Engineering ECE 13 Digital Signal Processing Spring 017 Home Assignment Solutions Due on June 8, 017 Exercise 1 An LTI system is described by
More informationUniversity Question Paper Solution
Unit 1: Introduction University Question Paper Solution 1. Determine whether the following systems are: i) Memoryless, ii) Stable iii) Causal iv) Linear and v) Time-invariant. i) y(n)= nx(n) ii) y(t)=
More informationECE 301 Division 1 Exam 1 Solutions, 10/6/2011, 8-9:45pm in ME 1061.
ECE 301 Division 1 Exam 1 Solutions, 10/6/011, 8-9:45pm in ME 1061. Your ID will be checked during the exam. Please bring a No. pencil to fill out the answer sheet. This is a closed-book exam. No calculators
More informationDefinition. A signal is a sequence of numbers. sequence is also referred to as being in l 1 (Z), or just in l 1. A sequence {x(n)} satisfying
Signals and Systems. Definition. A signal is a sequence of numbers {x(n)} n Z satisfying n Z x(n)
More informationCh. 7: Z-transform Reading
c J. Fessler, June 9, 3, 6:3 (student version) 7. Ch. 7: Z-transform Definition Properties linearity / superposition time shift convolution: y[n] =h[n] x[n] Y (z) =H(z) X(z) Inverse z-transform by coefficient
More informationPS403 - Digital Signal processing
PS403 - Digital Signal processing 6. DSP - Recursive (IIR) Digital Filters Key Text: Digital Signal Processing with Computer Applications (2 nd Ed.) Paul A Lynn and Wolfgang Fuerst, (Publisher: John Wiley
More informationStability Condition in Terms of the Pole Locations
Stability Condition in Terms of the Pole Locations A causal LTI digital filter is BIBO stable if and only if its impulse response h[n] is absolutely summable, i.e., 1 = S h [ n] < n= We now develop a stability
More informationQ1 Q2 Q3 Q4 Q5 Total
EE 120: Signals & Systems Department of Electrical Engineering and Computer Sciences University of California, Berkeley Midterm Exam #1 February 29, 2016, 2:10-4:00pm Instructions: There are five questions
More informationDigital Signal Processing Lecture 4
Remote Sensing Laboratory Dept. of Information Engineering and Computer Science University of Trento Via Sommarive, 14, I-38123 Povo, Trento, Italy Digital Signal Processing Lecture 4 Begüm Demir E-mail:
More informationLecture 7 Discrete Systems
Lecture 7 Discrete Systems EE 52: Instrumentation and Measurements Lecture Notes Update on November, 29 Aly El-Osery, Electrical Engineering Dept., New Mexico Tech 7. Contents The z-transform 2 Linear
More 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 informationECE301 Fall, 2006 Exam 1 Soluation October 7, Name: Score: / Consider the system described by the differential equation
ECE301 Fall, 2006 Exam 1 Soluation October 7, 2006 1 Name: Score: /100 You must show all of your work for full credit. Calculators may NOT be used. 1. Consider the system described by the differential
More informationZ-Transform. The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = g(t)e st dt. Z : G(z) =
Z-Transform The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = Z : G(z) = It is Used in Digital Signal Processing n= g(t)e st dt g[n]z n Used to Define Frequency
More 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 informationLecture 8 - IIR Filters (II)
Lecture 8 - IIR Filters (II) James Barnes (James.Barnes@colostate.edu) Spring 2009 Colorado State University Dept of Electrical and Computer Engineering ECE423 1 / 27 Lecture 8 Outline Introduction Digital
More information! 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 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 informationECE-314 Fall 2012 Review Questions for Midterm Examination II
ECE-314 Fall 2012 Review Questions for Midterm Examination II First, make sure you study all the problems and their solutions from homework sets 4-7. Then work on the following additional problems. Problem
More informationLecture 18: Stability
Lecture 18: Stability ECE 401: Signal and Image Analysis University of Illinois 4/18/2017 1 Stability 2 Impulse Response 3 Z Transform Outline 1 Stability 2 Impulse Response 3 Z Transform BIBO Stability
More information