CH5350: Applied Time-Series Analysis

Similar documents
Discrete-time Fourier Series (DTFS)

Moving Average (MA) representations

Estimating trends using filters

13. Power Spectrum. For a deterministic signal x(t), the spectrum is well defined: If represents its Fourier transform, i.e., if.

System Identification

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science : Discrete-Time Signal Processing

ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process

SF2943: TIME SERIES ANALYSIS COMMENTS ON SPECTRAL DENSITIES

7 The Waveform Channel

Introduction to Statistical Hypothesis Testing

Probability and Statistics for Final Year Engineering Students

System Identification

X (z) = n= 1. Ã! X (z) x [n] X (z) = Z fx [n]g x [n] = Z 1 fx (z)g. r n x [n] ª e jnω

Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes

Lecture Wigner-Ville Distributions

ARMA Models: I VIII 1

Aspects of Continuous- and Discrete-Time Signals and Systems

Nonparametric and Parametric Defined This text distinguishes between systems and the sequences (processes) that result when a WN input is applied

Ch.11 The Discrete-Time Fourier Transform (DTFT)

Signals and Spectra - Review

Probability Space. J. McNames Portland State University ECE 538/638 Stochastic Signals Ver

CCNY. BME I5100: Biomedical Signal Processing. Stochastic Processes. Lucas C. Parra Biomedical Engineering Department City College of New York

Prof. Dr.-Ing. Armin Dekorsy Department of Communications Engineering. Stochastic Processes and Linear Algebra Recap Slides

(i) Represent discrete-time signals using transform. (ii) Understand the relationship between transform and discrete-time Fourier transform

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

Stochastic Processes- IV

2. SPECTRAL ANALYSIS APPLIED TO STOCHASTIC PROCESSES

CHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME

SRI VIDYA COLLEGE OF ENGINEERING AND TECHNOLOGY UNIT 3 RANDOM PROCESS TWO MARK QUESTIONS

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

Stochastic Processes (Master degree in Engineering) Franco Flandoli

Bias. Definition. One of the foremost expectations of an estimator is that it gives accurate estimates.

(Infinite) Series Series a n = a 1 + a 2 + a a n +...

Deterministic. Deterministic data are those can be described by an explicit mathematical relationship

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

Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals

Random signals II. ÚPGM FIT VUT Brno,

8 The Discrete Fourier Transform (DFT)

EE531 (Semester II, 2010) 6. Spectral analysis. power spectral density. periodogram analysis. window functions 6-1

The Continuous-time Fourier

EE123 Digital Signal Processing

A=randn(500,100); mu=mean(a); sigma_a=std(a); std_a=sigma_a/sqrt(500); [std(mu) mean(std_a)] % compare standard deviation of means % vs standard error

Class 1: Stationary Time Series Analysis

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

Discrete-Time Fourier Transform

EE482: Digital Signal Processing Applications

Process Control & Instrumentation (CH 3040)

EE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley

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

EE123 Digital Signal Processing

Fourier Analysis of Stationary and Non-Stationary Time Series

Practical Spectral Estimation

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

Responses of Digital Filters Chapter Intended Learning Outcomes:

Module 3. Convolution. Aim

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

Fundamentals of Noise

Notes on Time Series Modeling

Parametric Inference on Strong Dependence

Lecture 19: Discrete Fourier Series

The Z-Transform. Fall 2012, EE123 Digital Signal Processing. Eigen Functions of LTI System. Eigen Functions of LTI System

BME 50500: Image and Signal Processing in Biomedicine. Lecture 5: Correlation and Power-Spectrum CCNY

(i) Understanding the characteristics and properties of DTFT

EE123 Digital Signal Processing

Akaike criterion: Kullback-Leibler discrepancy

Time Series 3. Robert Almgren. Sept. 28, 2009

Continuous-Time Fourier Transform

Chirp Transform for FFT

6.435, System Identification

Stochastic Processes. A stochastic process is a function of two variables:

EE123 Digital Signal Processing

Introduction to Statistical Hypothesis Testing

Empirical Macroeconomics

Lecture 27 Frequency Response 2

The Discrete-Time Fourier

Correlator I. Basics. Chapter Introduction. 8.2 Digitization Sampling. D. Anish Roshi

System Identification (CH 5230)

The goal of the Wiener filter is to filter out noise that has corrupted a signal. It is based on a statistical approach.

