Solutions for examination in TSRT78 Digital Signal Processing,

Size: px
Start display at page:

Download "Solutions for examination in TSRT78 Digital Signal Processing,"

Transcription

1 Solutions for examination in TSRT78 Digital Signal Processing (a) The forgetting factor balances the accuracy and the adaptation speed of the RLS algorithm. This as the forgetting factor controls the number of observations to take into account. So a large number of observations gives high static accuracy as it mitigates the noise but then fails to adapt to sudden parameter changes. (b) The circular convolution can e.g. be done in Matlab using the following command: %% Exercise 1b) >> x=[ 1 1 ; y=[ ; >> ifft(fft(x).*fft(y) >> real(ans) which returns the answer { }. (c) We have a system with a finite impulse response with five non-zero impulse coefficients this together with a straightforward application of the DTFT definition results in H(e iωt ) = T 2 k= 2 h[ke iωt k = T ( e 2iωT + e 2iωT ) + 2T (e iωt + e iωt ) + 3T = 3T + 2T cos(2ωt ) + 4T cos(ωt ). (d) To find the first overtone we use the DFT directly on the signal. The signal that corresponds to the first overtone is then extracted using a Butterworth filter of order 2 (note the normalized frequency which results from the fact that ω =.5 Hz.). %% Exercise 1d >> y1=kron((-1).^(1:2)ones(16)) ; figure(1); % plot the signal >> subplot(311); plot(y1); xlabel( time ); ylabel( signal ); >> axis([ ); % calculate the DFT >> Y1=fft(y1); =length(y1); T=1; f=((1:)-1)/(*t); >> subplot(312); plot(fabs(y1)); xlabel( freq. (Hz) ); ylabel( amplitude ); % filter the signal >> [BA=butter(2.25/.5*[.9 1.1); >> y1filtered=filtfilt(bay1); >> subplot(313); plot(y1filtered); xlabel( time ); ylabel( filtered signal ); Executing this code returns Figure 1 where the first overtone is obtained as the second peak in the middle plot as.25 Hertz. The bottom plot is the filter signal which is a sine which is as expected knowing that a square wave can be written as a Fourier series. 2. The non-parametric spectral analysis can for example by done by using spa or pwelch in Matlab. The command ar estimates an AR model of a given order and bode gives the spectra of the estimated model. The following code applies these commands and returns Figure 2: %% Exericse 2 >> =1; T=1; >> a1=[ ; >> a2=conv([ [ ); >> y2=filter(1a1zeros(1)[1;;;)+filter(1a2randn(1)); >> figure(2); >> subplot(411); plot(y2 k ); xlabel( time ); ylabel( signal ); % DFT analysis 1 Ver: 213/1/8

2 1 signal amplitude filtered signal time freq. (Hz) time Figur 1: The signal its DFT and the filtered signal from exercise 1d. >> Y2=fft(y2); f=2*pi*(:-1)/(*t); >> subplot(412); semilogx(fabs(y2) k ); xlabel( frequency (rad/s) ); ylabel( Amplitude ); >> axis([1e-1 1e1 1e-5 7*1e5); % non-parametric spectral analysis >> [Pw=pwelch(y2); >> subplot(413); loglog(wp k ); >> xlabel( freq. (rad/s) ); ylabel( Power (db) ); axis([1e-1 1e1 1e-5 1e6); % parameteric spectral analysis >> m=ar(y25); >> [magphasew=bode(m); >> subplot(414); loglog(wmag(:) k ); >> xlabel( freq. (rad/s) ); ylabel( Power (db) ); axis([1e-1 1e1 1e-5 1e7); (a) The DFT tells us that there are at least three (the third is small in the DFT) resonance peaks in the data. This is verified by the non-parametric spectral estimate shown as the third plot from the top in the figure where the third peak is more visible (together with a fourth which is corrupted by noise). (b) An AR model of order 5 is enough to find all three peaks. The fourth can be found with an AR model of order 15 but the result is difficult to interpret. (c) To determine the best model we apply the loss function criteria using validation data. The best choice for AR-modelling seems to be AR(4) this is were the loss function has its knee point. This gives a model with 99.15% model fit on validation data but with remaining correlation in the residuals. To remove these correlations a model of order p = 25 is needed. %% AR modelling >> y2e=y2(1:6666); % estimation data >> y2v=y2(6667:end); % validation data % Determine the optimal model order >> lossfunc=[; >> for p=1:2 m=arx(y2ep); 2 Ver: 213/1/8

3 5 signal time 6 x 1 5 Amplitude frequency (rad/s) Power (db) freq. (rad/s) Power (db) freq. (rad/s) Figur 2: The signal its DFT non-parametric spectral estimate and parametric spectral estimate. 3 Ver: 213/1/8

4 yp=predict(y2vm1); lossfunc(p)=mean((y2v-yp).^2); >> end >> figure(3) >> plot(lossfunc); xlabel( model order (p) ); ylabel( loss function ); % estimate a model of order p=4 >> p=4; mar=arx(y2ep); % quick model checks >> compare(y2vmar1); % model fit on validation data >> resid(mary2v); % some patterns left in the data In estimating the ARMA model we start off using varying p and q between and 1 we find that all models with p geq4 and q 1 have almost the same loss function. Using for example p = 1 and q = 2 gives a model fit of 99.18% on validation data with no significant correlation in the residuals. As ARMA(12) is smaller than AR(25) it is the natural choice for a small model with good quality satisfying the model assumptions. %% ARMA modelling % Use try different p and q to optimize the model fit >> lossfunc=zeros(11); >> for p=1:1 >> for q=1:1 m=armax(y2e[p q); yp=predict(y2vm1); lossfunc(pq)=mean((y2v-yp).^2); >> end >> suef(lossfunc) % use e.g. [1 2 >> m=armax(y2e[1 2); >> compare(y2vm1); % model fit on validation data >> resid(my2v) 3. (a) First the signal model must be rewritten on the form of a linear regression. This is done using simple trigonometric identities realising that A sin(ωt + φ) = A sin(ωt) cos(φ) + A cos(ωt) sin(φ) = [ sin(ωt) cos(ωt) [ A cos(φ) }{{} A sin(φ) }{{} ψ (t) so that the model is written as (note that ψ is used instead of the standard notation in the course using ϕ as this character is used for the phase of the sine function in this exercise) y(t) = ψ (t)θ + e(t) i.e. the standard linear regression form. The least square estimate is defined as 1 θ = arg min θ θ ( y(t) ψ (t)θ ) 2 taking the derivative of the right hand side and set it to zero yields = 2 ψ(t) ( y(t) ψ (t)θ ) = 2 ψ(t)y(t) + 2 θ ψ(t)ψ (t) θ = ψ(t)y(t) ψ(t)ψ (t) 4 Ver: 213/1/8

5 where we have θ = [ θ(1) θ (2) = [ A cos(φ). A sin(φ) We see that A can be estimated using a simple application of the Pythagorean trigonometric identity as follows  = ( θ (1) )2 + ( θ (2) )2 and the phase can be estimated using arctan ϕ = arctan arctan (2) [ θ θ (1) (2) [ θ θ (1) (2) [ θ + π π θ (1) which is implemented in the atan2 command in Matlab. θ(1) > θ(2) θ(2) (b) The noise variance can be estimated using the following relation σ 2 e = 1 ɛ 2 (t) = 1 θ (1) < < θ (1) < ( y(t) ϕ (t) θ ) 2 which follows directly from the standard expression for the estimation of the sample variance and the model. 4. (a) According to the assignment the one-step FIR predictor is ŝ(t + 1) = H(q)y(t) = h()y(t) + h(1)y(t 1) The Wiener predictor is found by minimizing the cost function V (h) = 1 2 E(s(t + 1) ŝ(t + 1))2 = 1 2 E(s(t + 1) h()y(t) h(1)y(t 1))2. Since V (h) is a quadratic function we can easily find the unique minimizer simply by computing the dv/dh and solve dv/dh =. = E (y(t) (s(t + 1) h()y(t) h(1)y(t 1))) = h() = E (y(t 1) (s(t + 1) h()y(t) h(1)y(t 1))) =. h(1) The resulting Wiener-Hopf equations are ( ) ( ) Ryy () R yy (1) h() = R yy ( 1) R yy () h(1) ( ) E (s(t + 1)y(t)) E (s(t + 1)y(t 1)) ote that E (s(t + 1)y(t k)) = E (s(t + 1)(s(t k)) + e(t k)) = E(s(t + 1)s(t k)) = R ss (k + 1) where the last equality follows from the fact that s(t + 1) and e(t k) are independent. In order to be able to solve for h = (h() h(1)) we need R yy ( 1) R yy () R yy (1) R ss (1) and R ss (2). It is straightforward to show that R yy ( 1) = R yy (1) = R yy () = R ss(1) = R ss (2) = 4 15 which inserted into (1) results in The MSE for the predictions is defined as h() = h(1) = var(s(t + 1) ŝ(t + 1)) = E(s(t + 1) ŝ(t + 1)) 2 = E((s(t + 1) ŝ(t + 1))s(t + 1)) where the last equality follows from the fact that (s(t + 1) ŝ(t + 1)) is independent of ŝ(t + 1). Hence var(s(t + 1) ŝ(t + 1)) = E(((s(t + 1) h(1)y(t 1))s(t + 1)) = R ss () h(1)r ss (2) = (1) 5 Ver: 213/1/8

6 (b) Based on the model for s(t) it is natural to try a FIR predictor with H(q) = h()q 1 + h(1)q 3 in other words ŝ(t + 1) = h()y(t 1) + h(1)y(t 3). Analogously to the previous assignment using the cost function V (h) = E(s(t + 1) h()y(t 1) h(1)y(t 3)) 2 results in the following Wiener-Hopf equations to be solved = E(y(t 1)(s(t + 1) h()y(t 1) h(1)y(t 3))) = h() = E(y(t 3)(s(t + 1) h()y(t 1) h(1)y(t 3))) =. h(1) The corresponding Wiener-Hopf equations are given by ( ) ( ) Ryy () R yy (2) h() = R yy ( 2) R yy () h(1) resulting in h().127 h(1).159 ( ) Rss (2) (2) R ss (4) The MSE of the prediction error is given by (analogously to the previous assignment) var(ŝ(t + 1) s(t + 1)) = R ss () h()r ss (2) h(1)r ss (4) This error is smaller than the error in the previous assignment. 6 Ver: 213/1/8

Solutions for examination in TSRT78 Digital Signal Processing,

Solutions for examination in TSRT78 Digital Signal Processing, Solutions for examination in TSRT78 Digital Signal Processing, 2014-04-14 1. s(t) is generated by s(t) = 1 w(t), 1 + 0.3q 1 Var(w(t)) = σ 2 w = 2. It is measured as y(t) = s(t) + n(t) where n(t) is white

More information

ω (rad/s)

ω (rad/s) 1. (a) From the figure we see that the signal has energy content in frequencies up to about 15rad/s. According to the sampling theorem, we must therefore sample with at least twice that frequency: 3rad/s

More information

2.3 Oscillation. The harmonic oscillator equation is the differential equation. d 2 y dt 2 r y (r > 0). Its solutions have the form

2.3 Oscillation. The harmonic oscillator equation is the differential equation. d 2 y dt 2 r y (r > 0). Its solutions have the form 2. Oscillation So far, we have used differential equations to describe functions that grow or decay over time. The next most common behavior for a function is to oscillate, meaning that it increases and

More information

Centre for Mathematical Sciences HT 2017 Mathematical Statistics

Centre for Mathematical Sciences HT 2017 Mathematical Statistics Lund University Stationary stochastic processes Centre for Mathematical Sciences HT 2017 Mathematical Statistics Computer exercise 3 in Stationary stochastic processes, HT 17. The purpose of this exercise

More information

INTRODUCTION Noise is present in many situations of daily life for ex: Microphones will record noise and speech. Goal: Reconstruct original signal Wie

INTRODUCTION Noise is present in many situations of daily life for ex: Microphones will record noise and speech. Goal: Reconstruct original signal Wie WIENER FILTERING Presented by N.Srikanth(Y8104060), M.Manikanta PhaniKumar(Y8104031). INDIAN INSTITUTE OF TECHNOLOGY KANPUR Electrical Engineering dept. INTRODUCTION Noise is present in many situations

More information

EL1820 Modeling of Dynamical Systems

EL1820 Modeling of Dynamical Systems EL1820 Modeling of Dynamical Systems Lecture 10 - System identification as a model building tool Experiment design Examination and prefiltering of data Model structure selection Model validation Lecture

More information

Laboratory Project 2: Spectral Analysis and Optimal Filtering

Laboratory Project 2: Spectral Analysis and Optimal Filtering Laboratory Project 2: Spectral Analysis and Optimal Filtering Random signals analysis (MVE136) Mats Viberg and Lennart Svensson Department of Signals and Systems Chalmers University of Technology 412 96

More information

EE538 Final Exam Fall 2007 Mon, Dec 10, 8-10 am RHPH 127 Dec. 10, Cover Sheet

EE538 Final Exam Fall 2007 Mon, Dec 10, 8-10 am RHPH 127 Dec. 10, Cover Sheet EE538 Final Exam Fall 2007 Mon, Dec 10, 8-10 am RHPH 127 Dec. 10, 2007 Cover Sheet Test Duration: 120 minutes. Open Book but Closed Notes. Calculators allowed!! This test contains five problems. Each of

More information

ECE 636: Systems identification

ECE 636: Systems identification ECE 636: Systems identification Lectures 7 8 onparametric identification (continued) Important distributions: chi square, t distribution, F distribution Sampling distributions ib i Sample mean If the variance

More information

Sinusoids. Amplitude and Magnitude. Phase and Period. CMPT 889: Lecture 2 Sinusoids, Complex Exponentials, Spectrum Representation

Sinusoids. Amplitude and Magnitude. Phase and Period. CMPT 889: Lecture 2 Sinusoids, Complex Exponentials, Spectrum Representation Sinusoids CMPT 889: Lecture Sinusoids, Complex Exponentials, Spectrum Representation Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University September 6, 005 Sinusoids are

More information

EEM 409. Random Signals. Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Problem 2:

EEM 409. Random Signals. Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Problem 2: EEM 409 Random Signals Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Consider a random process of the form = + Problem 2: X(t) = b cos(2π t + ), where b is a constant,

More information

CMPT 889: Lecture 2 Sinusoids, Complex Exponentials, Spectrum Representation

CMPT 889: Lecture 2 Sinusoids, Complex Exponentials, Spectrum Representation CMPT 889: Lecture 2 Sinusoids, Complex Exponentials, Spectrum Representation Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University September 26, 2005 1 Sinusoids Sinusoids

More information

EE538 Final Exam Fall :20 pm -5:20 pm PHYS 223 Dec. 17, Cover Sheet

EE538 Final Exam Fall :20 pm -5:20 pm PHYS 223 Dec. 17, Cover Sheet EE538 Final Exam Fall 005 3:0 pm -5:0 pm PHYS 3 Dec. 17, 005 Cover Sheet Test Duration: 10 minutes. Open Book but Closed Notes. Calculators ARE allowed!! This test contains five problems. Each of the five

More information

Introduction to Signal Analysis Parts I and II

Introduction to Signal Analysis Parts I and II 41614 Dynamics of Machinery 23/03/2005 IFS Introduction to Signal Analysis Parts I and II Contents 1 Topics of the Lecture 11/03/2005 (Part I) 2 2 Fourier Analysis Fourier Series, Integral and Complex

More information

Problem Set 9 Solutions

Problem 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 information

Responses of Digital Filters Chapter Intended Learning Outcomes:

Responses of Digital Filters Chapter Intended Learning Outcomes: Responses of Digital Filters Chapter Intended Learning Outcomes: (i) Understanding the relationships between impulse response, frequency response, difference equation and transfer function in characterizing

More information

D.S.G. POLLOCK: BRIEF NOTES

D.S.G. POLLOCK: BRIEF NOTES BIVARIATE SPECTRAL ANALYSIS Let x(t) and y(t) be two stationary stochastic processes with E{x(t)} = E{y(t)} =. These processes have the following spectral representations: (1) x(t) = y(t) = {cos(ωt)da

More information

Overview 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) 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 information

Digital Signal Processing: Signal Transforms

Digital 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 information

LAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011

LAB 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 information

Lecture 4 - Spectral Estimation

Lecture 4 - Spectral Estimation Lecture 4 - Spectral Estimation The Discrete Fourier Transform The Discrete Fourier Transform (DFT) is the equivalent of the continuous Fourier Transform for signals known only at N instants separated

More information

3. ESTIMATION OF SIGNALS USING A LEAST SQUARES TECHNIQUE

3. ESTIMATION OF SIGNALS USING A LEAST SQUARES TECHNIQUE 3. ESTIMATION OF SIGNALS USING A LEAST SQUARES TECHNIQUE 3.0 INTRODUCTION The purpose of this chapter is to introduce estimators shortly. More elaborated courses on System Identification, which are given

More information

Lesson 11: Mass-Spring, Resonance and ode45

Lesson 11: Mass-Spring, Resonance and ode45 Lesson 11: Mass-Spring, Resonance and ode45 11.1 Applied Problem. Trucks and cars have springs and shock absorbers to make a comfortable and safe ride. Without good shock absorbers, the truck or car will

More information

CM2202: Scientific Computing and Multimedia Applications General Maths: 3. Complex Numbers

CM2202: Scientific Computing and Multimedia Applications General Maths: 3. Complex Numbers CM2202: Scientific Computing and Multimedia Applications General Maths: 3. Complex Numbers Prof. David Marshall School of Computer Science & Informatics A problem when solving some equations There are

More information

Lecture 7: Discrete-time Models. Modeling of Physical Systems. Preprocessing Experimental Data.

Lecture 7: Discrete-time Models. Modeling of Physical Systems. Preprocessing Experimental Data. ISS0031 Modeling and Identification Lecture 7: Discrete-time Models. Modeling of Physical Systems. Preprocessing Experimental Data. Aleksei Tepljakov, Ph.D. October 21, 2015 Discrete-time Transfer Functions

More information

INFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters 4. THE BUTTERWORTH ANALOG FILTER

INFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters 4. THE BUTTERWORTH ANALOG FILTER INFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters. INTRODUCTION 2. IIR FILTER DESIGN 3. ANALOG FILTERS 4. THE BUTTERWORTH ANALOG FILTER 5. THE CHEBYSHEV-I

More information

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform Signals and Systems Problem Set: The z-transform and DT Fourier Transform Updated: October 9, 7 Problem Set Problem - Transfer functions in MATLAB A discrete-time, causal LTI system is described by the

More information

Problem Value Score No/Wrong Rec

Problem Value Score No/Wrong Rec GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING QUIZ #2 DATE: 14-Oct-11 COURSE: ECE-225 NAME: GT username: LAST, FIRST (ex: gpburdell3) 3 points 3 points 3 points Recitation

More information

EE482: Digital Signal Processing Applications

EE482: Digital Signal Processing Applications Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:30-15:45 CBC C222 Lecture 02 DSP Fundamentals 14/01/21 http://www.ee.unlv.edu/~b1morris/ee482/

More information

X random; interested in impact of X on Y. Time series analogue of regression.

X random; interested in impact of X on Y. Time series analogue of regression. Multiple time series Given: two series Y and X. Relationship between series? Possible approaches: X deterministic: regress Y on X via generalized least squares: arima.mle in SPlus or arima in R. We have

More information

Experimental Fourier Transforms

Experimental Fourier Transforms Chapter 5 Experimental Fourier Transforms 5.1 Sampling and Aliasing Given x(t), we observe only sampled data x s (t) = x(t)s(t; T s ) (Fig. 5.1), where s is called sampling or comb function and can be

More information

Signals and Systems Laboratory with MATLAB

Signals and Systems Laboratory with MATLAB Signals and Systems Laboratory with MATLAB Alex Palamides Anastasia Veloni @ CRC Press Taylor &. Francis Group Boca Raton London NewYork CRC Press is an imprint of the Taylor & Francis Group, an informa

More information

w n = c k v n k (1.226) w n = c k v n k + d k w n k (1.227) Clearly non-recursive filters are a special case of recursive filters where M=0.

w n = c k v n k (1.226) w n = c k v n k + d k w n k (1.227) Clearly non-recursive filters are a special case of recursive filters where M=0. Random Data 79 1.13 Digital Filters There are two fundamental types of digital filters Non-recursive N w n = c k v n k (1.226) k= N and recursive N M w n = c k v n k + d k w n k (1.227) k= N k=1 Clearly

More information

Velocity estimates from sampled position data

Velocity estimates from sampled position data Velocity estimates from sampled position data It is often the case that position information has been sampled from continuous process and it is desired to estimate the velocity and acceleration. Example

More information

TTT4120 Digital Signal Processing Suggested Solutions for Problem Set 2

TTT4120 Digital Signal Processing Suggested Solutions for Problem Set 2 Norwegian University of Science and Technology Department of Electronics and Telecommunications TTT42 Digital Signal Processing Suggested Solutions for Problem Set 2 Problem (a) The spectrum X(ω) can be

More information

E 4101/5101 Lecture 6: Spectral analysis

E 4101/5101 Lecture 6: Spectral analysis E 4101/5101 Lecture 6: Spectral analysis Ragnar Nymoen 3 March 2011 References to this lecture Hamilton Ch 6 Lecture note (on web page) For stationary variables/processes there is a close correspondence

More information

Examination with solution suggestions SSY130 Applied Signal Processing

Examination with solution suggestions SSY130 Applied Signal Processing Examination with solution suggestions SSY3 Applied Signal Processing Jan 8, 28 Rules Allowed aids at exam: L. Råde and B. Westergren, Mathematics Handbook (any edition, including the old editions called

More information

Advanced Digital Signal Processing -Introduction

Advanced Digital Signal Processing -Introduction Advanced Digital Signal Processing -Introduction LECTURE-2 1 AP9211- ADVANCED DIGITAL SIGNAL PROCESSING UNIT I DISCRETE RANDOM SIGNAL PROCESSING Discrete Random Processes- Ensemble Averages, Stationary

More information

EE482: Digital Signal Processing Applications

EE482: Digital Signal Processing Applications Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:305:45 CBC C222 Lecture 8 Frequency Analysis 14/02/18 http://www.ee.unlv.edu/~b1morris/ee482/

More information

Core Concepts Review. Orthogonality of Complex Sinusoids Consider two (possibly non-harmonic) complex sinusoids

Core 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 information

E : Lecture 1 Introduction

E : 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 information

Solutions. Chapter 5. Problem 5.1. Solution. Consider the driven, two-well Duffing s oscillator. which can be written in state variable form as

Solutions. Chapter 5. Problem 5.1. Solution. Consider the driven, two-well Duffing s oscillator. which can be written in state variable form as Chapter 5 Solutions Problem 5.1 Consider the driven, two-well Duffing s oscillator which can be written in state variable form as ẍ + ɛγẋ x + x 3 = ɛf cos(ωt) ẋ = v v = x x 3 + ɛ( γv + F cos(ωt)). In the

More information

HW13 Solutions. Pr (a) The DTFT of c[n] is. C(e jω ) = 0.5 m e jωm e jω + 1

HW13 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 information

Step Response Analysis. Frequency Response, Relation Between Model Descriptions

Step Response Analysis. Frequency Response, Relation Between Model Descriptions Step Response Analysis. Frequency Response, Relation Between Model Descriptions Automatic Control, Basic Course, Lecture 3 November 9, 27 Lund University, Department of Automatic Control Content. Step

More information

Introduction to DSP Time Domain Representation of Signals and Systems

Introduction to DSP Time Domain Representation of Signals and Systems Introduction to DSP Time Domain Representation of Signals and Systems Dr. Waleed Al-Hanafy waleed alhanafy@yahoo.com Faculty of Electronic Engineering, Menoufia Univ., Egypt Digital Signal Processing (ECE407)

More information

The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Final May 4, 2012

The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Final May 4, 2012 The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Final May 4, 2012 Time: 3 hours. Close book, closed notes. No calculators. Part I: ANSWER ALL PARTS. WRITE

More information

Continuous-Time Frequency Response (II) Lecture 28: EECS 20 N April 2, Laurent El Ghaoui

Continuous-Time Frequency Response (II) Lecture 28: EECS 20 N April 2, Laurent El Ghaoui EECS 20 N April 2, 2001 Lecture 28: Continuous-Time Frequency Response (II) Laurent El Ghaoui 1 annoucements homework due on Wednesday 4/4 at 11 AM midterm: Friday, 4/6 includes all chapters until chapter

More information

Exercise 8: Frequency Response of MIMO Systems

Exercise 8: Frequency Response of MIMO Systems Exercise 8: Frequency Response of MIMO Systems 8 Singular Value Decomposition (SVD The Singular Value Decomposition plays a central role in MIMO frequency response analysis Let s recall some concepts from

More information

CONTROL SYSTEMS, ROBOTICS, AND AUTOMATION - Vol. V - Prediction Error Methods - Torsten Söderström

CONTROL SYSTEMS, ROBOTICS, AND AUTOMATION - Vol. V - Prediction Error Methods - Torsten Söderström PREDICTIO ERROR METHODS Torsten Söderström Department of Systems and Control, Information Technology, Uppsala University, Uppsala, Sweden Keywords: prediction error method, optimal prediction, identifiability,

More information

DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A

DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A Classification of systems : Continuous and Discrete

More information

Solutions - Homework # 3

Solutions - 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 information

Review of Linear System Theory

Review of Linear System Theory Review of Linear System Theory The following is a (very) brief review of linear system theory and Fourier analysis. I work primarily with discrete signals. I assume the reader is familiar with linear algebra

More information

Continuous and Discrete Time Signals and Systems

Continuous and Discrete Time Signals and Systems Continuous and Discrete Time Signals and Systems Mrinal Mandal University of Alberta, Edmonton, Canada and Amir Asif York University, Toronto, Canada CAMBRIDGE UNIVERSITY PRESS Contents Preface Parti Introduction

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Mechanical Engineering Dynamics and Control II Fall 2007

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Mechanical Engineering Dynamics and Control II Fall 2007 MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Mechanical Engineering.4 Dynamics and Control II Fall 7 Problem Set #9 Solution Posted: Sunday, Dec., 7. The.4 Tower system. The system parameters are

More information

Roll No. :... Invigilator s Signature :.. CS/B.Tech (EE-N)/SEM-6/EC-611/ DIGITAL SIGNAL PROCESSING. Time Allotted : 3 Hours Full Marks : 70

Roll No. :... Invigilator s Signature :.. CS/B.Tech (EE-N)/SEM-6/EC-611/ DIGITAL SIGNAL PROCESSING. Time Allotted : 3 Hours Full Marks : 70 Name : Roll No. :.... Invigilator s Signature :.. CS/B.Tech (EE-N)/SEM-6/EC-611/2011 2011 DIGITAL SIGNAL PROCESSING Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks.

More information

LABORATORY 1 DISCRETE-TIME SIGNALS

LABORATORY 1 DISCRETE-TIME SIGNALS LABORATORY DISCRETE-TIME SIGNALS.. Introduction A discrete-time signal is represented as a sequence of numbers, called samples. A sample value of a typical discrete-time signal or sequence is denoted as:

More information

Problem Set 1 Solution Sketches Time Series Analysis Spring 2010

Problem Set 1 Solution Sketches Time Series Analysis Spring 2010 Problem Set 1 Solution Sketches Time Series Analysis Spring 2010 1. Construct a martingale difference process that is not weakly stationary. Simplest e.g.: Let Y t be a sequence of independent, non-identically

More information

Linear Prediction 1 / 41

Linear Prediction 1 / 41 Linear Prediction 1 / 41 A map of speech signal processing Natural signals Models Artificial signals Inference Speech synthesis Hidden Markov Inference Homomorphic processing Dereverberation, Deconvolution

More information

Discrete-Time Gaussian Fourier Transform Pair, and Generating a Random Process with Gaussian PDF and Power Spectrum Mark A.

Discrete-Time Gaussian Fourier Transform Pair, and Generating a Random Process with Gaussian PDF and Power Spectrum Mark A. Discrete-Time Gaussian Fourier Transform Pair, and Generating a Random Process with Gaussian PDF and Power Spectrum Mark A. Richards October 3, 6 Updated April 5, Gaussian Transform Pair in Continuous

More information

Further Results on Model Structure Validation for Closed Loop System Identification

Further Results on Model Structure Validation for Closed Loop System Identification Advances in Wireless Communications and etworks 7; 3(5: 57-66 http://www.sciencepublishinggroup.com/j/awcn doi:.648/j.awcn.735. Further esults on Model Structure Validation for Closed Loop System Identification

More information

Summary of lecture 1. E x = E x =T. X T (e i!t ) which motivates us to define the energy spectrum Φ xx (!) = jx (i!)j 2 Z 1 Z =T. 2 d!

Summary of lecture 1. E x = E x =T. X T (e i!t ) which motivates us to define the energy spectrum Φ xx (!) = jx (i!)j 2 Z 1 Z =T. 2 d! Summary of lecture I Continuous time: FS X FS [n] for periodic signals, FT X (i!) for non-periodic signals. II Discrete time: DTFT X T (e i!t ) III Poisson s summation formula: describes the relationship

More information

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 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 information

Laboratory handout 5 Mode shapes and resonance

Laboratory handout 5 Mode shapes and resonance laboratory handouts, me 34 82 Laboratory handout 5 Mode shapes and resonance In this handout, material and assignments marked as optional can be skipped when preparing for the lab, but may provide a useful

More information

System Modeling and Identification CHBE 702 Korea University Prof. Dae Ryook Yang

System Modeling and Identification CHBE 702 Korea University Prof. Dae Ryook Yang System Modeling and Identification CHBE 702 Korea University Prof. Dae Ryook Yang 1-1 Course Description Emphases Delivering concepts and Practice Programming Identification Methods using Matlab Class

More information

Nov EXAM INFO DB Victor Phillip Dahdaleh Building (DB) - TEL building

Nov EXAM INFO DB Victor Phillip Dahdaleh Building (DB) - TEL building ESSE 4020 / ESS 5020 Time Series and Spectral Analysis Nov 21 2016 EXAM INFO Sun, 11 Dec 2016 19:00-22:00 DB 0014 - Victor Phillip Dahdaleh Building (DB) - TEL building Fourier series and Spectral Analysis,

More information

Adaptive Filtering. Squares. Alexander D. Poularikas. Fundamentals of. Least Mean. with MATLABR. University of Alabama, Huntsville, AL.

Adaptive Filtering. Squares. Alexander D. Poularikas. Fundamentals of. Least Mean. with MATLABR. University of Alabama, Huntsville, AL. Adaptive Filtering Fundamentals of Least Mean Squares with MATLABR Alexander D. Poularikas University of Alabama, Huntsville, AL CRC Press Taylor & Francis Croup Boca Raton London New York CRC Press is

More information

Notes on the Periodically Forced Harmonic Oscillator

Notes on the Periodically Forced Harmonic Oscillator Notes on the Periodically orced Harmonic Oscillator Warren Weckesser Math 38 - Differential Equations 1 The Periodically orced Harmonic Oscillator. By periodically forced harmonic oscillator, we mean the

More information

Chapter 3 Data Acquisition and Manipulation

Chapter 3 Data Acquisition and Manipulation 1 Chapter 3 Data Acquisition and Manipulation In this chapter we introduce z transf orm, or the discrete Laplace Transform, to solve linear recursions. Section 3.1 z-transform Given a data stream x {x

More information

Lab 4: Quantization, Oversampling, and Noise Shaping

Lab 4: Quantization, Oversampling, and Noise Shaping Lab 4: Quantization, Oversampling, and Noise Shaping Due Friday 04/21/17 Overview: This assignment should be completed with your assigned lab partner(s). Each group must turn in a report composed using

More information

Discrete Time Systems

Discrete 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 information

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 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 information

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by Code No: RR320402 Set No. 1 III B.Tech II Semester Regular Examinations, Apr/May 2006 DIGITAL SIGNAL PROCESSING ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering,

More information

Digital Signal Processing, Lecture 2 Frequency description continued, DFT

Digital Signal Processing, Lecture 2 Frequency description continued, DFT Outline cture 2 2 Digital Signal Processing, cture 2 Frequency description continued, DFT Thomas Schön Division of Automatic Control Department of Electrical Engineering Linköping i University it E-mail:

More information

Problem Sheet 1 Examples of Random Processes

Problem Sheet 1 Examples of Random Processes RANDOM'PROCESSES'AND'TIME'SERIES'ANALYSIS.'PART'II:'RANDOM'PROCESSES' '''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''Problem'Sheets' Problem Sheet 1 Examples of Random Processes 1. Give

More information

Practical Spectral Estimation

Practical Spectral Estimation Digital Signal Processing/F.G. Meyer Lecture 4 Copyright 2015 François G. Meyer. All Rights Reserved. Practical Spectral Estimation 1 Introduction The goal of spectral estimation is to estimate how the

More information

CHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME

CHAPTER 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 information

CMPT 889: Lecture 5 Filters

CMPT 889: Lecture 5 Filters CMPT 889: Lecture 5 Filters Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University October 7, 2009 1 Digital Filters Any medium through which a signal passes may be regarded

More information

2A1H Time-Frequency Analysis II

2A1H Time-Frequency Analysis II 2AH Time-Frequency Analysis II Bugs/queries to david.murray@eng.ox.ac.uk HT 209 For any corrections see the course page DW Murray at www.robots.ox.ac.uk/ dwm/courses/2tf. (a) A signal g(t) with period

More information

Digital Filters. Linearity and Time Invariance. Linear Time-Invariant (LTI) Filters: CMPT 889: Lecture 5 Filters

Digital Filters. Linearity and Time Invariance. Linear Time-Invariant (LTI) Filters: CMPT 889: Lecture 5 Filters Digital Filters CMPT 889: Lecture 5 Filters Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University October 7, 29 Any medium through which a signal passes may be regarded as

More information

Inverse Circular Functions and Trigonometric Equations. Copyright 2017, 2013, 2009 Pearson Education, Inc.

Inverse Circular Functions and Trigonometric Equations. Copyright 2017, 2013, 2009 Pearson Education, Inc. 6 Inverse Circular Functions and Trigonometric Equations Copyright 2017, 2013, 2009 Pearson Education, Inc. 1 6.2 Trigonometric Equations Linear Methods Zero-Factor Property Quadratic Methods Trigonometric

More information

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some

More information

GATE EE Topic wise Questions SIGNALS & SYSTEMS

GATE 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 information

Complement on Digital Spectral Analysis and Optimal Filtering: Theory and Exercises

Complement on Digital Spectral Analysis and Optimal Filtering: Theory and Exercises Complement on Digital Spectral Analysis and Optimal Filtering: Theory and Exercises Random Processes With Applications (MVE 135) Mats Viberg Department of Signals and Systems Chalmers University of Technology

More information

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University ENSC327 Communications Systems 2: Fourier Representations Jie Liang School of Engineering Science Simon Fraser University 1 Outline Chap 2.1 2.5: Signal Classifications Fourier Transform Dirac Delta Function

More information

Biomedical Signal Processing and Signal Modeling

Biomedical Signal Processing and Signal Modeling Biomedical Signal Processing and Signal Modeling Eugene N. Bruce University of Kentucky A Wiley-lnterscience Publication JOHN WILEY & SONS, INC. New York Chichester Weinheim Brisbane Singapore Toronto

More information

12. Prediction Error Methods (PEM)

12. Prediction Error Methods (PEM) 12. Prediction Error Methods (PEM) EE531 (Semester II, 2010) description optimal prediction Kalman filter statistical results computational aspects 12-1 Description idea: determine the model parameter

More information

Exercises in Digital Signal Processing

Exercises in Digital Signal Processing Exercises in Digital Signal Processing Ivan W. Selesnick September, 5 Contents The Discrete Fourier Transform The Fast Fourier Transform 8 3 Filters and Review 4 Linear-Phase FIR Digital Filters 5 5 Windows

More information

DFT & Fast Fourier Transform PART-A. 7. Calculate the number of multiplications needed in the calculation of DFT and FFT with 64 point sequence.

DFT & Fast Fourier Transform PART-A. 7. Calculate the number of multiplications needed in the calculation of DFT and FFT with 64 point sequence. SHRI ANGALAMMAN COLLEGE OF ENGINEERING & TECHNOLOGY (An ISO 9001:2008 Certified Institution) SIRUGANOOR,TRICHY-621105. DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING UNIT I DFT & Fast Fourier

More information

Random signals II. ÚPGM FIT VUT Brno,

Random signals II. ÚPGM FIT VUT Brno, Random signals II. Jan Černocký ÚPGM FIT VUT Brno, cernocky@fit.vutbr.cz 1 Temporal estimate of autocorrelation coefficients for ergodic discrete-time random process. ˆR[k] = 1 N N 1 n=0 x[n]x[n + k],

More information

CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation

CMPT 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 information

EEE508 GÜÇ SİSTEMLERİNDE SİNYAL İŞLEME

EEE508 GÜÇ SİSTEMLERİNDE SİNYAL İŞLEME EEE508 GÜÇ SİSTEMLERİNDE SİNYAL İŞLEME Signal Processing for Power System Applications Frequency Domain Analysis Techniques Parametric Methods for Line Spectra (Week-5-6) Gazi Üniversitesi, Elektrik ve

More information

Lecture 19: Bayesian Linear Estimators

Lecture 19: Bayesian Linear Estimators ECE 830 Fall 2010 Statistical Signal Processing instructor: R Nowa, scribe: I Rosado-Mendez Lecture 19: Bayesian Linear Estimators 1 Linear Minimum Mean-Square Estimator Suppose our data is set X R n,

More information

Introduction to system identification

Introduction to system identification Introduction to system identification Jan Swevers July 2006 0-0 Introduction to system identification 1 Contents of this lecture What is system identification Time vs. frequency domain identification Discrete

More information

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM Dr. Lim Chee Chin Outline Introduction Discrete Fourier Series Properties of Discrete Fourier Series Time domain aliasing due to frequency

More information

Review of Frequency Domain Fourier Series: Continuous periodic frequency components

Review 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 information

Like bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform.

Like 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 information

Non-parametric identification

Non-parametric identification Non-parametric Non-parametric Transient Step-response using Spectral Transient Correlation Frequency function estimate Spectral System Identification, SSY230 Non-parametric 1 Non-parametric Transient Step-response

More information

Contents. Digital Signal Processing, Part II: Power Spectrum Estimation

Contents. Digital Signal Processing, Part II: Power Spectrum Estimation Contents Digital Signal Processing, Part II: Power Spectrum Estimation 5. Application of the FFT for 7. Parametric Spectrum Est. Filtering and Spectrum Estimation 7.1 ARMA-Models 5.1 Fast Convolution 7.2

More information

Discrete-Time Fourier Transform

Discrete-Time Fourier Transform Discrete-Time Fourier Transform Chapter Intended Learning Outcomes: (i) (ii) (iii) Represent discrete-time signals using discrete-time Fourier transform Understand the properties of discrete-time Fourier

More information

Raktim Bhattacharya. . AERO 632: Design of Advance Flight Control System. Preliminaries

Raktim Bhattacharya. . AERO 632: Design of Advance Flight Control System. Preliminaries . AERO 632: of Advance Flight Control System. Preliminaries Raktim Bhattacharya Laboratory For Uncertainty Quantification Aerospace Engineering, Texas A&M University. Preliminaries Signals & Systems Laplace

More information