6.003: Signals and Systems
|
|
- Mabel Barker
- 6 years ago
- Views:
Transcription
1 6.003: Signals and Systems Discrete-Time Frequency Representations November 8,
2 Mid-term Examination #3 Wednesday, November 16, 7:30-9:30pm, No recitations on the day of the exam. Coverage: Lectures 1 18 Recitations 1 16 Homeworks 1 10 Homework 10 will not be collected or graded. Solutions will be posted. Closed book: 3 pages of notes ( inches; front and back). No calculators, computers, cell phones, music players, or other aids. Designed as 1-hour exam; two hours to complete. Review session Monday at 3pm and at open office hours. Prior term midterm exams have been posted on the website. Conflict? Contact before Friday, Nov. 11, 5pm. 2
3 Signal Processing: From CT to DT Signal-processing problems first conceived & addressed in CT: audio radio (noise/static reduction, automatic gain control, etc.) telephone (equalizers, echo-suppression, etc.) hi-fi (bass, treble, loudness, etc.) imaging television (brightness, tint, etc.) photography (image enhancement, gamma) x-rays (noise reduction, contrast enhancement) radar and sonar (noise reduction, object detection) Such problems are increasingly solved with DT signal processing: MP3 JPEG MPEG 3
4 Signal Processing: Acoustical Mechano-acoustic components to optimize frequency response of loudspeakers: e.g., bass-reflex system. driver reflex port 4
5 5 Signal Processing: Acoustico-Mechanical Passive radiator for improved low-frequency preformance. driver passive radiator
6 6 Signal Processing: Electronic Low-cost electronics new ways to overcome frequency limitations. 110 Magnitude (db) Frequency (Hz) Small speakers (4 inch): eight facing wall, one facing listener. Electronic equalizer compensated for limited frequency response.
7 7 Signal Processing Modern audio systems process sounds digitally. x(t) x[n] y[n] A/D DT filter D/A y(t)
8 Signal Processing Modern audio systems process sounds digitally. AV SS(REF) V REFM V REFP V RFILT AV DD AV SS DV DD DV SS AINRP AINRM RINA RINB Voltage Reference Analog Supplies Digital Supplies AINRP Analog Control Register Texas Instruments TAS3004 AINLP AINLM LINA LINB AINRM 24 Bit Stereo ADC AINLP Output Format Control Logic SDOUT0 2 channels 24 bit ADC, 24 bit DAC 48 khz sampling rate ALLPASS INPA GPI5 GPI4 GPI3 GPI2 GPI1 Controller AINLM 24 Bit Stereo DAC VCOM AOUTL AOUTR 100 MIPS $9.63 ($5.20 in bulk) GPI0 CS1 SDA SCL I 2 C Control L+R 32 Bit Audio Signal Processor L+R SDOUT2 SDOUT1 PWR_DN RESET TEST Control L R SDATA Control 32 Bit Audio Signal Processor OSC/CLK Select PLL SDIN1 SDIN2 LRCLK/O SCLK/O IFM/S CLKSEL XTALI/ MCLK XTALO MCLKO CAP_PLL Figure 1 1. TAS3004 Block Diagram 8 Courtesy of Texas Instruments. Used with permission.
9 9 DT Fourier Series and Frequency Response Today: frequency representations for DT signals and systems.
10 10 Review: Complex Geometric Sequences Complex geometric sequences are eigenfunctions of DT LTI systems. n Find response of DT LTI system (h[n]) to input x[n] = z. 0 0 n k n k n y[n] = (h x)[n] = h[k]z = z h[k]z = H(z) z. k= k= Complex geometrics (DT): analogous to complex exponentials (CT) z n h[n] H(z) z n e st h(t) H(s) e st
11 11 Review: Rational System Functions A system described by a linear difference equation with constant coefficients system function that is a ratio of polynomials in z. Example: y[n 2] + 3y[n 1] + 4y[n] = 2x[n 2] + 7x[n 1] + 8x[n] 2z 2 + 7z z + 8z 2 N(z) H(z) = = z 2 + 3z z + 4z2 D(z)
12 DT Vector Diagrams Factor the numerator and denominator of the system function to make poles and zeros explicit. (z 0 q 0 )(z 0 q 1 )(z 0 q 2 ) H(z 0 ) = K (z0 p 0 )(z 0 p 1 )(z 0 p 2 ) z 0 z 0 q 0 z 0 z-plane q 0 q 0 Each factor in the numerator/denominator corresponds to a vector from a zero/pole (here q 0 ) to z 0, the point of interest in the z-plane. Vector diagrams for DT are similar to those for CT. 12
13 DT Vector Diagrams Value of H(z) at z = z 0 can be determined by combining the contributions of the vectors associated with each of the poles and zeros. (z 0 q 0 )(z 0 q 1 )(z 0 q 2 ) H(z 0 ) = K (z0 p 0 )(z 0 p 1 )(z 0 p 2 ) The magnitude is determined by the product of the magnitudes. (z 0 q 0 ) (z 0 q 1 ) (z 0 q 2 ) H(z 0 ) = K (z0 p 0 ) (z 0 p 1 ) (z 0 p 2 ) The angle is determined by the sum of the angles. H(z 0 ) = K + (z 0 q 0 ) + (z 0 q 1 ) + (z 0 p 0 ) (z 0 p 1 ) 13
14 14 DT Frequency Response Response to eternal sinusoids. Let x[n] = cos Ω 0 n (for all time): 1 jω 0 n + e jω 0n 1 n n x[n] = e = z 0 + z jω 0 jω 0 where z0 = e and z 1 = e. The response to a sum is the sum of the responses: 1 n n y[n] = H(z 0 ) z 0 + H(z 1 ) z jω 0 n = H(e jω 0 ) e jω 0n + H(e jω 0 ) e 2
15 15 Conjugate Symmetry For physical systems, the complex conjugate of H(e jω ) is H(e jω ). The system function is the Z transform of the unit-sample response: 0 n H(z) = h[n]z n= where h[n] is a real-valued function of n for physical systems. jω 0 jωn H(e ) = h[n]e n= 0 jω jωn H(e ) = h[n]e H(e jω ) n=
16 16 DT Frequency Response Response to eternal sinusoids. Let x[n] = cos Ω 0 n (for all time), which can be written as 1 ( ) x[n] = e jω 0n + e jω 0n. 2 Then 1 ( ) y[n] = H(e jω 0 )e jω 0n + H(e jω 0 )e jω 0n 2 = Re H(e jω 0 )e jω 0n = Re H(e jω 0 ) e j H(e jω 0 ) e jω 0n jω 0 n+j H(e jω 0 ) = H(e jω 0 ) Re e ( ) y[n] = H(e jω 0 ) cos Ω 0 n + H(e jω 0 )
17 DT Frequency Response The magnitude and phase of the response of a system to an eternal cosine signal is the magnitude and phase of the system function evaluated on the unit circle. cos(ωn) H(z) ( ) H(e jω ) cos Ωn + H(e jω ) H(e jω ) = H(z) z=e jω 17
18 18 Finding Frequency Response with Vector Diagrams H(z) = z q H(e jω ) 1 z p 1 z-plane 1 π 0 π H(e jω ) π/2 π π π/2
19 19 Finding Frequency Response with Vector Diagrams H(z) = z q H(e jω ) 1 z p 1 z-plane 1 π 0 π H(e jω ) π/2 π π π/2
20 20 Finding Frequency Response with Vector Diagrams H(z) = z q H(e jω ) 1 z p 1 z-plane 1 π 0 π H(e jω ) π/2 π π π/2
21 21 Finding Frequency Response with Vector Diagrams H(z) = z q H(e jω ) 1 z p 1 z-plane 1 π 0 π H(e jω ) π/2 π π π/2
22 22 Finding Frequency Response with Vector Diagrams H(z) = z q H(e jω ) 1 z p 1 z-plane 1 π 0 π H(e jω ) π/2 π π π/2
23 23 Finding Frequency Response with Vector Diagrams H(z) = z q H(e jω ) 1 z p 1 z-plane 1 π 0 π H(e jω ) π/2 π π π/2
24 24 Finding Frequency Response with Vector Diagrams H(z) = z q H(e jω ) 1 z p 1 z-plane 1 π 0 π H(e jω ) π/2 π π π/2
25 25 Finding Frequency Response with Vector Diagrams H(z) = z q H(e jω ) 1 z p 1 z-plane 1 π 0 π H(e jω ) π/2 π π π/2
26 26 Finding Frequency Response with Vector Diagrams H(z) = z q H(e jω ) 1 z p 1 z-plane 1 π 0 π H(e jω ) π/2 π π π/2
27 27 Finding Frequency Response with Vector Diagrams H(z) = z q H(e jω ) 1 z p 1 z-plane 1 π 0 π H(e jω ) π/2 π π π/2
28 Comparision of CT and DT Frequency Responses CT frequency response: H(s) on the imaginary axis, i.e., s = jω. DT frequency response: H(z) on the unit circle, i.e., z = e jω. ω s-plane z-plane σ H(jω) H(e jω ) π 0 π
29 DT Periodicity DT frequency responses are periodic functions of Ω, with period 2π. If Ω 2 = Ω 1 + 2πk where k is an integer then H(e jω 2 ) = H(e j(ω 1+2πk) ) = H(e jω 1 e j2πk ) = H(e jω 1 ) jω The periodicity of H(e jω ) results because H(e jω ) is a function of e, which is itself periodic in Ω. Thus DT complex exponentials have many aliases. e jω 2 = e j(ω 1 +2πk) = e jω 1 e j2πk = e jω 1 Because of this aliasing, there is a highest DT frequency: Ω = π. 29
30 Comparision of CT and DT Frequency Responses CT frequency response: H(s) on the imaginary axis, i.e., s = jω. DT frequency response: H(z) on the unit circle, i.e., z = e jω. ω s-plane z-plane σ H(jω) H(e jω ) π 0 π
31 31 Check Yourself Consider 3 CT signals: x 1 (t) = cos(3000t) ; x 2 (t) = cos(4000t) ; x 3 (t) = cos(5000t) Each of these is sampled so that x 1 [n] = x 1 (nt ) ; x 2 [n] = x 2 (nt ) ; x 3 [n] = x 3 (nt ) where T = Which list goes from lowest to highest DT frequency? 0. x 1 [n] x 2 [n] x 3 [n] 1. x 1 [n] x 3 [n] x 2 [n] 2. x 2 [n] x 1 [n] x 3 [n] 3. x 2 [n] x 3 [n] x 1 [n] 4. x 3 [n] x 1 [n] x 2 [n] 5. x 3 [n] x 2 [n] x 1 [n]
32 Check Yourself The discrete signals are x 1 [n] = cos[3n] x 2 [n] = cos[4n] x 3 [n] = cos[5n] and the corresponding discrete frequencies are Ω = 3, 4 and 5, represented below with marking e jω and o marking e jω )
33 33 Check Yourself Ω = 0.25 x[n] = cos(0.25n) n
34 34 Check Yourself Ω = 0.5 x[n] = cos(0.5n) n
35 35 Check Yourself Ω = 1 x[n] = cos(n) n
36 36 Check Yourself Ω = 2 x[n] = cos(2n) n
37 37 Check Yourself Ω = 3 x[n] = cos(3n) n
38 38 Check Yourself Ω = 4 x[n] = cos(4n) = cos(2π 4n) cos(2.283n) n
39 39 Check Yourself Ω = 5 x[n] = cos(5n) = cos(2π 5n) cos(1.283n) n
40 40 Check Yourself Ω = 6 x[n] = cos(6n) = cos(2π 6n) cos(0.283n) n
41 Check Yourself The discrete signals are x 1 [n] = cos[3n] x 2 [n] = cos[4n] x 3 [n] = cos[5n] and the corresponding discrete frequencies are Ω = 3, 4 and 5, represented below with marking e jω and o marking e jω )
42 42 Check Yourself Consider 3 CT signals: x 1 (t) = cos(3000t) ; x 2 (t) = cos(4000t) ; x 3 (t) = cos(5000t) Each of these is sampled so that x 1 [n] = x 1 (nt ) ; x 2 [n] = x 2 (nt ) ; x 3 [n] = x 3 (nt ) where T = Which list goes from lowest to highest DT frequency? 5 0. x 1 [n] x 2 [n] x 3 [n] 1. x 1 [n] x 3 [n] x 2 [n] 2. x 2 [n] x 1 [n] x 3 [n] 3. x 2 [n] x 3 [n] x 1 [n] 4. x 3 [n] x 1 [n] x 2 [n] 5. x 3 [n] x 2 [n] x 1 [n]
43 Check Yourself What kind of filtering corresponds to the following? z-plane 1. high pass 2. low pass 3. band pass 4. band stop (notch) 5. none of above 43
44 Check Yourself What kind of filtering corresponds to the following? 1 z-plane 1. high pass 2. low pass 3. band pass 4. band stop (notch) 5. none of above 44
45 45 DT Fourier Series DT Fourier series represent DT signals in terms of the amplitudes and phases of harmonic components. 0 jkω 0 n x[n] = a k e The period N of all harmonic components is the same (as in CT).
46 46 DT Fourier Series There are (only) N distinct complex exponentials with period N. (There were an infinite number in CT!) jωn If y[n] = e is periodic in N then jωn jω(n+n) jωn jωn y[n] = e = y[n + N] = e = e e jωn and e must be 1, and e jω must be one of the N th roots of 1. Example: N = 8 z-plane
47 DT Fourier Series There are N distinct complex exponentials with period N. These can be combined via Fourier series to produce periodic time signals with N independent samples. Example: periodic in N=3 n 3 samples repeated in time 3 complex exponentials Example: periodic in N=4 n 4 samples repeated in time 4 complex exponentials 47
48 48 DT Fourier Series DT Fourier series represent DT signals in terms of the amplitudes and phases of harmonic components. N 0 1 jkω 0 n 2π x[n] = x[n + N] = a k e ; Ω 0 = N k=0 N equations (one for each point in time n) in N unknowns (a k ). Example: N = 4 2π 2π 2π 2π x[0] j 0 0 j 1 0 j 2 0 j 3 0 e N e N e N e N a 0 2 π π N π 2 1 2π 3 1 x[1] j j j j = e N e N e e N a 1 x[2] j 2π 0 2 j 2π 1 2 j 2π 2 2 j 2π 3 2 e N e N e N e N a 2 2π 0 3 2π 1 3 2π 2 3 2π x[3] 3 3 e j N e j N e j N e j N a 3
49 49 DT Fourier Series DT Fourier series represent DT signals in terms of the amplitudes and phases of harmonic components. N 0 1 jkω 0 n 2π x[n] = x[n + N] = a k e ; Ω 0 = N k=0 N equations (one for each point in time n) in N unknowns (a k ). Example: N = 4 x[0] a 0 x[1] 1 j 1 j = a 1 x[2] a 2 x[3] 1 j 1 j a 3
50 50 Orthogonality DT harmonics are orthogonal to each other (as were CT harmonics). N 0 1 N 0 1 jω 0 kn jω 0 ln jω 0 (k l)n e e = e n=0 n=0 N j 2π = (k l)n 1 e jω 0 (k l)n 1 e N jω 0 (k l) 2π 1 e j (k l) 1 e N ; k = l = = 0 ; k = l = Nδ[k l]
51 51 Sifting Use orthogonality property of harmonics to sift out FS coefficients. N 0 1 jkω 0 n Assume x[n] = a k e k=0 Multiply both sides by the complex conjugate of the l th harmonic, and sum over time. N 0 1 N 0 1 N 0 1 N 0 1 N 0 1 jlω 0 n jkω 0 n jlω 0 n jkω 0 n jlω 0 n x[n]e = a k e e = a k e e n=0 n=0 k=0 k=0 n=0 N 0 1 = a k Nδ[k l] = Na l k=0 a k = 1 N 0 1 jkω 0 n x[n]e N n=0
52 52 DT Fourier Series Since both x[n] and a k are periodic in N, the sums can be taken over any N successive indices. Notation. If f[n] is periodic in N, then 0 1 0N N+1 0 f[n] = f[n] = f[n] = = 0 f[n] n=0 n=1 n=2 n=<n> DT Fourier Series 1 0 jkω 0 n 2π a k = a k+n = x[n]e ; Ω 0 = ( analysis equation) N N n=<n> 0 jkω 0 n x[n]= x[n + N] = a k e ( synthesis equation) k=<n>
53 These matrices are inverses of each other. 53 DT Fourier Series DT Fourier series have simple matrix interpretations. 0 0 jk 2 π 0 jkω 0 n x[n] = x[n + 4] = a = 4 n = a k j kn k e a k e k=<4> k=<4> k=<4> x[0] a 0 x[1] 1 j 1 j = a 1 x[2] a 2 x[3] 1 j 1 j a π 1 0 jkω 0 n jk n x[n]e = = x[n]j kn ak = a k+4 = e N n=<4> n=<4> n=<4> a x[0] a j 1 j x[1] = a x[2] a 3 1 j 1 j x[3]
54 Discrete-Time Frequency Representations Similarities and differences between CT and DT. DT frequency response vector diagrams (similar to CT) frequency response on unit circle in z-plane (jω axis in CT) DT Fourier series represent signal as sum of harmonics (similar to CT) finite number of periodic harmonics (unlike CT) finite sum (unlike CT) The finite length of DT Fourier series make them especially useful for signal processing! (more on this next time) 54
55 MIT OpenCourseWare Signals and Systems Fall 2011 For information about citing these materials or our Terms of Use, visit:
6.003: Signals and Systems Lecture 18 April 13, 2010
6.003: Signals and Systems Lecture 8 April 3, 200 6.003: Signals and Systems Discrete-Time Frequency Representations Signals and/or Systems Two perspectives: feedback and control (focus on systems) X +
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 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 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 information6.003: Signals and Systems
6.003: Signals and Systems CT Feedback and Control October 20, 2011 1 Mid-term Examination #2 Wednesday, October 26, 7:30-9:30pm, No recitations on the day of the exam. Coverage: Lectures 1 12 Recitations
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 informationThis homework will not be collected or graded. It is intended to help you practice for the final exam. Solutions will be posted.
6.003 Homework #14 This homework will not be collected or graded. It is intended to help you practice for the final exam. Solutions will be posted. Problems 1. Neural signals The following figure illustrates
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 informationE : Lecture 1 Introduction
E85.2607: Lecture 1 Introduction 1 Administrivia 2 DSP review 3 Fun with Matlab E85.2607: Lecture 1 Introduction 2010-01-21 1 / 24 Course overview Advanced Digital Signal Theory Design, analysis, and implementation
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 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 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 information2.161 Signal Processing: Continuous and Discrete Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Massachusetts
More information3.2 Complex Sinusoids and Frequency Response of LTI Systems
3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex
More informationSignals and Systems. Lecture 11 Wednesday 22 nd November 2017 DR TANIA STATHAKI
Signals and Systems Lecture 11 Wednesday 22 nd November 2017 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON Effect on poles and zeros on frequency response
More 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 informationMassachusetts Institute of Technology
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.011: Introduction to Communication, Control and Signal Processing QUIZ 1, March 16, 2010 ANSWER BOOKLET
More informationProblem Value
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM DATE: 30-Apr-04 COURSE: ECE-2025 NAME: GT #: LAST, FIRST Recitation Section: Circle the date & time when your Recitation
More informationFourier Series Representation of
Fourier Series Representation of Periodic Signals Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Outline The response of LIT system
More informationFinal Exam of ECE301, Section 1 (Prof. Chih-Chun Wang) 1 3pm, Friday, December 13, 2016, EE 129.
Final Exam of ECE301, Section 1 (Prof. Chih-Chun Wang) 1 3pm, Friday, December 13, 2016, EE 129. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, and
More informationHomework: 4.50 & 4.51 of the attachment Tutorial Problems: 7.41, 7.44, 7.47, Signals & Systems Sampling P1
Homework: 4.50 & 4.51 of the attachment Tutorial Problems: 7.41, 7.44, 7.47, 7.49 Signals & Systems Sampling P1 Undersampling & Aliasing Undersampling: insufficient sampling frequency ω s < 2ω M Perfect
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 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. 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 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 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 informationProblem Value
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM DATE: 30-Apr-04 COURSE: ECE-2025 NAME: GT #: LAST, FIRST Recitation Section: Circle the date & time when your Recitation
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 information6.003 Homework #10 Solutions
6.3 Homework # Solutions Problems. DT Fourier Series Determine the Fourier Series coefficients for each of the following DT signals, which are periodic in N = 8. x [n] / n x [n] n x 3 [n] n x 4 [n] / n
More informationChapter 2: Problem Solutions
Chapter 2: Problem Solutions Discrete Time Processing of Continuous Time Signals Sampling à Problem 2.1. Problem: Consider a sinusoidal signal and let us sample it at a frequency F s 2kHz. xt 3cos1000t
More information6.003: Signals and Systems
6.003: Signals and Sysems Relaions among Fourier Represenaions November 5, 20 Mid-erm Examinaion #3 Wednesday, November 6, 7:30-9:30pm, No reciaions on he day of he exam. Coverage: Lecures 8 Reciaions
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 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 informationCITY UNIVERSITY LONDON. MSc in Information Engineering DIGITAL SIGNAL PROCESSING EPM746
No: CITY UNIVERSITY LONDON MSc in Information Engineering DIGITAL SIGNAL PROCESSING EPM746 Date: 19 May 2004 Time: 09:00-11:00 Attempt Three out of FIVE questions, at least One question from PART B PART
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 information6.02 Practice Problems: Frequency Response of LTI Systems & Filters
1 of 12 6.02 Practice Problems: Frequency Response of LTI Systems & Filters Note: In these problems, we sometimes refer to H(Ω) as H(e jω ). The reason is that in some previous terms we used the latter
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 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 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 informationTopic 3: Fourier Series (FS)
ELEC264: Signals And Systems Topic 3: Fourier Series (FS) o o o o Introduction to frequency analysis of signals CT FS Fourier series of CT periodic signals Signal Symmetry and CT Fourier Series Properties
More informationNotice the minus sign on the adder: it indicates that the lower input is subtracted rather than added.
6.003 Homework Due at the beginning of recitation on Wednesday, February 17, 010. Problems 1. Black s Equation Consider the general form of a feedback problem: + F G Notice the minus sign on the adder:
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 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 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 informationEECE 2510 Circuits and Signals, Biomedical Applications Final Exam Section 3. Name:
EECE 2510 Circuits and Signals, Biomedical Applications Final Exam Section 3 Instructions: Closed book, closed notes; Computers and cell phones are not allowed Scientific calculators are allowed Complete
More informationDEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010
[E2.5] IMPERIAL COLLEGE LONDON DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010 EEE/ISE PART II MEng. BEng and ACGI SIGNALS AND LINEAR SYSTEMS Time allowed: 2:00 hours There are FOUR
More 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 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 information6.003: Signals and Systems. CT Fourier Transform
6.003: Signals and Systems CT Fourier Transform April 8, 200 CT Fourier Transform Representing signals by their frequency content. X(jω)= x(t)e jωt dt ( analysis equation) x(t)= 2π X(jω)e jωt dω ( synthesis
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 information6.003: Signals and Systems
6.003: Signals and Systems Discrete-Time Systems September 13, 2011 1 Homework Doing the homework is essential to understanding the content. Weekly Homework Assigments tutor (exam-type) problems: answers
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 information6.003: Signals and Systems
6.003: Signals and Systems Z Transform September 22, 2011 1 2 Concept Map: Discrete-Time Systems Multiple representations of DT systems. Delay R Block Diagram System Functional X + + Y Y Delay Delay X
More informationPoles and Zeros in z-plane
M58 Mixed Signal Processors page of 6 Poles and Zeros in z-plane z-plane Response of discrete-time system (i.e. digital filter at a particular frequency ω is determined by the distance between its poles
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 informationHomework 8 Solutions
EE264 Dec 3, 2004 Fall 04 05 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
More informationLECTURE NOTES IN AUDIO ANALYSIS: PITCH ESTIMATION FOR DUMMIES
LECTURE NOTES IN AUDIO ANALYSIS: PITCH ESTIMATION FOR DUMMIES Abstract March, 3 Mads Græsbøll Christensen Audio Analysis Lab, AD:MT Aalborg University This document contains a brief introduction to pitch
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 informationA3. Frequency Representation of Continuous Time and Discrete Time Signals
A3. Frequency Representation of Continuous Time and Discrete Time Signals Objectives Define the magnitude and phase plots of continuous time sinusoidal signals Extend the magnitude and phase plots to discrete
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 informationNew Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam
New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Name: Solve problems 1 3 and two from problems 4 7. Circle below which two of problems 4 7 you
More 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 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 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 informationThe Laplace Transform
The Laplace Transform Syllabus ECE 316, Spring 2015 Final Grades Homework (6 problems per week): 25% Exams (midterm and final): 50% (25:25) Random Quiz: 25% Textbook M. Roberts, Signals and Systems, 2nd
More informationECGR4124 Digital Signal Processing Midterm Spring 2010
ECGR4124 Digital Signal Processing Midterm Spring 2010 Name: LAST 4 DIGITS of Student Number: Do NOT begin until told to do so Make sure that you have all pages before starting Open book, 1 sheet front/back
More informationLecture 27 Frequency Response 2
Lecture 27 Frequency Response 2 Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/6/12 1 Application of Ideal Filters Suppose we can generate a square wave with a fundamental period
More informationLecture 13: Discrete Time Fourier Transform (DTFT)
Lecture 13: Discrete Time Fourier Transform (DTFT) ECE 401: Signal and Image Analysis University of Illinois 3/9/2017 1 Sampled Systems Review 2 DTFT and Convolution 3 Inverse DTFT 4 Ideal Lowpass Filter
More information6.003 Signal Processing
6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal
More informationSignals, Instruments, and Systems W5. Introduction to Signal Processing Sampling, Reconstruction, and Filters
Signals, Instruments, and Systems W5 Introduction to Signal Processing Sampling, Reconstruction, and Filters Acknowledgments Recapitulation of Key Concepts from the Last Lecture Dirac delta function (
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 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 informationCHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME
CHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME Shri Mata Vaishno Devi University, (SMVDU), 2013 Page 13 CHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME When characterizing or modeling a random variable, estimates
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 informationCast of Characters. Some Symbols, Functions, and Variables Used in the Book
Page 1 of 6 Cast of Characters Some s, Functions, and Variables Used in the Book Digital Signal Processing and the Microcontroller by Dale Grover and John R. Deller ISBN 0-13-081348-6 Prentice Hall, 1998
More information6.003 Signal Processing
6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal
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 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 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 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 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 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 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 informationThe Z transform (2) 1
The Z transform (2) 1 Today Properties of the region of convergence (3.2) Read examples 3.7, 3.8 Announcements: ELEC 310 FINAL EXAM: April 14 2010, 14:00 pm ECS 123 Assignment 2 due tomorrow by 4:00 pm
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 informationHomework 3 Solutions
EECS Signals & Systems University of California, Berkeley: Fall 7 Ramchandran September, 7 Homework 3 Solutions (Send your grades to ee.gsi@gmail.com. Check the course website for details) Review Problem
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 informationChapter 7: The z-transform
Chapter 7: The -Transform ECE352 1 The -Transform - definition Continuous-time systems: e st H(s) y(t) = e st H(s) e st is an eigenfunction of the LTI system h(t), and H(s) is the corresponding eigenvalue.
More informationDetailed Solutions to Exercises
Detailed Solutions to Exercises Digital Signal Processing Mikael Swartling Nedelko Grbic rev. 205 Department of Electrical and Information Technology Lund University Detailed solution to problem E3.4 A
More informationMassachusetts Institute of Technology
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.11: Introduction to Communication, Control and Signal Processing QUIZ 1, March 16, 21 QUESTION BOOKLET
More informationDesign of IIR filters
Design of IIR filters Standard methods of design of digital infinite impulse response (IIR) filters usually consist of three steps, namely: 1 design of a continuous-time (CT) prototype low-pass filter;
More informationChirp Transform for FFT
Chirp Transform for FFT Since the FFT is an implementation of the DFT, it provides a frequency resolution of 2π/N, where N is the length of the input sequence. If this resolution is not sufficient in a
More informationJ. McNames Portland State University ECE 223 DT Fourier Series Ver
Overview of DT Fourier Series Topics Orthogonality of DT exponential harmonics DT Fourier Series as a Design Task Picking the frequencies Picking the range Finding the coefficients Example J. McNames Portland
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 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 informationECE 3620: Laplace Transforms: Chapter 3:
ECE 3620: Laplace Transforms: Chapter 3: 3.1-3.4 Prof. K. Chandra ECE, UMASS Lowell September 21, 2016 1 Analysis of LTI Systems in the Frequency Domain Thus far we have understood the relationship between
More informationDiscrete Time Systems
Discrete Time Systems Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz 1 LTI systems In this course, we work only with linear and time-invariant systems. We talked about
More 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 information