Computer Engineering 4TL4: Digital Signal Processing

Lecture Notes 7 Stationary Random Processes. Strict-Sense and Wide-Sense Stationarity. Autocorrelation Function of a Stationary Process

P 1.5 X 4.5 / X 2 and (iii) The smallest value of n for

Stochastic Dynamics of SDOF Systems (cont.).

Review of Analog Signal Analysis

Stochastic Processes. M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno

Empirical Macroeconomics

Time Series Models and Inference. James L. Powell Department of Economics University of California, Berkeley

Stochastic Process II Dr.-Ing. Sudchai Boonto

Stochastic Processes: I. consider bowl of worms model for oscilloscope experiment:

Classical Decomposition Model Revisited: I

6. Wiener and Kalman Filters

The Discrete-time Fourier Transform

Review of Fourier Transform

E 4101/5101 Lecture 6: Spectral analysis

9 Brownian Motion: Construction

Spectral Analysis of Random Processes

Introduction to Probability and Stochastic Processes I

6.003: Signal Processing

Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes (cont d)

信號與系統 Signals and Systems

EE123 Digital Signal Processing

Transcription:

CH5350: Applied Time-Series Analysis Arun K. Tangirala Department of Chemical Engineering, IIT Madras Spectral Representations of Random Signals Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 1

Opening remarks We have learnt, until this point, how to represent deterministic signals (and systems) in the frequency-domain using Fourier series / transforms. I Signal decomposition results in also energy / power decomposition (as the case maybe) by virtue of Parseval s relations. I Signal decomposition is primarily useful in filtering and signal estimation, whereas power / energy decomposition is useful in detection of periodic components / frequency content of signals. I Fourier analysis, as we have seen, is the key to characterizing the frequency response of LTI systems and analyzing their filtering nature, Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 2

Analysis of stochastic processes Frequency-domain analysis of random signals is, however, not as straightforward, primarily because, Fourier transforms of random signals do not exist. I Random signals are, in general, aperiodic, butwith infinite energy (they exist forever, by definition). They are, in fact, power signals. I Periodic stationary random signals also exist, but, one cannot construct a Fourier series for such signals (in the usual sense) either. Does this rule out the possibility of constructing a Fourier / spectral representation of random signals? Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 3

Fourier analysis of random signals In the frequency-domain analysis of random signals we are primarily interested in power / energy decomposition rather than signal decomposition, becausewewouldliketo characterize the random process and not necessarily the realization. Since stationary random signals (both periodic and aperiodic) are power signals, we may think of a power spectral density for the random process. I However, we cannot adopt the approach used for deterministic signals. Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 4

Spectral analysis of random signals Arigorouswayofdefiningpowerspectraldensity(p.s.d.)ofarandomsignalisthrough Wiener s generalized harmonic analysis (GHA). Roughly stated, the GHA is an extension of Fourier transforms / series to handle random signals, wherein the Fourier transforms / coe cients of expansion are random variables. An alternative route takes a semi-formal approach to arrive at the same expression for p.s.d. as through Weiner s GHA. The most widely used route is, however, through the Wiener-Khinchin relation. Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 5

Three di erent approaches to p.s.d. 1. Semi-formal approach: Construct the spectral density as the ensemble average of the empirical spectral density of a finite-length realization in the limit as N!1. 2. Wiener-Khinchin relation: One of the most fundamental results in spectral analysis of stochastic processes, it allows us to compute the spectral density as the Fourier transform of the ACVF. This is perhaps the most widely used approach. 3. Wiener s GHA: A generalization of the Fourier analysis to the class of signals which are neither periodic nor finite-energy, aperiodic signals (e.g., cos p 2k). It is theoretically sound, but also involves the use of advanced mathematical concepts, e.g., stochastic integrals. Focus: First two approaches and the conditions for the existence of a spectral density. Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 6

Semi-formal approach Consider a length-n sample record of a random signal. Compute the periodogram, i.e., the empirical p.s.d., ofthefinite-lengthrealization (i,n) vv (! n )= V N(! n ) 2 2 N = 1 2 N NX 1 k=0 v (i) [k]e j! nk 2 where V N (! n ) is the N-point DFT of the finite length realization. Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 7

Semi-formal approach The spectral density of the random signal is the ensemble average (expectation) of the density in the limiting case of N!1 vv(!) = lim N!1 (i,n) E( vv (! n )) = lim E N!1 VN (! n ) 2 2 N The spectral density exists when the limit of average of periodogram exists. Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 8

