Fourier series for continuous and discrete time signals
|
|
- Aron Chase
- 5 years ago
- Views:
Transcription
1 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 of the system is equal with the input multiplied with a value called the frequency response for the system. Mathematically, the previous sentence can expressed as follows:. in continuous time: We know h(t the impulse response of the system. We give the system the input signal x(t e jωt. We want to compute the output y(t. y(t h(t x(t, the convolution H(jω h(τx(t τdτ h(τe jω(t τ dτ h(τe jωt jωτ dτ h(τe jωt e jωτ dτ e jωt h(τe jωτ dτ e jωt H(jω x(th(jω h(τe jωτ dτ H(jω represents the frequency response of the system.. in discrete time: We know h[n] the impulse response of the system. We give the system the input signal x[n] e jωn. We want to compute the output y[n].
2 Fourier series for continuous and discrete time signals y[n] h[n] x[n], the convolution h[k]x[n k] k k k k h[k]e jω(n k h[k]e jωn jωk h[k]e jωn e jωk e jωn h[k]e jωk k e jωn H(e jω x[n]h(e jω H(e jω h[k]e jωk k H(e jω represents the frequency response of the system. Now lets add the fact that our system h(t is LTI. Let x(t a e jωt + a e jω3t + a 3 e jωt. The output will be the sum of the outputs for each of the complex exponentials. We can express the input signal x(t as a sum of 3 signals x (t, x (t and x 3 (t. x(t a e jωt + a e jω3t + a 3 e jωt x (t a e jωt x (t a e jω3t x 3 (t a 3 e jωt We can compute the output y(t taking into account that the system is LTI. y(t h(t x(t y(t h(t x (t + h(t x (t + h(t x 3 (t, h(t is an LTI system y(t y (t + y (t + y 3 (t
3 Fourier series for continuous and discrete time signals 3 The output signal y(t is going to be equal with the sum of y (t, y (t, y 3 (t. y (t h(t x (t, x (t is a complex exponential x (th(jω y (t h(t x (t, x (t is a complex exponential x (th(j3ω y 3 (t h(t x 3 (t, x 3 (t is a complex exponential x 3 (th(jω y(t y (t + y (t + y 3 (t x (th(jω + x (th(j3ω + x 3 (th(jω As you can see if we have complex exponentials as inputs the convolution can be simplified. You just have to multiply the input with the frequency response (which you still have to compute. Wait!!! Not all signals are complex exponentials, i.e. x[n] ( n u[n] is not a complex exponential. Oops. Fourier came up with a method of expressing signals as a linear combination of complex exponentials. So far in class we have tackled Fourier series for continuous time and discrete time, where the signal is periodic. A signal is periodic:. in continuous time: x(t is periodic if there exists a number T > such that x(t + T x(t. T is called the fundamental period and represents the smallest number greater than for which x(t + T x(t.. in discrete time: x[n] is periodic if there exists a integer number N > such that x[n + N] x[n]. N is called the fundamental period and represents the smallest number greater than for which x[n + N ] x[n]. In the next couple of pages we will see some examples for computing the Fourier series of continuous and discrete time signals.
4 4 Fourier series for continuous and discrete time signals Fourier Series for continuous time periodic signals The signal x(t is periodic with period T. The fundamental period is T and the fundamental frequency is ω o T. The signal x(t will be expressed as a linear combination of complex exponentials (harmonics, there are an infinite number of harmonics for the continuous case. This is the synthesis equation: x(t k X[k]e jkω t k jk t T X[k]e The coefficients X[k] are called the frequency domain representations of the signal x(t. This is the analysis equation: X[k] x(te jkωt dt jk T x(te t dt T T t<t > t<t >
5 Fourier series for continuous and discrete time signals 5. Problem You are given given the following signal. Compute the Fourier series for the signal. x(t cos(πt + 5 Solution: At the very beginning you have to determine the fundamental period of the signal T and the fundamental frequency ω. For x(t cos(πt + 5, T and w π. Method : We need to express the signal x(t as a linear combination of complex exponetials. In order to do that, we need to determine the coefficients X[k]. Therefore we will use the analysis equation. X[k] T t<t > x(te jkω t dt T t<t > jk T x(te t dt X[k] 4 x(te jkω t dt cos(πt + 5 e jkω t dt (ej(πt+ ( e j(πt+ 5 e jkωt dt + 4 ( e j ( e j 5 ( e j e j(πt+ 5 e jkω t dt e j(πt kω t dt + e j 5 e j(πt kπt dt + e j 5 e j(π kπt dt + e j 5 e j(πt+ 5 e jkωt dt e j(πt+kωt dt e j(πt+kπt dt e j(π+kπt dt
6 6 Fourier series for continuous and discrete time signals (a if k X[] 4 e jt dt (b if k 4 4 X[] 4 X[ ] 4 e jt dt ( e j 5 e jt dt + e j 5 ( e j 5 dt + e j 5 ( e j 5 + e j 5 e jt dt j cos(tdt j (e j 5 + e j 5 ej X[ ] 4 ( e j 5 ( e j 5 ( e j 5 + j cos(tdt + j e jt dt + e j 5 e jt dt + e j 5 (e j 5 + e j 5 e j 5 (c if k and k X[k] 4 4 e jt dt e jt dt sin(tdt, integration of sin and cos over periods e jt dt + e j 5 ( e j 5 ( e j 5 e jt dt dt sin(tdt, integration of sin and cos over periods e j(π kπt dt + e j 5 e jπ(k t dt + e j 5 e j(π+kπt dt e jπ(k+t dt
7 Fourier series for continuous and discrete time signals 7 f (t e jπ(k t f (t + e jπ(k (t+ e jπ(k t jπ(k e jπ(k t f (t e jπ(k+t f (t + e jπ(k+(t+ e jπ(k t dt e jπ(k+t jπ(k+ e jπ(k+t e jπ(k+t dt This implies that for k and k, X[k]. Method : The second method is by inspection. We want to compute the FS of the signal. We start from the signal and go backwards to the complex exponentials. x(t cos(πt + 5 (e j(πt+ 5 + e j(πt+ 5 ejπt e j 5 + e jπt e j 5 e j 5 e jπt + ej 5 e jπt Now we use the synthesis equation and pattern match. x(t k X[k]e jkπt x(t k X[k]e jkω t k jk t T X[k]e... + X[ ]e jπt + X[ ]e jπt + X[]e jπt + X[]e jπt + X[]e jt +... x(t e j 5 e jπt + ej 5 e jπt
8 8 Fourier series for continuous and discrete time signals From this we can see that X[ ] e j 5 and X[] ej 5. The rest are. Statement If the signal is a sin, cos or a linear combination of sin and/or cos then you can use the second method where you decompose the sin and the cos as complex exponentials. It may scrape off a lot off minutes at exams :.
9 Fourier series for continuous and discrete time signals 9. Problem Compute the Fourier series for the following signals. (a (b Solution: x(t cos(πt + sin(πt x(t cos(πt + sin(t (a At the very beginning you have to determine the fundamental period of the signal T and the fundamental frequency ω. For x(t cos(πt + sin(πt, T and w π. x(t cos(πt + sin(πt ( e jπt + e jπt + ( e jπt e jπt j ( e jπt + e jπt j ( e jπt e jπt ( jejπt + ( + je jπt ( + je jπt + ( jejπt Now we use the synthesis equation and pattern match. x(t k X[k]e jkω t k jk t T X[k]e x(t k X[k]e jkπt... + X[ ]e jπt + X[ ]e jπt + X[]e jπt + X[]e jπt + X[]e jt +... x(t ( + je jπt + ( jejπt From this we can see that X[ ] ( + j and X[] ( j. The rest are. This is a short solution. Think about the other method where you use integration.
10 Fourier series for continuous and discrete time signals (b At the very beginning you have to determine the fundamental period of the signal T and the fundamental frequency ω. For x(t cos(πt + sin(t, T and w π. x(t cos(πt + sin(t ( e jπt + e jπt + ( e jt e jt j ( e jπt + e jπt j ( e jt e jt j e jt + e jπt + ejπt j ejt Now we use the synthesis equation and pattern match. x(t k X[k]e jkω t k jk t T X[k]e x(t X[k]e jkπt k... + X[ ]e jπt + X[ ]e jπt + X[]e jπt + X[]e jπt + X[]e jt +... x(t j e jt + e jπt + ejπt j ejt From this we can see that X[ ] j, X[ ], X[] and X[] j. The rest are. This is a short solution. Think about the other method where you use integration.
11 Fourier series for continuous and discrete time signals 3. Problem 3 You are given the following continuous time signal. x(t δ(t 3k k x(t t Compute the FS for this signal. Solution: In this case we cannot apply the inspection method. The signal is not a sin, cos or linear combination of sin and/or cos. We have to apply the first method where we make use of the analysis equation to compute the coefficients. X[k] T t<t > x(te jkω t dt T t<t > jk T x(te t dt First we have to determine the fundamental period and the fundamental frequency. The fundamental period T 3 and the fundamental frequency is ω 3. X[k] e jk 3 δ(t e jk 3 t dt, use the sifting property of the δ function X[k] 3 X[k] k 3
12 Fourier series for continuous and discrete time signals 4. Problem 4 You are given the following continuous time signal. x(t t Compute the FS for this signal. Solution: In this case we cannot apply the inspection method. The signal is not a sin, cos or linear combination of sin and/or cos. We have to apply the first method where we make use of the analysis equation to compute the coefficients. X[k] T t<t > x(te jkω t dt T t<t > jk T x(te t dt First we have to determine the fundamental period and the fundamental frequency. The fundamental period T 4 and the fundamental frequency is ω π. 4 X[k] x(te j π kt dt 4 ( 4 x(te j π kt dt + x(te j π kt dt 4 ( 4 e j π kt dt e j π kt dt 4 e j π kt dt e j π kt j π k e j π k j π k
13 Fourier series for continuous and discrete time signals 3 4 e jπk j πk, e jπk cos(kπ j sin(kπ and k Z ( k j π k ( k j π k e j π kt dt e j π kt j π k 4 e j π k4 e j π k j π k e jk e jπk j π k e jπk j π k e jπk j πk, e jπk cos(kπ j sin(kπ and k Z ( k j πk X[k] ( ( k 4 j πk ( k j πk ( k ( k + 4j π k ( k jπk ( k jπk
14 4 Fourier series for continuous and discrete time signals 5. Problem 5 You are given the following continuous time signal. x(t t Compute the FS for this signal. Solution: In this case we cannot apply the inspection method. The signal is not a sin, cos or linear combination of sin and/or cos. We have to apply the first method where we make use of the analysis equation to compute the coefficients. X[k] T t<t > x(te jkω t dt T t<t > jk T x(te t dt First we have to determine the fundamental period and the fundamental frequency. The fundamental period T and the fundamental frequency is ω π. X[k] e jπkt dt e jπkt jπk e jπk jπk x(te jπkt dt ( te jπkt dt e jπkt dt te jπkt dt e jπk, e jπk cos(kπ j sin(kπ and k Z jπk ( k jπk
15 Fourier series for continuous and discrete time signals 5 Integration by parts. te jπkt dt integration by parts Let f(t and g(t to functions. We want to compute a b f(tg (tdt. We know that: This implies: (f(tg(t f (tg(t + f(tg (t f(tg (t (f(tg(t f (tg(t a b f(tg (tdt a b a b ((f(tg(t dt f (tg(t dt (f(tg(t dt f(tg(t a b a Coming back to our problem. We want to compute: b a b f (tg(tdt f (tg(tdt te jπkt dt f(t t f (t g (t e jπkt g(t e jπkt jπk te jπkt dt t e jπkt jπk e jπk jπk + jπk e jπkt jπk dt e jπkt dt e jπk jπk + e jπk, e jπk cos(kπ j sin(kπ and k Z jπk jπk ( k jπk + ( k jπk jπk ( k j πk ( k π k
16 6 Fourier series for continuous and discrete time signals ( ( k ( k j πk X[k] jπk ( j ( k j ( k j jπk πk ( j + ( k j ( k j jπk πk ( j πk + ( k j ( k j πk πk ( jπk π k + ( k π k jπk + ( k k + ( k π k + ( k π k + ( k π k + ( k π k
17 Fourier series for continuous and discrete time signals 7 Discrete Time Fourier Series for discrete time periodic signals The signal x[n] is periodic with period N. The fundamental period is N and the fundamental frequency is Ω o N. The signal x[n] will be expressed as a linear combination of complex exponentials (harmonics, in this case the number of harmonics is finite and equal with N. This is the synthesis equation: x[n] k<n > X[k]e jkω n k<n> jk n N X[k]e The coefficients X[k] are called the frequency domain representations of the signal x[n]. This is the analysis equation: X[k] N n<n > x[n]e jkω n N n<n > jk n N x[n]e We know that e jkω n is periodic N for the variable n. e jkω (n+n e jkω n e jkω N e jkωn jk N N e e jkωn jk N N e e jkω n e jk e jkω n e jkω n x[n] x[n + N ] k<n > k<n > k<n > x[n] X[k]e jkω n X[k]e jkω (n+n X[k]e jkω n This means that the signal x[n] is periodic with period N, which we already know.
18 8 Fourier series for continuous and discrete time signals We know that e jkω n is periodic N for the variable k. e j(k+n Ω n e jkω n e jn Ω n e jkω n e jn N n e jkω n e jn e jkω n e jkω n X[k] N X[k + N ] N n<n > n<n > N X[k] n<n > x[n]e jkω n x[n]e j(k+n Ω n x[n]e jkω n This means that the frequency representation X[k] is periodic with period N. x[n] is periodic with fundamental period N. Also X[k] is periodic with fundamental period N. That s why the number of harmonics is finite. Moreover, for e jkω n or e jkω n we can add or subtract to the phase n, without modifying the result. This will be useful in the inspection method for computing the DTFS. We will see it in action in a couple of minutes. e jkω n+n e jkω n e jn e jkω n e jkωn+n jk n+n N e e j( k N +n e j N k n N e jkωn e j N k n N e jkω n n e jkω n e jn e jkω n e jkωn n jk n n N e e j( k N +n e j k+n n N e jkωn e j k+n n N
19 Fourier series for continuous and discrete time signals 9 e jkω n+n e jkω n e jn e jkω n e jkωn+n jk n+n N e e j( k N +n e j k+n n N e jkωn e j k+n n N e jkω n n e jkω n e jn e jkω n e jkωn n jk n n N e e j( k N +n e j N k n N e jkωn e j N k n N
20 Fourier series for continuous and discrete time signals. Problem Compute the Discrete Time Fourier Series for the following signals. Solution: x[n] cos( π n + sin(π n At the very beginning you have to determine the fundamental period of the signal T and the fundamental frequency Ω. For x[n] cos( π n + sin( π n, N 4 and Ω π. x[n] cos( π n + sin(π n ( e j π n + e j π n + ( e j π n e j π n j ( e j π n + e j π n j ( e j π n e j π n ( π jej n + ( + π je j n ( + π je j n + ( π jej n Now we use the synthesis equation and pattern match. x[n] X[k]e jkωn X[k]e jk π n k<n > k<n> x[n] N k X[k]e jkω n 3 X[k]e jk π n k X[]e j π n + X[]e j π n + X[]e j π n + X[3]e j3 π n x[n] ( + je j π n + ( jej π n We do not have a match for e j π n. However, we can add jn at the phase and get something that we can match.
21 Fourier series for continuous and discrete time signals e j π n e j π n+n e j3 π n x[n] 3 X[k]e jk π n k X[]e j π n + X[]e j π n + X[]e j π n + X[3]e j3 π n x[n] ( + π jej3 n + ( π jej n From this we can see that X[] ( j and X[3] ( + j. The rest are. This is a short solution. Similar no the continuous case, one could have solved it using the analysis equation. Think how could one use that method no solve the problem. Would it be faster?
22 Fourier series for continuous and discrete time signals. Problem 3 You are given the following discrete time signal, where M < M and M is an even number. x[n] M M M M n Compute the DTFS for this signal. Solution: In this case we cannot apply the inspection method. The signal is not a sin, cos or linear combination of sin and/or cos. We have to apply the first method where we make use of the analysis equation to compute the coefficients. X[k] N n<n > x[n]e jkω n N n<n > jk n N x[n]e First we have to determine the fundamental period and the fundamental frequency. The fundamental period N M + and the fundamental frequency is ω. M+ X[k] M + M + M m M M M M + m M e jk n M M + n x[m]e jkω m M+ m, variable change n m + M m n M e jk M+ (n M e jk M+ n jk e M+ M
23 Fourier series for continuous and discrete time signals 3 M + ejk M + ejk M + ejk M + ejk M + M + M + M M+ M M+ M n e jk M+ n, the sum is a geometric progression e jk M+ (M + M+ M e jk M+ M+ (M M + jk e M+ M + M jk + M jk + (e M+ e M+ e jk π M+ (e jk + (e e jkπ M + M+ e jkπ M + M+ e jk π M+ e jk j sin(kπ M + j sin(k sin(kπ M + sin(k M+ π M+ M+ π M+ π M+ jk M+ (e jk π When k use l Hospital to get the value of X[]. π M+ e jk π M+ M + M jk + e M+ M+ e jk π M+ X[k] M + sin(kπ M + sin(k M+ π M+ Lets plot the signal x[n] and X[k] for M and M o {, 3, 6, 9}. (a M x[n] n
24 4 Fourier series for continuous and discrete time signals X[k] k (b M 3 x[n] n X[k] k (c M 6
25 Fourier series for continuous and discrete time signals 5 x[n] n X[k] k (d M 9 x[n] n
26 6 Fourier series for continuous and discrete time signals X[k] k
Homework 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 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 informationSignals & Systems. Lecture 4 Fourier Series Properties & Discrete-Time Fourier Series. Alp Ertürk
Signals & Systems Lecture 4 Fourier Series Properties & Discrete-Time Fourier Series Alp Ertürk alp.erturk@kocaeli.edu.tr Fourier Series Representation of Continuous-Time Periodic Signals Synthesis equation:
More informationCH.4 Continuous-Time Fourier Series
CH.4 Continuous-Time Fourier Series First step to Fourier analysis. My mathematical model is killing me! The difference between mathematicians and engineers is mathematicians develop mathematical tools
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 informationECE 301: Signals and Systems Homework Assignment #3
ECE 31: Signals and Systems Homework Assignment #3 Due on October 14, 215 Professor: Aly El Gamal A: Xianglun Mao 1 Aly El Gamal ECE 31: Signals and Systems Homework Assignment #3 Problem 1 Problem 1 Consider
More informationHomework 5 EE235, Summer 2013 Solution
Homework 5 EE235, Summer 23 Solution. Fourier Series. Determine w and the non-zero Fourier series coefficients for the following functions: (a f(t 2 cos(3πt + sin(πt + π 3 w π f(t e j3πt + e j3πt + j2
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 informationHomework 6 EE235, Spring 2011
Homework 6 EE235, Spring 211 1. Fourier Series. Determine w and the non-zero Fourier series coefficients for the following functions: (a 2 cos(3πt + sin(1πt + π 3 w π e j3πt + e j3πt + 1 j2 [ej(1πt+ π
More informationSignals & Systems. Lecture 5 Continuous-Time Fourier Transform. Alp Ertürk
Signals & Systems Lecture 5 Continuous-Time Fourier Transform Alp Ertürk alp.erturk@kocaeli.edu.tr Fourier Series Representation of Continuous-Time Periodic Signals Synthesis equation: x t = a k e jkω
More informationChapter 6: Applications of Fourier Representation Houshou Chen
Chapter 6: Applications of Fourier Representation Houshou Chen Dept. of Electrical Engineering, National Chung Hsing University E-mail: houshou@ee.nchu.edu.tw H.S. Chen Chapter6: Applications of Fourier
More 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 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 information3 Fourier Series Representation of Periodic Signals
65 66 3 Fourier Series Representation of Periodic Signals Fourier (or frequency domain) analysis constitutes a tool of great usefulness Accomplishes decomposition of broad classes of signals using complex
More 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 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 informationTable 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients
able : Properties of the Continuous-ime Fourier Series x(t = e jkω0t = = x(te jkω0t dt = e jk(/t x(te jk(/t dt Property Periodic Signal Fourier Series Coefficients x(t y(t } Periodic with period and fundamental
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 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 informationComplex symmetry Signals and Systems Fall 2015
18-90 Signals and Systems Fall 015 Complex symmetry 1. Complex symmetry This section deals with the complex symmetry property. As an example I will use the DTFT for a aperiodic discrete-time signal. The
More 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 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 informationHomework 7 Solution EE235, Spring Find the Fourier transform of the following signals using tables: te t u(t) h(t) = sin(2πt)e t u(t) (2)
Homework 7 Solution EE35, Spring. Find the Fourier transform of the following signals using tables: (a) te t u(t) h(t) H(jω) te t u(t) ( + jω) (b) sin(πt)e t u(t) h(t) sin(πt)e t u(t) () h(t) ( ejπt e
More informationLecture 19: Discrete Fourier Series
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 19: Discrete Fourier Series Dec 5, 2001 Prof: J. Bilmes TA: Mingzhou
More 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 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 informationTable 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients
able : Properties of the Continuous-ime Fourier Series x(t = a k e jkω0t = a k = x(te jkω0t dt = a k e jk(/t x(te jk(/t dt Property Periodic Signal Fourier Series Coefficients x(t y(t } Periodic with period
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 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 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 informationDiscrete Fourier Transform
Discrete Fourier Transform Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz Diskrete Fourier transform (DFT) We have just one problem with DFS that needs to be solved.
More informationChapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter
Chapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter Objec@ves 1. Learn techniques for represen3ng discrete-)me periodic signals using orthogonal sets of periodic basis func3ons. 2.
More informationSignals and Systems Spring 2004 Lecture #9
Signals and Systems Spring 2004 Lecture #9 (3/4/04). The convolution Property of the CTFT 2. Frequency Response and LTI Systems Revisited 3. Multiplication Property and Parseval s Relation 4. The DT Fourier
More informationReview of Frequency Domain Fourier Series: Continuous periodic frequency components
Today we will review: Review of Frequency Domain Fourier series why we use it trig form & exponential form how to get coefficients for each form Eigenfunctions what they are how they relate to LTI systems
More informationFinal Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105.
Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, e-mail address,
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 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 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 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 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 informationx(t) = t[u(t 1) u(t 2)] + 1[u(t 2) u(t 3)]
ECE30 Summer II, 2006 Exam, Blue Version July 2, 2006 Name: Solution Score: 00/00 You must show all of your work for full credit. Calculators may NOT be used.. (5 points) x(t) = tu(t ) + ( t)u(t 2) u(t
More informationEECS20n, Solution to Mock Midterm 2, 11/17/00
EECS20n, Solution to Mock Midterm 2, /7/00. 5 points Write the following in Cartesian coordinates (i.e. in the form x + jy) (a) point j 3 j 2 + j =0 (b) 2 points k=0 e jkπ/6 = ej2π/6 =0 e jπ/6 (c) 2 points(
More informationHomework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt
Homework 4 May 2017 1. An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt Determine the impulse response of the system. Rewriting as y(t) = t e (t
More informationSignals and Systems I Have Known and Loved. (Lecture notes for CSE 3451) Andrew W. Eckford
Signals and Systems I Have Known and Loved (Lecture notes for CSE 3451) Andrew W. Eckford Department of Electrical Engineering and Computer Science York University, Toronto, Ontario, Canada Version: December
More informationLine Spectra and their Applications
In [ ]: cd matlab pwd Line Spectra and their Applications Scope and Background Reading This session concludes our introduction to Fourier Series. Last time (http://nbviewer.jupyter.org/github/cpjobling/eg-47-
More informationEE 3054: Signals, Systems, and Transforms Summer It is observed of some continuous-time LTI system that the input signal.
EE 34: Signals, Systems, and Transforms Summer 7 Test No notes, closed book. Show your work. Simplify your answers. 3. It is observed of some continuous-time LTI system that the input signal = 3 u(t) produces
More informationFourier series: Additional notes
Fourier series: Additional notes Linking Fourier series representations for signals Rectangular waveform Require FS expansion of signal y(t) below: 1 y(t) 1 4 4 8 12 t (seconds) Period T = 8, so ω = 2π/T
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 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 informationFinal Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129.
Final Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, e-mail address, and signature
More informationRepresenting a Signal
The Fourier Series Representing a Signal The convolution method for finding the response of a system to an excitation takes advantage of the linearity and timeinvariance of the system and represents the
More informationECE 301 Fall 2011 Division 1 Homework 10 Solutions. { 1, for 0.5 t 0.5 x(t) = 0, for 0.5 < t 1
ECE 3 Fall Division Homework Solutions Problem. Reconstruction of a continuous-time signal from its samples. Let x be a periodic continuous-time signal with period, such that {, for.5 t.5 x(t) =, for.5
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 informationFrequency Analysis: The Fourier
CHAPTER 4 Frequency Analysis: The Fourier Series A Mathematician is a device for turning coffee into theorems. Paul Erdos (93 996) mathematician 4. INTRODUCTION In this chapter and the next we consider
More informationChapter 4 The Fourier Series and Fourier Transform
Chapter 4 The Fourier Series and Fourier Transform Fourier Series Representation of Periodic Signals Let x(t) be a CT periodic signal with period T, i.e., xt ( + T) = xt ( ), t R Example: the rectangular
More informationECE 301. Division 3, Fall 2007 Instructor: Mimi Boutin Midterm Examination 3
ECE 30 Division 3, all 2007 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 informationFourier transform representation of CT aperiodic signals Section 4.1
Fourier transform representation of CT aperiodic signals Section 4. A large class of aperiodic CT signals can be represented by the CT Fourier transform (CTFT). The (CT) Fourier transform (or spectrum)
More informationHomework 9 Solutions
8-290 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 207 Homework 9 Solutions Part One. (6 points) Compute the convolution of the following continuous-time aperiodic signals. (Hint: Use the
More informationEE Homework 13 - Solutions
EE3054 - Homework 3 - Solutions. (a) The Laplace transform of e t u(t) is s+. The pole of the Laplace transform is at which lies in the left half plane. Hence, the Fourier transform is simply the Laplace
More 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 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 informationChapter 4 The Fourier Series and Fourier Transform
Chapter 4 The Fourier Series and Fourier Transform Representation of Signals in Terms of Frequency Components Consider the CT signal defined by N xt () = Acos( ω t+ θ ), t k = 1 k k k The frequencies `present
More informationLECTURE 12 Sections Introduction to the Fourier series of periodic signals
Signals and Systems I Wednesday, February 11, 29 LECURE 12 Sections 3.1-3.3 Introduction to the Fourier series of periodic signals Chapter 3: Fourier Series of periodic signals 3. Introduction 3.1 Historical
More information4.1 Introduction. 2πδ ω (4.2) Applications of Fourier Representations to Mixed Signal Classes = (4.1)
4.1 Introduction Two cases of mixed signals to be studied in this chapter: 1. Periodic and nonperiodic signals 2. Continuous- and discrete-time signals Other descriptions: Refer to pp. 341-342, textbook.
More informationECE 301 Division 1, Fall 2008 Instructor: Mimi Boutin Final Examination Instructions:
ECE 30 Division, all 2008 Instructor: Mimi Boutin inal Examination Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out the requested
More informationFast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding
Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fourier Series & Transform Summary x[n] = X[k] = 1 N k= n= X[k]e jkω
More informationLaplace Transforms and use in Automatic Control
Laplace Transforms and use in Automatic Control P.S. Gandhi Mechanical Engineering IIT Bombay Acknowledgements: P.Santosh Krishna, SYSCON Recap Fourier series Fourier transform: aperiodic Convolution integral
More 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 informationSIGNALS AND SYSTEMS: PAPER 3C1 HANDOUT 6. Dr Anil Kokaram Electronic and Electrical Engineering Dept.
SIGNALS AND SYSTEMS: PAPER 3C HANDOUT 6. Dr Anil Kokaram Electronic and Electrical Engineering Dept. anil.kokaram@tcd.ie www.mee.tcd.ie/ sigmedia FOURIER ANALYSIS Have seen how the behaviour of systems
More informationECE 301 Division 1, Fall 2006 Instructor: Mimi Boutin Final Examination
ECE 30 Division, all 2006 Instructor: Mimi Boutin inal Examination Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out the requested
More informationProfessor Fearing EECS120/Problem Set 2 v 1.01 Fall 2016 Due at 4 pm, Fri. Sep. 9 in HW box under stairs (1st floor Cory) Reading: O&W Ch 1, Ch2.
Professor Fearing EECS120/Problem Set 2 v 1.01 Fall 20 Due at 4 pm, Fri. Sep. 9 in HW box under stairs (1st floor Cory) Reading: O&W Ch 1, Ch2. Note: Π(t) = u(t + 1) u(t 1 ), and r(t) = tu(t) where u(t)
More informationFast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding
Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding J. McNames Portland State University ECE 223 FFT Ver. 1.03 1 Fourier Series
More informationDiscrete Fourier Transform
Discrete Fourier Transform Virtually all practical signals have finite length (e.g., sensor data, audio records, digital images, stock values, etc). Rather than considering such signals to be zero-padded
More informationECE 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 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 informationGeorge Mason University Signals and Systems I Spring 2016
George Mason University Signals and Systems I Spring 206 Problem Set #6 Assigned: March, 206 Due Date: March 5, 206 Reading: This problem set is on Fourier series representations of periodic signals. The
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 informationECE 301 Fall 2011 Division 1 Homework 5 Solutions
ECE 301 Fall 2011 ivision 1 Homework 5 Solutions Reading: Sections 2.4, 3.1, and 3.2 in the textbook. Problem 1. Suppose system S is initially at rest and satisfies the following input-output difference
More informationSolutions to Problems in Chapter 4
Solutions to Problems in Chapter 4 Problems with Solutions Problem 4. Fourier Series of the Output Voltage of an Ideal Full-Wave Diode Bridge Rectifier he nonlinear circuit in Figure 4. is a full-wave
More information1.3 Frequency Analysis A Review of Complex Numbers
3 CHAPTER. ANALYSIS OF DISCRETE-TIME LINEAR TIME-INVARIANT SYSTEMS I y z R θ x R Figure.8. A complex number z can be represented in Cartesian coordinates x, y or polar coordinates R, θ..3 Frequency Analysis.3.
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 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 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 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 information2.161 Signal Processing: Continuous and Discrete
MI OpenCourseWare http://ocw.mit.edu.6 Signal Processing: Continuous and Discrete Fall 8 For information about citing these materials or our erms of Use, visit: http://ocw.mit.edu/terms. MASSACHUSES INSIUE
More informationDiscrete Fourier transform (DFT)
Discrete Fourier transform (DFT) Signal Processing 2008/9 LEA Instituto Superior Técnico Signal Processing LEA (IST) Discrete Fourier transform 1 / 34 Periodic signals Consider a periodic signal x[n] with
More informatione st f (t) dt = e st tf(t) dt = L {t f(t)} s
Additional operational properties How to find the Laplace transform of a function f (t) that is multiplied by a monomial t n, the transform of a special type of integral, and the transform of a periodic
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 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 informationEE Homework 12 - Solutions. 1. The transfer function of the system is given to be H(s) = s j j
EE3054 - Homework 2 - Solutions. The transfer function of the system is given to be H(s) = s 2 +3s+3. Decomposing into partial fractions, H(s) = 0.5774j s +.5 0.866j + 0.5774j s +.5 + 0.866j. () (a) The
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 informationConvolution. Define a mathematical operation on discrete-time signals called convolution, represented by *. Given two discrete-time signals x 1, x 2,
Filters Filters So far: Sound signals, connection to Fourier Series, Introduction to Fourier Series and Transforms, Introduction to the FFT Today Filters Filters: Keep part of the signal we are interested
More informationENSC327 Communications Systems 2: Fourier Representations. School of Engineering Science Simon Fraser University
ENSC37 Communications Systems : Fourier Representations School o Engineering Science Simon Fraser University Outline Chap..5: Signal Classiications Fourier Transorm Dirac Delta Function Unit Impulse Fourier
More informationNotes 07 largely plagiarized by %khc
Notes 07 largely plagiarized by %khc Warning This set of notes covers the Fourier transform. However, i probably won t talk about everything here in section; instead i will highlight important properties
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 informationProblem Value
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM DATE: 2-May-05 COURSE: ECE-2025 NAME: GT #: LAST, FIRST (ex: gtz123a) Recitation Section: Circle the date & time when
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 informationDiscrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is
Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its
More informationSignals and Systems I Have Known and Loved. Andrew W. Eckford
Signals and Systems I Have Known and Loved Andrew W. Eckford Department of Electrical Engineering and Computer Science York University, oronto, Ontario, Canada Version: September 2, 216 Copyright c 215
More informationSignals and Systems: Introduction
Dependent variable Signals and Systems: Introduction What is a signal? Signals may describe a wide variety of physical phenomena. The information in a signal is contained in a pattern of variations of
More information