Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Solutions for Problem Set 2
|
|
- Sharleen Walters
- 6 years ago
- Views:
Transcription
1 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science Issued: Tuesday, September 5. 6.: Discrete-Time Signal Processing Fall 5 Solutions for Problem Set Problem. (i) Real-valued impulse response: Poles that aren t real must be in complex conjugate pairs. Zeros that aren t real must be in complex conjugate pairs. (ii) Finite impulse response: All poles are at the origin. The ROC is the entire z-plane, except possibly z =. (iii) h[n] = h[α n] where α is an integer: Causality combined with the given symmetry property implies a finite-length h[n] that can only be nonzero between time zero and time α. Thus we must have all poles at the origin and at most α zeros. The z transform of h[α n] is z α H(/z), so any zero of H(z) at c must be paired with a zero at /c. (iii) Minimum phase: All poles and zeros are inside the unit circle (so that the inverse can be stable and causal). (iv) All-pass: Each pole is paired with a zero at the conjugate reciprocal location. Problem. (a) False. As a counterexample, consider a filter described by H(e jω ) = e jω. We know that H(z) can describe a causal, stable filter since its single pole is at z =. In the vicinity of ω =, θ(ω) is increasing, so the group delay τ(ω) is negative. The group delay evaluated at ω = for this example can be determined using equation (5.67) in OSB: grd[ re jθ e jω ] = r r cos(ω θ) re jθ e jω and substituting r = and θ =.
2 (b) False. Any zero-phase FIR filter may be delayed to become causal, and the resulting filter will have the same phase as the delay block which was applied to it. One counterexample is the causal, stable filter described by H(z) = + z + z. (c) True. Note that τ(ω)dω = θ(ω) ω= = θ() θ(). Setting this to, we realize that the assertion is true if having minimum phase and all poles and zeros on the real axis implies θ() = θ(). A minimum phase filter with poles and zeros on the real axis will have all poles and zeros between - and. Factoring H(e jω ) to find poles and zeros, we notice that for a given pole term, the restriction < a < yields a phase contribution of when ω = or ae jω ω =. Likewise, a given zero term be jω gives a phase contribution of when ω = or ω = as long as < b <. Since all poles and zeros of such a minimum phase filter meet these criteria, θ() = θ() = Therefore, τ(ω)dω =. (Note that τ(ω)dω = for all real minimum phase filters, even if there are complex poles and zeros.) Problem. The pole-zero diagram for the original system is as follows: Original system.5 pole at (a) One way to carry out the minimum-phase and all-pass decomposition is as follows. In the first stage, collect all zeros and poles that are inside the unit circle (zero at z = /, pole
3 at z = /) into the minimum-phase system. The other zeros and poles (zero at z =, pole at z = ) go into the all-pass system. Minimum phase All pass pole at Next, we need to modify the first stage because we need to make sure that the all-pass system really is all-pass, so add a pole at z = / and a zero at z =. To preserve the original system, we can cancel these newcomers by placing a zero at z = / and a pole at z = in the minimum-phase system. Minimum phase All pass Combining these, the minimum-phase system and all-pass systems are as shown below.
4 Minimum phase All pass pole at In the minimum-phase system, the pole at z = / from the first stage has been cancelled by the zero added in the second stage. Another way to look at that is that for this particular system, we started with an all-pass pair (a pole at z = / and a zero at z =, so we could have put these into the all-pass system initially. The minimum-phase system function is: The all-pass system function is: H M (z) = z z = z H ap (z) = = z(z ) z z ( z ) z In constructing these systems, we didn t come across any decision where we could have chosen different routes. If we wanted to change one of the systems, we would have to add the same number of poles and zeros to it, and these would have to be cancelled by zeros and poles in the other system to preserve the original system. We can t add poles or zeros to the minimum phase system, because if we did, then when we added the cancelling zeros or poles to the all-pass system, they would have to be
5 reflected outside the unit circle to keep the latter system all-pass. These items outside the unit circle could not be cancelled in the minimum phase system. Finally, we cannot change the all-pass system because if we added a zero and a pole, then to keep the system all-pass, we would have to reflect a pole or zero to the other side of the unit circle, and the items outside the unit circle could not be cancelled in the minimum-phase system. Therefore, the decomposition is unique up to a scale factor. (b) One way to carry out the minimum-phase and FIR linear-phase decomposition is as follows. In the first stage, collect all zeros and poles that are inside the unit circle (zero at z = /, pole at z = /) into the minimum-phase system. The other zeros and poles (zero at z =, pole at z = ) go into the linear-phase system. Minimum phase Linear phase pole at Next, we need to modify the first stage because we need to make sure that the linear-phase FIR system really is linear-phase FIR, so add a zero at z = /. Since the system has to have the same number of zeros and poles, we also need to add a pole. For an FIR system, the pole must be at z = or at z =. We choose to add the pole at z = because we will have to cancel the pole by a zero in the minimum-phase system. To preserve the original system, we can cancel these newcomers by placing a pole at z = / and a zero at z = in the minimum-phase system.
6 Minimum phase Linear phase Combining these, the minimum-phase system and FIR linear-phase systems are as shown below. Minimum phase Linear phase pole at The minimum phase system function is: H M (z) = z ( z ( ) z = ( z z ) )
7 The FIR generalized linear-phase system function is: ( z H L (z) = ) (z ) z = z [( ) ( z z )] = z.5 + z Since this expression for H L (z) has even symmetry and an odd number of taps, we would not necessarily expect a zero at z = or at z =, and this is consistent with the polezero diagram above. In constructing these systems, we didn t come across any decisions where we could have chosen different routes. Furthermore, we cannot change the minimum phase system. If we tried adding a pole and zero to it, these would have to be cancelled in the FIR linear phase system. But the zero in the linear-phase system would have to be reflected outside the unit circle to maintain linear-phase, and this could not be compensated for in the minimum-phase system. Similarly, we cannot add a pole and zero to the FIR linear-phase system because if we did, then to keep it linear-phase, we would have to reflect the zero outside the unit circle, and this could not be cancelled in the minimum-phase system. Therefore, the decomposition is unique. Problem. a. We desire H(z)H c (z) =, where H c (z) is stable and causal and H(z) is not minimum phase. So, H ap (z)h min (z)h c (z) = Since H ap (z) =, we want This means we have H min (z)h c (z) = H c (z) = H min (z) which will be stable and causal since all the zeros of H min (z), which become the poles of H c (z), are inside the unit circle. b. Since We have H c (z) = H min (z) G(z) = H ap (z)
8 c. H(z) = (.8e j. z )(.8e j. z )(.e j.7 z )(.e j.7 z ) H min (z) = (.)(.8e j. z )(.8e j. z )( (5/6)e j.7 z )( (5/6)e j.7 z ) H c (z) = (.)(.8e j. z )(.8e j. z )( (5/6)e j.7 z )( (5/6)e j.7 z ) G(z) = H ap (z) = (z (5/6)e j.7 )(z (5/6)e j.7 ) ( (5/6)e j.7 z )( (5/6)e j.7 z ) Im H min (z) Re th order pole Im H c (z) Im H ap (z) = G(z) Re Re th order zero Problem.5 (a) Using the all-pass principle, H(z) can be represented as a cascade of the minimum phase term H min (z) and an all-pass term. We add a pole to remove the zero at z = z k, and replace it with a zero at z = zk : H(z) = H min (z) z z k z k z = Q(z)(z z k ) (b) We know that: H(z) = Q(z)(z z k ) = Q(z)z Q(z)z k Taking the inverse z-transform: H min (z) = Q(z)( z k z ) = Q(z) z k z Q(z)
9 h[n] = q[n ] z k q[n] (c) Using our answer from part (b): h min [n] = q[n] z k q[n ] ε = = = m m h min [n] h[n] n= n= m q[n] z k q[n ]q [n] zk q [n ]q[n] + z k q[n ] n= m q[n ] z k q[n ]q [n] zk q [n ]q[n] + z k q[n] n= m ( z k ) q[n] n= n= = ( z k ) q[m] m ( z k ) q[n ] (d) Since z k <, ( z k ) is positive and therefore ( z k ) q[m] > Then m n= h min[n] m n= h[n] > thus m n= h min[n] > m n= h[n]
10 Problem.6 (a) (b) (c) (d) X(e jω ) T X(e jω ) T X(e jω ) T X(e jω ) T ω ω ω 5 5 Y c (jω) 5 5 Y c (jω) Y c (jω) 5 5 Y c (jω) ω 5 5 Ω Ω Ω Ω
11 Problem.7 In both systems, the speech was filtered first so that the subsequent sampling results in no aliasing. Therefore, going from s[n] to s [n] basically requires changing the sampling rate by a factor of khz/5khz = /5. This is done with the following system: s[n] Digital LPF s [n] ω c = 5 5 gain = Problem.8 Split H(e jω ) into a lowpass and a delay. H(e jω ) = H LP (e jω )e jω { H LP (e jω, ω < ) = L, L < ω x c (t) C/D x[n] L H LP (e jω ) w[n] e v[n] L y c (t) jω Ideal Upsampler with gain of instead of L Then we analyze the system as follows: x[n] = x c (nt) no aliasing assumed w[n] = L x c(n T L ) rate change v[n] = w[n ] = ( L x c n T L T ), delay at higher rate L y[n] = v[nl] = ( L x c nt T ) L
12 Problem.9 (a) Let s rewrite System A as the cascade of two systems: an S/I (sample to impulse) converter followed by a CT filter. The S/I converter turns the DT signal x d [n] into a CT impulse train. If we allow the output of the S/I converter to be x s (t), then we have x s (t) = k= x d [k]δ(t kt ) Then, the output y c (t) of the CT filter is the convolution of x s (t) and h (t), or y c (t) = x s (t) h (t). We see that by combining the above two equations, we get the equation that describes the behavior of System A. x c (t) is bandlimited to Ω c = rad/sec. Thus, we know that we can guarantee the equality of x c (t) and y c (t) when T is sufficiently small (i.e. no aliasing from the first C/D converter) and System A is an ideal D/C converter with the same sampling period. We have no aliasing when Ω c T <, or when T <. System A is an ideal D/C converter when h (t) is an appropriate sinc function. Thus, the following conditions work: T = 5. T = 5. h (t) = sin(t/t) t/t (b) As we saw in the solution to part (a), our choices are not unique. We can choose any T such that T <. However, we see that we need T = T. We also have a choice regarding h (t). Since X d (e jω ), or the Fourier transform of x d [n], is zero for T < ω <, X s (jω), or the Fourier transform of x s (t), is zero for T T = < Ω < T. Thus, H (jω), or the Fourier transform of h (t), can be anything in that frequency range (and, by extension, any copy of this section of the frequency spectrum). If it is a constant of T for Ω < and zero for Ω > T, then we have y c(t) = x c (t).
13 (c) Since we are interested only in the operations between x d [n] and y d [n], we need not worry about aliasing from the first C/D converter in the whole system destroying our hopes for achieving consistent resampling. Thus, there are no absolute restrictions on T and T like we had in parts (a) and (b); they may, however, be related to each other. In other words, what is going on between x d [n] and y d [n]? System A is taking each sample of x d [n] and replacing it with h (t) delayed by nt and scaled by x d [n] at that point. Then, the C/D converter resamples the result. Let s consider what happens with x d [n] = δ[n n ] for an integer n. Then, y c (t) = h (t n T ). The sampled version of y c (t) is y d [n] = y c (nt) A condition for consistent resampling is thus = h (nt n T ). h (nt n T ) = δ[n n ]. Because of the linearity of the mapping from x d [n] to y d [n], this is actually the only condition that must be checked. To simplify the condition further, we have evaluating at n = n : = h (n(t T )) evaluating at n n : = h (nt n T )) The case of practical significance is to have T = T, in which case we find that h (t) should satisfying an interpolating condition: h () = and h (t) = for all multiples of T. (It doesn t matter what h (t) is for other values of t.)
2. Typical Discrete-Time Systems All-Pass Systems (5.5) 2.2. Minimum-Phase Systems (5.6) 2.3. Generalized Linear-Phase Systems (5.
. Typical Discrete-Time Systems.1. All-Pass Systems (5.5).. Minimum-Phase Systems (5.6).3. Generalized Linear-Phase Systems (5.7) .1. All-Pass Systems An all-pass system is defined as a system which has
More informationLecture 14: Minimum Phase Systems and Linear Phase
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 14: Minimum Phase Systems and Linear Phase Nov 19, 2001 Prof: J. Bilmes
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( ) John A. Quinn Lecture. ESE 531: Digital Signal Processing. Lecture Outline. Frequency Response of LTI System. Example: Zero on Real Axis
John A. Quinn Lecture ESE 531: Digital Signal Processing Lec 15: March 21, 2017 Review, Generalized Linear Phase Systems Penn ESE 531 Spring 2017 Khanna Lecture Outline!!! 2 Frequency Response of LTI System
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 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 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 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 informationESE 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 informationMultirate signal processing
Multirate signal processing Discrete-time systems with different sampling rates at various parts of the system are called multirate systems. The need for such systems arises in many applications, including
More informationDigital Signal Processing Lecture 9 - Design of Digital Filters - FIR
Digital Signal Processing - Design of Digital Filters - FIR Electrical Engineering and Computer Science University of Tennessee, Knoxville November 3, 2015 Overview 1 2 3 4 Roadmap Introduction Discrete-time
More 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 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 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 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 informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 3 Signals & Systems Prof. ark Fowler Note Set #28 D-T Systems: DT Filters Ideal & Practical /4 Ideal D-T Filters Just as in the CT case we can specify filters. We looked at the ideal filter for the
More informationDigital Signal Processing IIR Filter Design via Bilinear Transform
Digital Signal Processing IIR Filter Design via Bilinear Transform D. Richard Brown III D. Richard Brown III 1 / 12 Basic Procedure We assume here that we ve already decided to use an IIR filter. The basic
More 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 informationSignals and Systems. Spring Room 324, Geology Palace, ,
Signals and Systems Spring 2013 Room 324, Geology Palace, 13756569051, zhukaiguang@jlu.edu.cn Chapter 10 The Z-Transform 1) Z-Transform 2) Properties of the ROC of the z-transform 3) Inverse z-transform
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 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 informationTransform Representation of Signals
C H A P T E R 3 Transform Representation of Signals and LTI Systems As you have seen in your prior studies of signals and systems, and as emphasized in the review in Chapter 2, transforms play a central
More informationMultirate Digital Signal Processing
Multirate Digital Signal Processing Basic Sampling Rate Alteration Devices Up-sampler - Used to increase the sampling rate by an integer factor Down-sampler - Used to decrease the sampling rate by an integer
More informationToday. ESE 531: Digital Signal Processing. IIR Filter Design. Impulse Invariance. Impulse Invariance. Impulse Invariance. ω < π.
Today ESE 53: Digital Signal Processing! IIR Filter Design " Lec 8: March 30, 207 IIR Filters and Adaptive Filters " Bilinear Transformation! Transformation of DT Filters! Adaptive Filters! LMS Algorithm
More 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 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 informationDigital Signal Processing
COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #20 Wednesday, October 22, 2003 6.4 The Phase Response and Distortionless Transmission In most filter applications, the magnitude response H(e
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 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 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 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 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 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 informationLecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE
OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE EEE 43 DIGITAL SIGNAL PROCESSING (DSP) 2 DIFFERENCE EQUATIONS AND THE Z- TRANSFORM FALL 22 Yrd. Doç. Dr. Didem Kivanc Tureli didemk@ieee.org didem.kivanc@okan.edu.tr
More informationLECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)
LECTURE NOTES ON DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13) FACULTY : B.V.S.RENUKA DEVI (Asst.Prof) / Dr. K. SRINIVASA RAO (Assoc. Prof) DEPARTMENT OF ELECTRONICS AND COMMUNICATIONS
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 informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture 18: Applications of FFT Algorithms & Linear Filtering DFT Computation; Implementation of Discrete Time Systems Kenneth E. Barner Department of Electrical and
More informationDiscrete Time Systems
1 Discrete Time Systems {x[0], x[1], x[2], } H {y[0], y[1], y[2], } Example: y[n] = 2x[n] + 3x[n-1] + 4x[n-2] 2 FIR and IIR Systems FIR: Finite Impulse Response -- non-recursive y[n] = 2x[n] + 3x[n-1]
More 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 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 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 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 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 informationQUESTION 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 informationTopics: Discrete transforms; 1 and 2D Filters, sampling, and scanning
EE 637 Study Solutions - Assignment 3 Topics: Discrete transforms; and D Filters, sampling, and scanning Spring 00 Exam : Problem 3 (sampling Consider a sampling system were the input, s(t = sinc(t, is
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 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 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 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 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 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 information6.003: Signals and Systems. Sampling and Quantization
6.003: Signals and Systems Sampling and Quantization December 1, 2009 Last Time: Sampling and Reconstruction Uniform sampling (sampling interval T ): x[n] = x(nt ) t n Impulse reconstruction: x p (t) =
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 informationECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114.
ECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114. The exam for both sections of ECE 301 is conducted in the same room, but the problems are completely different. Your ID will
More informationFilter structures ELEC-E5410
Filter structures ELEC-E5410 Contents FIR filter basics Ideal impulse responses Polyphase decomposition Fractional delay by polyphase structure Nyquist filters Half-band filters Gibbs phenomenon Discrete-time
More 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 information! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular
Previously ESE 531: Digital Signal Processing Lec 22: April 18, 2017 Fast Fourier Transform (con t)! Circular Convolution " Linear convolution with circular convolution! Discrete Fourier Transform " Linear
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 informationEE 225a Digital Signal Processing Supplementary Material
EE 225A DIGITAL SIGAL PROCESSIG SUPPLEMETARY MATERIAL EE 225a Digital Signal Processing Supplementary Material. Allpass Sequences A sequence h a ( n) ote that this is true iff which in turn is true iff
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 informationFourier Analysis of Signals Using the DFT
Fourier Analysis of Signals Using the DFT ECE 535 Lecture April 29, 23 Overview: Motivation Many applications require analyzing the frequency content of signals Speech processing study resonances of vocal
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 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 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 informationLecture 16: Filter Design: Impulse Invariance and Bilinear Transform
EE58 Digital Signal Processing University of Washington Autumn 2 Dept. of Electrical Engineering Lecture 6: Filter Design: Impulse Invariance and Bilinear Transform Nov 26, 2 Prof: J. Bilmes
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science Discrete-Time Signal Processing Fall 2005
1 MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.341 Discrete-Time Signal Processing Fall 2005 FINAL EXAM Friday, December 16, 2005 Walker (50-340) 1:30pm
More informationBridge between continuous time and discrete time signals
6 Sampling Bridge between continuous time and discrete time signals Sampling theorem complete representation of a continuous time signal by its samples Samplingandreconstruction implementcontinuous timesystems
More informationDigital Signal Processing
COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #24 Tuesday, November 4, 2003 6.8 IIR Filter Design Properties of IIR Filters: IIR filters may be unstable Causal IIR filters with rational system
More 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 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 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 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 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 informationDigital Signal Processing, Homework 2, Spring 2013, Prof. C.D. Chung. n; 0 n N 1, x [n] = N; N n. ) (n N) u [n N], z N 1. x [n] = u [ n 1] + Y (z) =
Digital Signal Processing, Homework, Spring 0, Prof CD Chung (05%) Page 67, Problem Determine the z-transform of the sequence n; 0 n N, x [n] N; N n x [n] n; 0 n N, N; N n nx [n], z d dz X (z) ) nu [n],
More 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 informationCourse and Wavelets and Filter Banks. Filter Banks (contd.): perfect reconstruction; halfband filters and possible factorizations.
Course 18.327 and 1.130 Wavelets and Filter Banks Filter Banks (contd.): perfect reconstruction; halfband filters and possible factorizations. Product Filter Example: Product filter of degree 6 P 0 (z)
More informationQuadrature-Mirror Filter Bank
Quadrature-Mirror Filter Bank In many applications, a discrete-time signal x[n] is split into a number of subband signals { v k [ n]} by means of an analysis filter bank The subband signals are then processed
More 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 informationDiscrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections
Discrete-Time Signals and Systems The z-transform and Its Application Dr. Deepa Kundur University of Toronto Reference: Sections 3. - 3.4 of John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing:
More informationVALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF INFORMATION TECHNOLOGY. Academic Year
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur- 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY Academic Year 2016-2017 QUESTION BANK-ODD SEMESTER NAME OF THE SUBJECT SUBJECT CODE SEMESTER YEAR
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture : Design of Digital IIR Filters (Part I) Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 008 K. E. Barner (Univ.
More 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 informationEE482: Digital Signal Processing Applications
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:30-15:45 CBC C222 Lecture 05 IIR Design 14/03/04 http://www.ee.unlv.edu/~b1morris/ee482/
More informationDetermine the Z transform (including the region of convergence) for each of the following signals:
6.003 Homework 4 Please do the following problems by Wednesday, March 3, 00. your answers: they will NOT be graded. Solutions will be posted. Problems. Z transforms You need not submit Determine the Z
More informationChapter 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 informationV. IIR Digital Filters
Digital Signal Processing 5 March 5, V. IIR Digital Filters (Deleted in 7 Syllabus). (dded in 7 Syllabus). 7 Syllabus: nalog filter approximations Butterworth and Chebyshev, Design of IIR digital filters
More informationDiscrete-Time Signals & Systems
Chapter 2 Discrete-Time Signals & Systems 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 2-1-1 Discrete-Time Signals: Time-Domain Representation (1/10) Signals
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 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 informationLecture 7 - IIR Filters
Lecture 7 - IIR Filters James Barnes (James.Barnes@colostate.edu) Spring 204 Colorado State University Dept of Electrical and Computer Engineering ECE423 / 2 Outline. IIR Filter Representations Difference
More informationTransform analysis of LTI systems Oppenheim and Schafer, Second edition pp For LTI systems we can write
Transform analysis of LTI systems Oppenheim and Schafer, Second edition pp. 4 9. For LTI systems we can write yœn D xœn hœn D X kd xœkhœn Alternatively, this relationship can be expressed in the z-transform
More informationDHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A
DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A Classification of systems : Continuous and Discrete
More 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 informationFilter Design Problem
Filter Design Problem Design of frequency-selective filters usually starts with a specification of their frequency response function. Practical filters have passband and stopband ripples, while exhibiting
More informationLecture 19 IIR Filters
Lecture 19 IIR Filters Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/5/10 1 General IIR Difference Equation IIR system: infinite-impulse response system The most general class
More informationz-transform Chapter 6
z-transform Chapter 6 Dr. Iyad djafar Outline 2 Definition Relation Between z-transform and DTFT Region of Convergence Common z-transform Pairs The Rational z-transform The Inverse z-transform z-transform
More informationSignals, Systems & Inference Alan V. Oppenheim & George C. Verghese c Chapter 2 Solutions
Signals, Systems & Inference Alan V. Oppenheim & George C. Verghese c 2016 Chapter 2 Solutions Note from the authors These solutions represent a preliminary version of the Instructors Solutions Manual
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 informationLet H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )
Review: Poles and Zeros of Fractional Form Let H() = P()/Q() be the system function of a rational form. Let us represent both P() and Q() as polynomials of (not - ) Then Poles: the roots of Q()=0 Zeros:
More informationResponses of Digital Filters Chapter Intended Learning Outcomes:
Responses of Digital Filters Chapter Intended Learning Outcomes: (i) Understanding the relationships between impulse response, frequency response, difference equation and transfer function in characterizing
More information