Time Series Spectral Representation

Slides:



Advertisements
Similar presentations
| Page Angelo Farina UNIPR | All Rights Reserved | Confidential Digital sound processing Convolution Digital Filters FFT.
Advertisements

Digital Kommunikationselektronik TNE027 Lecture 5 1 Fourier Transforms Discrete Fourier Transform (DFT) Algorithms Fast Fourier Transform (FFT) Algorithms.
Lecture 15 Orthogonal Functions Fourier Series. LGA mean daily temperature time series is there a global warming signal?
Thursday, October 12, Fourier Transform (and Inverse Fourier Transform) Last Class How to do Fourier Analysis (IDL, MATLAB) What is FFT?? What about.
Lecture 7 Linear time invariant systems
1 LES of Turbulent Flows: Lecture 4 (ME EN ) Prof. Rob Stoll Department of Mechanical Engineering University of Utah Spring 2011.
Meet the professor Friday, January 23 at SFU 4:30 Beer and snacks reception.
Statistical analysis and modeling of neural data Lecture 17 Bijan Pesaran 12 November, 2007.
Image Enhancement in the Frequency Domain Part I Image Enhancement in the Frequency Domain Part I Dr. Samir H. Abdul-Jauwad Electrical Engineering Department.
The Fourier transform. Properties of Fourier transforms Convolution Scaling Translation.
Environmental Data Analysis with MatLab Lecture 24: Confidence Limits of Spectra; Bootstraps.
Global processes Problems such as global warming require modeling of processes that take place on the globe (an oriented sphere). Optimal prediction of.
Analogue and digital techniques in closed loop regulation applications Digital systems Sampling of analogue signals Sample-and-hold Parseval’s theorem.
Sep 20, 2005CS477: Analog and Digital Communications1 Random variables, Random processes Analog and Digital Communications Autumn
Introduction To Signal Processing & Data Analysis
Systems: Definition Filter
Review of Probability.
Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Discrete-Time and System (A Review)
Fourier Series Summary (From Salivahanan et al, 2002)
Time Series Spectral Representation Z(t) = {Z 1, Z 2, Z 3, … Z n } Any mathematical function has a representation in terms of sin and cos functions.
1 The Fourier Series for Discrete- Time Signals Suppose that we are given a periodic sequence with period N. The Fourier series representation for x[n]
Lecture 2 Signals and Systems (I)
Module 2 SPECTRAL ANALYSIS OF COMMUNICATION SIGNAL.
1 LES of Turbulent Flows: Lecture 2 Supplement (ME EN ) Prof. Rob Stoll Department of Mechanical Engineering University of Utah Fall 2014.
Signal and System I The unit step response of an LTI system.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
Lecture 7: Sampling Review of 2D Fourier Theory We view f(x,y) as a linear combination of complex exponentials that represent plane waves. F(u,v) describes.
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
CHEE825 Fall 2005J. McLellan1 Spectral Analysis and Input Signal Design.
Astronomical Data Analysis I
Fourier Analysis of Signals and Systems
5.0 Discrete-time Fourier Transform 5.1 Discrete-time Fourier Transform Representation for discrete-time signals Chapters 3, 4, 5 Chap 3 Periodic Fourier.
revision Transfer function. Frequency Response
GG313 Lecture 24 11/17/05 Power Spectrum, Phase Spectrum, and Aliasing.
Fourier series, Discrete Time Fourier Transform and Characteristic functions.
Geology 6600/7600 Signal Analysis 09 Oct 2015 © A.R. Lowry 2015 Last time: A Periodogram is the squared modulus of the signal FFT! Blackman-Tukey estimates.
Stochastic Process Theory and Spectral Estimation
2D Fourier Transform.
Geology 6600/7600 Signal Analysis 05 Oct 2015 © A.R. Lowry 2015 Last time: Assignment for Oct 23: GPS time series correlation Given a discrete function.
1 Roadmap SignalSystem Input Signal Output Signal characteristics Given input and system information, solve for the response Solving differential equation.
The Fourier Transform.
Convergence of Fourier series It is known that a periodic signal x(t) has a Fourier series representation if it satisfies the following Dirichlet conditions:
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT
Chapter 4 Discrete-Time Signals and transform
Computational Data Analysis
Why Stochastic Hydrology ?
SIGNALS PROCESSING AND ANALYSIS
Computational Data Analysis
Outline Introduction Signal, random variable, random process and spectra Analog modulation Analog to digital conversion Digital transmission through baseband.
ივანე ჯავახიშვილის სახელობის
NRCSE 2. Covariances.
Fourier Analyses Time series Sampling interval Total period
Principle of Digital Communication (PDC) – EC 2004
Laboratory in Oceanography: Data and Methods
UNIT II Analysis of Continuous Time signal
Random Process The concept of random variable was defined previously as mapping from the Sample Space S to the real line as shown below.
Sampling Sampling an electrical signal means capturing its value repeatedly at a constant, very fast rate. Sampling frequency (fs) is defined as the number.
Chapter 8 The Discrete Fourier Transform
TIME SERIES ANALYSIS Time series – collection of observations in time: x( ti ) x( ti ) discrete time series with Δt Deterministic process: Can be predicted.
Fourier Analyses Time series Sampling interval Total period
The Fourier Series for Continuous-Time Periodic Signals
Signals & Systems (CNET - 221) Chapter-5 Fourier Transform
Chapter 8 The Discrete Fourier Transform
TIME SERIES ANALYSIS Time series – collection of observations in time: x( ti ) x( ti ) discrete time series with Δt Deterministic process: Can be predicted.
Chapter 8 The Discrete Fourier Transform
Signals and Systems Lecture 11
SIGNALS & SYSTEMS (ENT 281)
Presentation transcript:

Time Series Spectral Representation Any mathematical function has a representation in terms of sin and cos functions. Z(t) = {Z1, Z2, Z3, … Zn}

Spectral Analysis Represent a time series in terms of the wavelengths associated with oscillations, rather than individual data values The spectral density function describes the distribution of these wavelengths Spectral analysis involves estimating the spectral density function. Fourier analysis involves representing a function as a sum of sin and cos terms and is the basis for spectral analysis

Why Spectral Analysis Yields insight regarding hidden periodicities and time scales involved Provides the capability for more general simulation via sampling from the spectrum Supports analytic representation of linear system response through its connection to the convolution integral Is widely used in many fields of data analysis

Frequency and Wavenumber cycles/time radians/time Due to orthogonality of Sin and Cos functions

Frequency Limits Lowest frequency resolved Highest frequency resolved, corresponds to n/2 (Nyquist frequency) General case, time interval ∆t

Aliasing Due to discretization, a sparsely sampled high frequency process may be erroneously attributed to a lower frequency

Example. Fourier representation of streamflow

Equivalent complex number representation Note: Integer truncation is used in the sum limits. For example if n=5 (odd) the limits are -2, 2. If n=6 (even) the limits are -2, 3. (Same number of fourier coefficients as data points) Complex conjugate pair

Fourier representation of an infinite (non periodic) discrete series Discrete transform pair Lowest frequency Highest frequency Spacing As wmax=pi h=2 n=36 k=1:n wk=k/n*wmax Ck=exp(-(wk/h)^2) plot(wk,Ck,type="l",lwd=3,xlim=c(0,pi),xaxs="i") lines(wk,Ck)

Fourier representation of an infinite (non periodic) discrete series Discrete transform pair Re-center on [(-n-1)/2, (n-1)/2] for

Fourier transforms for discrete function on infinite domain (aperiodic) Wei section 10.5

Fourier transforms for continuous function on finite domain (periodic) Wei section 10.6.1

Fourier transforms for continuous function on infinite domain (aperiodic) Wei section 10.6.2

Frequency domain representation of a random process Z(t) and C(w) are alternative equivalent representations of the data If Z(t) is a random process C(w) is also random ACF(Z(t))≡Spectral density function(C(w))

Spectral decomposition of any function

Spectral density function Spectral representation of a stationary random process Autocorrelation Autocorrelation function Time Series Fourier Transform Fourier Transform Spectral density function Fourier coefficients Smoothing

Time Domain Frequency Domain Z1, Z2, Z3, … C1, C2, C3, …

The Periodogram |Ck|2 is random because Zt is random |Ck|2 Decomposition of variance k/n Power at low frequency Persistence indicated by ACF Wei section 12.1

Time Domain r=0.9 r=0.2

Frequency Domain r=0.9 r=0.2

The Spectral Density Function The spectral density function is defined as S(w)dw=E(|C(w)|2) Wei section 12.2, 12.3

Problem Estimating S(w) Z(t) Stationary C(w) Independent |C(w)|2 has 2 degrees of freedom (from real and imaginary parts More data ∆w gets smaller, but still 2 degrees of freedom n=50 n=200

S(w) estimated by smoothing the periodogram Balance Spectral resolution versus precision Tapering to minimize leakage to adjacent frequencies Confidence bounds by 2 based on number of degrees of freedom involved with smoothing Multitaper methods A lot of lore

Different degrees of smoothing

Spectral analysis gives us Decomposition of process into dominant frequencies Diagnosis and detection of periodicities and repeatable patterns Capability to, through sampling from the spectrum, simulate a process with any S(w) and hence any Cov() By comparison of input and output spectra infer aspects of the process based on which frequencies are attenuated and which propagate through