When does the empirical definition exist? In order to determine the conditions of existence, we begin by writing V N (! n ) 2 = V N (! n )V? N(! n )= NX 1 k=0 v[k]e j! nk NX 1 m=0 v[m]e j! nm Next, take expectations and introduce a change of variable l = k m to obtain, vv(!) = 1 2 lim NX 1 N!1 l= (N 1) f N (l) vv [l]e j!l, where f N (l) =1 l N Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 9

Conditions for existence Now, importantly, assumethat vv[l] is absolutely convergent, i.e., 1X l= 1 vv[l] < 1 Further, that it decays su ciently fast, P 1 l= 1 l vv[l] < 1. Under these conditions, the limit converges and the p.s.d. is obtained as, vv(!) = l=1 X l= 1 vv[l]e j!l Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 10

Wiener-Khinchin Theorem Recall that the DTFT of a sequence exists only if it is absolutely convergent. Thus, the p.s.d. of a signal is defined only if its ACVF is absolutely convergent. This leads us to the familiar Wiener-Khinchin theorem or the spectral representation theorem. Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 11

Spectral Representation / Wiener-Khinchin Theorem W-K Theorem (Shumway and Sto er, 2006) Any stationary process with ACVF 1X l= 1 has the spectral representation vv [l] satisfying vv[l] < 1 (absolutely summable) vv[l] = Z vv(!)e j!l d!, where vv(!) = 1 2 1X l= 1 vv[l]e j!l apple!< vv(!) is known as the spectral density. Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 12

W-K Theorem: Remarks I It is one of the milestone results in the analysis of linear random processes. I Recall that a similar version also exists for aperiodic, finite-energy, deterministic signals. The p.s.d. is replaced by e.s.d. (energy spectral density). Thus, it provides a unified definition for both deterministic and stochastic signals. I It establishes a direct connection between the second-order statistical properties in time to second-order properties in frequency domain. I The inverse result o ers an alternative way of computing the ACVF of a signal. A more general statement of the theorem unifies both classes of random signals, the ones with absolutely convergent ACVFs and the ones with periodic ACVFs (harmonic processes). Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 13

Spectral Representation of a WN process Recall that the ACVF of WN is an impulse centered at lag l =0, PSD of White-Noise process The WN process is a stationary process with a constant p.s.d. ee(!) = 1 2 1X l= 1 ee[l]e j!l = 2 e 2, apple! apple Spectral Density! 2 All frequencies contribute uniformly to the power of a WN process (as in white light). Hence the name. 0.0 0.1 0.2 0.3 0.4 0.5 Frequency Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 14

Auto-correlated processes Coloured Noise We can also examine the spectral density of AR and MA processes. Two examples are taken up: (i) an MA(1) process and an (ii) an AR(1) process 8 >< 1.36 l =0 vv[l] = 0.6 l =1 (MA(1)) vv[l] = 4 >: 3 (0.5) l 8l (AR(1)) 0 l 2 Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 15

PSD of MA(1) and AR(1) processes PSD of an MA(1) process: x[k] = e[k] + 0.6e[k-1] PSD of an AR(1) process: x[k] = 0.5x[k-1] + e[k] Spectral Density 0.5 1.0 1.5 2.0 2.5 The spectral density is a function of the frequency unlike the white noise. Correlated processes therefore acquire the name coloured noise. Spectral Density 0.5 1.0 1.5 2.0 2.5 3.0 3.5 4.0 0.0 0.1 0.2 0.3 0.4 0.5 Frequency 0.0 0.1 0.2 0.3 0.4 0.5 Frequency Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 16

Obtaining p.s.d. from time-series models The p.s.d. of a random process was computed using its ACVF and the W-K theorem. However, if a time-series model exists, the p.s.d. can be computed directly from the transfer function as: vv(!) = H(e j! ) 2 ee(!) = H(e j! ) 2 2 e (1) 2 1X where H(e j! )=DTFT(h[k]) = h[k]e j!k (2) k= 1 Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 17

PSD from Model Derivation: Start with the general definition of a linear random process 1X 1X v[k] = h[m]e[k m] =) vv [l] = h[m]h[l m] m= 1 m= 1 2 ee Taking (discrete-time) Fourier Transform on both sides yields the main result. The p.s.d. of a linear random process is / the squared magnitude of its FRF Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 18