J. McNames Portland State University ECE 223 DT Fourier Series Ver
|
|
- John Simmons
- 6 years ago
- Views:
Transcription
1 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 State University ECE 223 DT Fourier Series Ver
2 Motivation h[n] x[n] y[n] x[n] H(e jω ) y[n] e jωn H(e jωn )e jωn X[k] e jωkn X[k] H(e jωkn )e jω kn k k H(e jω ) = F {h[n]} = h[n] e jωn n= For now, we restrict out attention to DT periodic signals: x[n + N] = x[n] Would like to represent x[n] as a sum of complex sinusoids Why? Gives us insight and simplifies computation J. McNames Portland State University ECE 223 DT Fourier Series Ver
3 LTI Systems: Key Property Linearity is a key property of LTI systems (such as circuits) A system is linear if for any two signals, say x 1 [n] and x 2 [n] x 1 [n] y 1 [n] x 2 [n] y 2 [n] and any linear combination of these two signals, say x[n] α 1 x 1 [n] + α 2 x 2 [n] y[n] α 1 y 1 [n] + α 2 y 2 [n] The immediate generalization that follows is if x k [n] y k [n] for all k then X[k]x k [n] k k X[k]y k [n] J. McNames Portland State University ECE 223 DT Fourier Series Ver
4 Periodic Sum Notation Suppose x[n] is a discrete-time (DT) periodic signal with fundamental period N. Then the sum of x[n] over a fundamental period is the same no matter what time the sum begins s = N 1 x[n] = N x[n] = N 1+n 0 x[n] n=0 n=1 n=n 0 We will denote the sum over any fundamental period of the signal generically as s = x[n] J. McNames Portland State University ECE 223 DT Fourier Series Ver
5 Jointly Periodic Signals Suppose two DT periodic signals x 1 [n] and x 2 [n] have a common fundamental period N, defined as the smallest N such that both x 1 [n] = x 1 [n + N] and x 2 [n] = x 2 [n + N] I will refer to these signals as jointly periodic The product p[n] x 1 [n]x 2 [n] is then also periodic with fundamental period N: p[n + N] = x 1 [n + N]x 2 [n + N] = x 1 [n]x 2 [n] = p[n] J. McNames Portland State University ECE 223 DT Fourier Series Ver
6 Inner Products and Orthogonality Let us define an inner product of two DT jointly periodic signals as < x 1 [n], x 2 [n] > x 1 [n]x 2[n] where denotes complex conjugate. The norm of a signal is the inner product of the signal with itself x[n] 2 < x[n], x[n] >= x[n]x [n] = x[n] 2 Two signals are said to be orthogonal if and only if their inner product is zero x 1 [n]x 2[n] = 0 J. McNames Portland State University ECE 223 DT Fourier Series Ver
7 Signal Decompositions Suppose we can represent a DT periodic signal x[n] as a linear combination of basis functions x[n] = K 1 k=0 This may be useful for several reasons X[k]x k [n] If we know how an LTI system responds to each x k [n], say x k [n] y k [n], we immediately know: x[n] y[n] = K 1 k=0 X[k]y k [n] The set of coefficients X[k] is a complete and, possibly, compact representation of the signal (signal compression) If the basis functions x k [n] are meaningful, the coefficients X[k] indicate the degree to which each contributes to x[n] J. McNames Portland State University ECE 223 DT Fourier Series Ver
8 Strategy for Finding the Coefficients x[n] = K 1 k=0 X[k]x k [n] Problem: for a given periodic signal x[n] and known set of basis functions {x k [n]}, how do we determine the coefficients X[k]? This becomes a relatively easy problem if the basis functions x k [n] are orthogonal to one another just take the inner product J. McNames Portland State University ECE 223 DT Fourier Series Ver
9 Solving for the Coefficients with Inner Products For the sake of simplicity, let us assume < x k [n], x k [n] >= x k [n] 2 = c for all k. Then < x[n], x l [n] > = x[n]x l [n] = = = K 1 k=0 K 1 k=0 = cx[l] X[k] ( K 1 k=0 X[k]c δ(k l) X[l] = 1 c < x[n], x l[n] > X[k]x k [n] ) x k [n]x l[n] x l[n] J. McNames Portland State University ECE 223 DT Fourier Series Ver
10 Picking Basis Functions We would like basis functions that Are mutually orthogonal < x k [n], x l [n] >= 0 for all k l Cause a simple and known response when applied to LTI systems: x k [n] y k [n] Are meaningful Complex sinusoids satisfy these last two properties, but are they mutually orthogonal? J. McNames Portland State University ECE 223 DT Fourier Series Ver
11 Example 1: Complex Sinusoidal Sum Consider the set of basis functions x k [n] = e jkωn where Ω 2π N 1. Are these basis functions orthogonal? 2. What are their norms? Hint: recall the finite sum formula N 1 n=0 a n = 1 an 1 a J. McNames Portland State University ECE 223 DT Fourier Series Ver
12 Example 1: Workspace J. McNames Portland State University ECE 223 DT Fourier Series Ver
13 Harmonically Related Complex Sinusoids x k [n] = e jkωn where Ω = 2π N Harmonically related complex sinusoids are very useful They form an orthogonal set of basis functions The response of an LTI system to each basis function is known e jkωn H(e jkω )e jkωn It is easy to solve for the coefficients for signals that can be represented as x[n] = X[k]e jkωn k J. McNames Portland State University ECE 223 DT Fourier Series Ver
14 DT Periodic Signals 1 x[n] x[n] = { 1.0 n = 3k 0.5 Otherwise n Suppose we have a DT signal x[n] that we know is periodic The signal is applied at the input of an LTI system We would like to estimate the signal as a sum of complex sinusoids ˆx[n] = k X[k] e jω kn J. McNames Portland State University ECE 223 DT Fourier Series Ver
15 DT Periodic Signals Design Task ˆx[n] = k X[k] e jω kn Here theˆsymbol is used to indicate that the sum is an approximation (estimate) of x[n] Enables us to calculate the system output easily Must pick The frequencies Ω k The range of the sum k The coefficients X[k] Even if we make good choices, how good will the estimate be? J. McNames Portland State University ECE 223 DT Fourier Series Ver
16 Picking the Frequencies ˆx[n] = k X[k] e jω kn We know x[n] is periodic with some fundamental period N If ˆx[n] is to approximate x[n] accurately, it should also repeat every N samples In order for ˆx[n] to be periodic with period N, every complex sinusoid must also be periodic Only a harmonic set of complex sinusoids have this property Thus Ω k = kω where Ω = 2π N ˆx[n] = k X[k] e jkωn J. McNames Portland State University ECE 223 DT Fourier Series Ver
17 Design Task: Picking the Range ˆx[n] = k X[k] e jkωn Recall that there are only N distinct complex sinusoids that repeat every N samples e jkωn = e j(k+ln)n where Ω = 2π N Thus we can pick the range of the sum so that it includes only these terms Typical choices ˆx[n] = N 1 k=0 X[k] e jkωn ˆx[n] = (N 1)/2 k= (N 1)/2 X[k] e jkωn J. McNames Portland State University ECE 223 DT Fourier Series Ver
18 Equivalent Expressions for Exponential Sums x[n] = k X[k] e jkωn Since only N of the harmonics are distinct, we may truncate the sum so that it only contains only N distinct terms. It does not matter which set of N terms are used. x[n] = N 1 X[k] e jkωn = N 1+l X[k] e jkωn = X[k] e jkωn k=0 k=l k=<n> Again, note the new notation: X[k] e jkωn N+l X[k] e jkωn for any l k=<n> k=1+l J. McNames Portland State University ECE 223 DT Fourier Series Ver
19 Design Task: Picking the Coefficients ˆx[n] = X[k] e jkωn MSE = 1 N x[n] ˆx[n] 2 k=<n> We would like to pick the coefficients X[k] so that ˆx[n] is as close to x[n] as possible But what is close? One measure of the difference between two signals is the mean squared error (MSE) There are other measures, but this is a convenient one because we can differentiate it Since the signal is periodic, the MSE is calculated over a single fundamental period of N consecutive samples How do we pick the coefficients X[k] to minimize the MSE? J. McNames Portland State University ECE 223 DT Fourier Series Ver
20 Design Task: Coefficient Optimization ˆx[n] = X[k] e jkωn MSE = 1 N x[n] ˆx[n] 2 k=<n> Solving for the optimal coefficients is difficult However, suppose that an optimal solution exists such that MSE = 0 If such a solution exists, we know the sum of errors will also be zero 0 = x[n] ˆx[n] J. McNames Portland State University ECE 223 DT Fourier Series Ver
21 Design Task: Solve for the Coefficients 0 = x[n]e jlωn ˆx[n]e jlωn x[n]e jlωn = x[n]e jlωn = = k=<n> = k=<n> = k=<n> = X[l]N ˆx[n]e jlωn ( k=<n> X[k] X[k] X[k] e jkωn ) X[k] (Nδ[k l]) e jkωn e jlωn e j(k l)ωn e jlωn J. McNames Portland State University ECE 223 DT Fourier Series Ver
22 Design Task: Optimal Coefficients Thus, the coefficient of the lth complex sinusoid that minimize the MSE is X[l] = 1 x[n]e jlωn N Note that this is the same result we would have obtained by taking an inner product with the basis function With more algebra, you should be able to show that these coefficients result in MSE = 0! Thus, ˆx[n] = x[n] This means any DT periodic signal can be exactly represented as a sum of N complex sinusoidal harmonics J. McNames Portland State University ECE 223 DT Fourier Series Ver
23 x[n] = DTFS Observations X[k] e jkωn X[k] = 1 N k=<n> x[n]e jkωn The first equation is called the synthesis equation The second equation is called the analysis equation The coefficients X[k] are called the spectral coefficients or Fourier series coefficients of x[n] We denote the relationship of x[n] and X[k] by x[n] FS X[k] Both are complete representations of the signal: If we know one, we can compute the other X[k] is a function of frequency (kω) J. McNames Portland State University ECE 223 DT Fourier Series Ver
24 Further DTFS Observations & Comments x[n] = X[k] e jkωn X[k] = 1 N x[n]e jkωn k=<n> The DTFS transform is special because both sums are finite This permits us to calculate the DTFS exactly with computers (e.g. MATLAB) and microprocessors Later we will see how the DTFS is used to compute the other 3 transforms There is also a very fast algorithm (FFT) for computing the DTFS The Fourier series representation of signals is useful for LTI system design and analysis because we know how LTI systems affect sinusoidal signals J. McNames Portland State University ECE 223 DT Fourier Series Ver
25 Example 2: Pulse x[n] 1 -N -m 0 m N n What type of symmetry does the signal have? Find the DT Fourier series coefficients. Plot the coefficient spectrum, partial sums of the Fourier series components, and the MSE versus number of coefficients. J. McNames Portland State University ECE 223 DT Fourier Series Ver
26 Example 2: Workspace J. McNames Portland State University ECE 223 DT Fourier Series Ver
27 Example 2: Coefficient Spectrum 0.5 Discrete Time Fourier Series Coefficients X[k] X[k] kth (harmonic) J. McNames Portland State University ECE 223 DT Fourier Series Ver
28 Example 2: Partial Fourier Series 1.2 Partial Fourier Series Approximation (k=0) Time (samples) J. McNames Portland State University ECE 223 DT Fourier Series Ver
29 Example 2: Partial Fourier Series 1.2 Partial Fourier Series Approximation (k= 1 to 1) Time (samples) J. McNames Portland State University ECE 223 DT Fourier Series Ver
30 Example 2: Partial Fourier Series 1.2 Partial Fourier Series Approximation (k= 2 to 2) Time (samples) J. McNames Portland State University ECE 223 DT Fourier Series Ver
31 Example 2: Partial Fourier Series 1.2 Partial Fourier Series Approximation (k= 3 to 3) Time (samples) J. McNames Portland State University ECE 223 DT Fourier Series Ver
32 Example 2: Partial Fourier Series 1.2 Partial Fourier Series Approximation (k= 4 to 4) Time (samples) J. McNames Portland State University ECE 223 DT Fourier Series Ver
33 Example 2: Partial Fourier Series 1.2 Fourier Series Synthesis (k= 5 to 5) Time (samples) J. McNames Portland State University ECE 223 DT Fourier Series Ver
34 Example 2: Mean Squared Error MSE Coefficients J. McNames Portland State University ECE 223 DT Fourier Series Ver
35 Example 2: MATLAB Code function [] = DTPulse(); %============================================================================== % User- Specified Parameters %============================================================================== N = 11; % Fundamental period ( samples) m = 2; % Pulse width = (1 + 2m) samples %============================================================================== % Preprocessing %============================================================================== w = 2*pi/N; n = (-15:15); t = (-15:0.01:15) ; tm = mod(n,n); %============================================================================== % Construct one period of the signal %============================================================================== x = 1*(tm m) + 1*(tm N-m); %============================================================================== % Plot the Coefficient Spectrum %============================================================================== figure(1); FigureSet(1, LTX ); K = -25:25; J. McNames Portland State University ECE 223 DT Fourier Series Ver
36 for c1 = 1:length(K), k = K(c1); if k==0, a(c1) = (1/N)*(m+1/2)/(1/2); else a(c1) = (1/N)*sin(w*k*(m+1/2))./sin(w*k/2); end; end; h = stem(k,a); set(h, Color,[ ]); set(h, Marker,. ); set(h, MarkerSize,10); set(h, LineWidth,1.0); xlabel( kth (harmonic) ); ylabel( X[k] ); title( Discrete-Time Fourier Series Coefficients X[k] ); AxisLines; box off; AxisSet(8); print -depsc DTPulseSpectrum; NP = 0:(N-1)/2; k = 1:N-1; a(1) = (1/N)*(m+1/2)/(1/2); a(k+1) = (1/N)*sin(w*k*(m+1/2))./sin(w*k/2); %============================================================================== % Plot the Approximations %============================================================================== MSE = zeros((n+1)/2,1); for c1 = 1:length(NP), J. McNames Portland State University ECE 223 DT Fourier Series Ver
37 figure; FigureSet(1, LTX ); hold on; xd = zeros(size(n)); xc = zeros(size(t)); for c2 = 1:c1, k = c2-1; if k==0, xpd = a(c2)*exp(j*k*w*n); xpc = a(c2)*exp(j*k*w*t); else xpd = a(c2)*exp(j*k*w*n) + conj(a(c2))*exp(-j*k*w*n); xpc = a(c2)*exp(j*k*w*t) + conj(a(c2))*exp(-j*k*w*t); end; h = plot(t,xpc); set(h, Color,[ ]); set(h, LineWidth,0.2); h = plot(n,xpd,. ); set(h, Color,[ ]); set(h, MarkerSize,6); xd = xd + xpd; xc = xc + xpc; end; MSE(c1) = mean((x(1:n)-xd(1:n)).^2); h = plot(t,xc, k ); set(h, LineWidth,0.4); h = stem(n,x, r ); J. McNames Portland State University ECE 223 DT Fourier Series Ver
38 set(h, Marker,. ); set(h, MarkerSize,11); set(h, LineWidth,1.4); h = stem(n,xd, b ); set(h, Marker,. ); set(h, MarkerSize,8); set(h, LineWidth,0.8); xlabel( Time (samples) ); if c1==1, st = sprintf( Partial Fourier Series Approximation (k=0) ); elseif c1==length(np), st = sprintf( Fourier Series Synthesis (k=%d to %d),-(c1-1),c1-1); else st = sprintf( Partial Fourier Series Approximation (k=%d to %d),-(c1-1),c1-1); end; title(st); xlim([min(t) max(t)]); ylim([ ]); AxisLines; box off; AxisSet(8); st = sprintf( print -depsc DTPulse%d,c1-1); eval(st); end; %============================================================================== % Plot the Mean Square Error %============================================================================== figure; J. McNames Portland State University ECE 223 DT Fourier Series Ver
39 FigureSet(1, LTX ); k = [1 1+2*(1+0:(N-1)/2)]; h = stem(k,mse, k ); set(h, Marker,. ); set(h, MarkerSize,11); set(h, LineWidth,1.4); xlabel( Coefficients ); ylabel( MSE ); box off; AxisSet(8); print - depsc DTPulseMSE; J. McNames Portland State University ECE 223 DT Fourier Series Ver
40 DTFS Terminology x[n] = X[k] e jkωn X[k] = 1 N x[n]e jkωn k=<n> X[k] is complex-valued in general The function X[k] is called the magnitude spectrum of x[n] The function arg{x[k]} is called the phase spectrum of x[n] J. McNames Portland State University ECE 223 DT Fourier Series Ver
41 Summary A finite sum of complex sinusoids can represent any DT periodic signal! Harmonic sets of complex sinusoids are special Orthogonal set Constant amplitude Eigenfunctions of LTI systems The spectral coefficients are useful for telling us where the power of the signal is concentrated in the frequency domain The coefficients of these sinusoids are useful for signal analysis, LTI system design and analysis J. McNames Portland State University ECE 223 DT Fourier Series Ver
Fast 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 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 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 informationCore Concepts Review. Orthogonality of Complex Sinusoids Consider two (possibly non-harmonic) complex sinusoids
Overview of Continuous-Time Fourier Transform Topics Definition Compare & contrast with Laplace transform Conditions for existence Relationship to LTI systems Examples Ideal lowpass filters Relationship
More informationOverview of Sampling Topics
Overview of Sampling Topics (Shannon) sampling theorem Impulse-train sampling Interpolation (continuous-time signal reconstruction) Aliasing Relationship of CTFT to DTFT DT processing of CT signals DT
More informationAssignment 2 Solutions Fourier Series
Assignment 2 Solutions Fourier Series ECE 223 Signals and Systems II Version.2 Spring 26. DT Fourier Series. Consider the following discrete-time periodic signal n = +7l n =+7l x[n] = n =+7l Otherwise
More informationJ. McNames Portland State University ECE 223 Sampling Ver
Overview of Sampling Topics (Shannon) sampling theorem Impulse-train sampling Interpolation (continuous-time signal reconstruction) Aliasing Relationship of CTFT to DTFT DT processing of CT signals DT
More 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 informationAssignment 4 Solutions Continuous-Time Fourier Transform
Assignment 4 Solutions Continuous-Time Fourier Transform ECE 3 Signals and Systems II Version 1.01 Spring 006 1. Properties of complex numbers. Let c 1 α 1 + jβ 1 and c α + jβ be two complex numbers. a.
More informationSpectrograms Overview Introduction and motivation Windowed estimates as filter banks Uncertainty principle Examples Other estimates
Spectrograms Overview Introduction and motivation Windowed estimates as filter banks Uncertainty principle Examples Other estimates J. McNames Portland State University ECE 3 Spectrograms Ver. 1.1 1 Introduction
More informationNonparametric and Parametric Defined This text distinguishes between systems and the sequences (processes) that result when a WN input is applied
Linear Signal Models Overview Introduction Linear nonparametric vs. parametric models Equivalent representations Spectral flatness measure PZ vs. ARMA models Wold decomposition Introduction Many researchers
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 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 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 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 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 informationWindowing Overview Relevance Main lobe/side lobe tradeoff Popular windows Examples
ing Overview Relevance Main lobe/side lobe tradeoff Popular windows Examples ing In practice, we cannot observe a signal x(n) for n = to n = Thus we must truncate, or window, the signal: x(n) w(n) ing
More informationChange in Notation. e (i) (n) Note that this is inconsistent with the notation used earlier, c k+1x(n k) e (i) (n) x(n i) ˆx(n i) M
Overview of Linear Prediction Terms and definitions Nonstationary case Stationary case Forward linear prediction Backward linear prediction Stationary processes Exchange matrices Examples Properties Introduction
More informationTerminology Suppose we have N observations {x(n)} N 1. Estimators as Random Variables. {x(n)} N 1
Estimation Theory Overview Properties Bias, Variance, and Mean Square Error Cramér-Rao lower bound Maximum likelihood Consistency Confidence intervals Properties of the mean estimator Properties of the
More informationOverview of Bode Plots Transfer function review Piece-wise linear approximations First-order terms Second-order terms (complex poles & zeros)
Overview of Bode Plots Transfer function review Piece-wise linear approximations First-order terms Second-order terms (complex poles & zeros) J. McNames Portland State University ECE 222 Bode Plots Ver.
More informationChapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform Introduction Representation of periodic sequences: the discrete Fourier series Properties of the DFS The Fourier transform of periodic signals Sampling the Fourier
More informationFourier Analysis and Spectral Representation of Signals
MIT 6.02 DRAFT Lecture Notes Last update: April 11, 2012 Comments, questions or bug reports? Please contact verghese at mit.edu CHAPTER 13 Fourier Analysis and Spectral Representation of Signals We have
More informationProbability Space. J. McNames Portland State University ECE 538/638 Stochastic Signals Ver
Stochastic Signals Overview Definitions Second order statistics Stationarity and ergodicity Random signal variability Power spectral density Linear systems with stationary inputs Random signal memory Correlation
More 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 informationHomework 6 Solutions
8-290 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 208 Homework 6 Solutions. Part One. (2 points) Consider an LTI system with impulse response h(t) e αt u(t), (a) Compute the frequency response
More informationECE-314 Fall 2012 Review Questions for Midterm Examination II
ECE-314 Fall 2012 Review Questions for Midterm Examination II First, make sure you study all the problems and their solutions from homework sets 4-7. Then work on the following additional problems. Problem
More informationDSP Laboratory (EELE 4110) Lab#5 DTFS & DTFT
Islamic University of Gaza Faculty of Engineering Electrical Engineering Department EG.MOHAMMED ELASMER Spring-22 DSP Laboratory (EELE 4) Lab#5 DTFS & DTFT Discrete-Time Fourier Series (DTFS) The discrete-time
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 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 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 informationExtended Kalman Filter Derivation Example application: frequency tracking
Extended Kalman Filter Derivation Example application: frequency tracking Nonlinear State Space Model Consider the nonlinear state-space model of a random process x n+ = f n (x n )+g n (x n )u n y n =
More informationIntroduction. Spectral Estimation Overview Periodogram Bias, variance, and distribution Blackman-Tukey Method Welch-Bartlett Method Others
Spectral Estimation Overview Periodogram Bias, variance, and distribution Blackman-Tukey Method Welch-Bartlett Method Others Introduction R x (e jω ) r x (l)e jωl l= Most stationary random processes have
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 informationDigital Signal Processing: Signal Transforms
Digital Signal Processing: Signal Transforms Aishy Amer, Mohammed Ghazal January 19, 1 Instructions: 1. This tutorial introduces frequency analysis in Matlab using the Fourier and z transforms.. More Matlab
More informationDiscrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is
Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its
More informationDiscrete-Time 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 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 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 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 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 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 informationLAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011
University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 2: DTFT, DFT, and DFT Spectral
More informationFourier Analysis and Spectral Representation of Signals
MIT 6.02 DRAFT Lecture Notes Last update: November 3, 2012 CHAPTER 13 Fourier Analysis and Spectral Representation of Signals We have seen in the previous chapter that the action of an LTI system on a
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 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 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 informationDepartment of Electrical and Computer Engineering Digital Speech Processing Homework No. 6 Solutions
Problem 1 Department of Electrical and Computer Engineering Digital Speech Processing Homework No. 6 Solutions The complex cepstrum, ˆx[n], of a sequence x[n] is the inverse Fourier transform of the complex
More information6.003: Signal Processing
6.003: Signal Processing Discrete Fourier Transform Discrete Fourier Transform (DFT) Relations to Discrete-Time Fourier Transform (DTFT) Relations to Discrete-Time Fourier Series (DTFS) October 16, 2018
More information(i) Represent continuous-time periodic signals using Fourier series
Fourier Series Chapter Intended Learning Outcomes: (i) Represent continuous-time periodic signals using Fourier series (ii) (iii) Understand the properties of Fourier series Understand the relationship
More informationCircuit Theorems Overview Linearity Superposition Source Transformation Thévenin and Norton Equivalents Maximum Power Transfer
Circuit Theorems Overview Linearity Superposition Source Transformation Thévenin and Norton Equivalents Maximum Power Transfer J. McNames Portland State University ECE 221 Circuit Theorems Ver. 1.36 1
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 information8 The Discrete Fourier Transform (DFT)
8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration
More 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 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 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 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 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 informationHW13 Solutions. Pr (a) The DTFT of c[n] is. C(e jω ) = 0.5 m e jωm e jω + 1
HW3 Solutions Pr..8 (a) The DTFT of c[n] is C(e jω ) = = =.5 n e jωn + n=.5e jω + n= m=.5 n e jωn.5 m e jωm.5e jω +.5e jω.75 =.5 cos(ω) }{{}.5e jω /(.5e jω ) C(e jω ) is the power spectral density. (b)
More information6.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 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 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 informationUniversity of Connecticut Lecture Notes for ME5507 Fall 2014 Engineering Analysis I Part III: Fourier Analysis
University of Connecticut Lecture Notes for ME557 Fall 24 Engineering Analysis I Part III: Fourier Analysis Xu Chen Assistant Professor United Technologies Engineering Build, Rm. 382 Department of Mechanical
More information6.003: Signals and Systems
6.003: Signals and Systems Discrete-Time Frequency Representations November 8, 2011 1 Mid-term Examination #3 Wednesday, November 16, 7:30-9:30pm, No recitations on the day of the exam. Coverage: Lectures
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 informationx n C l 1 u n C m 1 y n C p 1 v n C p 1
Kalman Filter Derivation Examples Time and Measurement Updates x u n v n, State Space Model Review x n+ = F n x n + G n u n x u k v k y n = H n x n + v n Π = Q n δ nk S n δ nk Snδ nk R n δ nk F n C l l
More informationAnalog vs. discrete signals
Analog vs. discrete signals Continuous-time signals are also known as analog signals because their amplitude is analogous (i.e., proportional) to the physical quantity they represent. Discrete-time signals
More informationOne-Port Networks. One-Port. Network
TwoPort s Definitions Impedance Parameters dmittance Parameters Hybrid Parameters Transmission Parameters Cascaded TwoPort s Examples pplications OnePort s v i' 1 OnePort pair of terminals at which a signal
More informationCHAPTER 7. The Discrete Fourier Transform 436
CHAPTER 7. The Discrete Fourier Transform 36 hfa figconfg( P7a, long ); subplot() stem(k,abs(ck), filled );hold on stem(k,abs(ck_approx), filled, color, red ); xlabel( k, fontsize,lfs) title( Magnitude
More informationTransforms and Orthogonal Bases
Orthogonal Bases Transforms and Orthogonal Bases We now turn back to linear algebra to understand transforms, which map signals between different domains Recall that signals can be interpreted as vectors
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 informationChapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum
Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum CEN352, DR. Nassim Ammour, King Saud University 1 Fourier Transform History Born 21 March 1768 ( Auxerre ). Died 16 May 1830 ( Paris ) French
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 informationSinusoidal Modeling. Yannis Stylianou SPCC University of Crete, Computer Science Dept., Greece,
Sinusoidal Modeling Yannis Stylianou University of Crete, Computer Science Dept., Greece, yannis@csd.uoc.gr SPCC 2016 1 Speech Production 2 Modulators 3 Sinusoidal Modeling Sinusoidal Models Voiced Speech
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 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 information2 Background: Fourier Series Analysis and Synthesis
Signal Processing First Lab 15: Fourier Series Pre-Lab and Warm-Up: You should read at least the Pre-Lab and Warm-up sections of this lab assignment and go over all exercises in the Pre-Lab section before
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 informationMusic 270a: Complex Exponentials and Spectrum Representation
Music 270a: Complex Exponentials and Spectrum Representation Tamara Smyth, trsmyth@ucsd.edu Department of Music, University of California, San Diego (UCSD) October 24, 2016 1 Exponentials The exponential
More informationDigital Signal Processing. Midterm 2 Solutions
EE 123 University of California, Berkeley Anant Sahai arch 15, 2007 Digital Signal Processing Instructions idterm 2 Solutions Total time allowed for the exam is 80 minutes Please write your name and SID
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 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 informationProblem Set 9 Solutions
Problem Set 9 Solutions EE23: Digital Signal Processing. From Figure below, we see that the DTFT of the windowed sequence approaches the actual DTFT as the window size increases. Gibb s phenomenon is absent
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 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 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 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 informationDiscrete Fourier transform (DFT)
Discrete Fourier transform (DFT) Alejandro Ribeiro January 19, 2018 Let x : [0, N 1] C be a discrete signal of duration N and having elements x(n) for n [0, N 1]. The discrete Fourier transform (DFT) of
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 information16.362: Signals and Systems: 1.0
16.362: Signals and Systems: 1.0 Prof. K. Chandra ECE, UMASS Lowell September 1, 2016 1 Background The pre-requisites for this course are Calculus II and Differential Equations. A basic understanding of
More informationCMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation
CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University January 23, 2006 1 Exponentials The exponential is
More 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 informationSolutions - Homework # 3
ECE-34: Signals and Systems Summer 23 PROBLEM One period of the DTFS coefficients is given by: X[] = (/3) 2, 8. Solutions - Homewor # 3 a) What is the fundamental period 'N' of the time-domain signal x[n]?
More informationx(n) = a k x(n k)+w(n) k=1
Autoregressive Models Overview Direct structures Types of estimators Parametric spectral estimation Parametric time-frequency analysis Order selection criteria Lattice structures? Maximum entropy Excitation
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 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 informationVoiced Speech. Unvoiced Speech
Digital Speech Processing Lecture 2 Homomorphic Speech Processing General Discrete-Time Model of Speech Production p [ n] = p[ n] h [ n] Voiced Speech L h [ n] = A g[ n] v[ n] r[ n] V V V p [ n ] = u [
More informationLectures on Spectra of Discrete-Time Signals
Lectures on Spectra of Discrete-Time Signals Principal questions to be addressed: What, in a general sense, is the "spectrum" of a discrete-time signal? How does one assess the spectrum of a discrete-time
More informationSignals & Systems Handout #4
Signals & Systems Handout #4 H-4. Elementary Discrete-Domain Functions (Sequences): Discrete-domain functions are defined for n Z. H-4.. Sequence Notation: We use the following notation to indicate the
More 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 informationFourier analysis of discrete-time signals. (Lathi Chapt. 10 and these slides)
Fourier analysis of discrete-time signals (Lathi Chapt. 10 and these slides) Towards the discrete-time Fourier transform How we will get there? Periodic discrete-time signal representation by Discrete-time
More information