Fourier Analysis Linear transformations and lters. 3. Fourier Analysis. Alex Sheremet. April 11, 2007
|
|
- Loren Davis
- 5 years ago
- Views:
Transcription
1 Stochastic processes review 3. Data Analysis Techniques in Oceanography OCP668 April, 27 Stochastic processes review Denition Fixed ζ = ζ : Function X (t) = X (t, ζ). Fixed t = t: Random Variable X (ζ) = X (t, ζ).
2 Stochastic processes review Summary Names and denitions given for 2RVs and 2 processes X (t), Y (t). To obtain the denitions for auto- moments, set Y = X in column 2. 2 RV X, Y Correlation (Inner product) R = E{XY } Covariance C = E {(X µ X ) (Y µ Y ) } Variance σ 2 = E X µ x 2 = C xx Correlation coecient ρ = C xy /σ x σ y 2 Processes X (t), Y (t), (RV X (t),y (t2)) Cross (auto)- correlation R XY (t, t2) = E {X (t)y (t2)} Cross (auto)- n covariance o C XY (t, t2)=e (X µ X ) (Y µ t Y ) t2 Variance σ 2 (t) = E X (t) µ(t) 2 Correlation coecient ρ XY (t, t2) = C XY (t, t2)/σ X (t)σ Y (t2) Measurement data Stochastic processes review The auto-correlation R(t2, t) has a very specic structure. (also auto-covariance, or correlation coecient) t = t2 t = time lag.
3 Stochastic processes review Harmonic series Denitions Harmonic process: H(t) = A cos (ωt + T ); A, T mutually uncorrelated, T uniformly distributed in 2 Harmonic series: H(t) = P N n= A n cos (ω n t + T n ); Auto-correlation: (auto-covariance) Mean: µ H =. Variance: σ 2 H = P N n= 2 E A 2 P n = N n= σ2 n Average Power: R HH (t, t2) = P N n= 2 E A 2 n cos ωn (t t2), R HH ( t) = P N n= 2 E A 2 n cos(ωn t). Depend only on the lag t!! R HH (t) = P N n= 2 E A 2 P n = N n= σ2 n = σh, 2 2-order stationary processes Stochastic processes review Denition Process X (t) is 2-order stationary if: Mean: µ = E {x(t)} = constant, independent of t, Auto-correlation: R(t, t2) = R(t, t) = R( t) independent of t. Average Power: R() = E X (t) 2 = constant, independent of t, Auto-covariance: C( t) = R( t) µ 2 depends only on time lag. Correlation coecient: ρ( t) = C( t) C() depends only on time lag.
4 Stochastic processes review Harmonic analysis Harmonic series processes are 2-order stationary. Can any 2-order stationary process be represented as a harmonic series process? If not, then maybe: Can some 2-order stationary process be represented as a harmonic series process? What kind? Can the representation be modied to an integral instead of a sum? Would such a representation be unique? Represent = approximate arbitrary close (e.g. MS distance) a given process Series = sum with an innite number of terms... integral = a limiting process applied to a sum... What would that mean in stochastic processes? Basic idea Functions here are deterministic, and periodic. Real representation: X (t) = X 2 a + (a n cos nt + b n sin nt), n= with a n, b n R Complex representation: X (t) = X n= c n exp int, What is so special about (sin nt, cos nt) or exp int? Any 2π-periodic function = series of sinusoidals? What are the conditions X (t) has to satisfy?
5 Orthogonality of sin, cos, exp It might be possible: 8 >< >: R π π R π π R π π cos nt cos mt = for sin nt sin mt = for cos nt sin mt = m n m n for all m, n and in complex: Z π j n m exp (int) exp ( imt) dt = δ nm = 2π π n = m. Scalar product! Maybe there is a vector space? Then sin, cos, exp might be a basis. Fourier-Euler Formulae Real Fourier series If X (t) is a deterministic, 2π-periodic function, seek a representation X (t) = X 2 a + (a n cos nt + b n sin nt), with a n, b n R n= a n = π Z π π X (t) cos nt dt, b n = π Z π π X (t) sin nt dt. Complex Fourier Series X X (t) = c n exp int, with c n C, and c n = c n. n= c n = 2π Z π π X (t) exp ( int) dt,
6 The vector space: Class L 2 ( π, π) To admit a Fourier series representation, R π π X (t) 2 dt <. The scape is called the L 2 ( π, π) class. Denitions. L 2 ( π, π) = -Dim. vector space + inner product = Hilbert space. 2. If X (t) and Y (t) are two functions of class L 2 ( π, π), the inner product 3. The norm in L 2 ( π, π): X, Y = 2π Z π π X 2 = X, X = 2π X (t) Y (t) dt. Z π π X (t) 2 dt. Class L 2 ( π, π) as a vector space L 2 ( π, π) class functions X (t) are vectors; Set of vectors {U n } = {exp int} is a basis. The unique (Fourier) representation = decomposition on the basis X X = c n U n ; n= c n are the components (projections) of X in this basis; Length of a vector (norm): X = P x n U n and Y = P y n U n, X 2 X = c n U n 2 X and X, Y = x n y n U n 2. n= n= If basis is orthonormal ( U n = ), then X X, Y = x n y n and X 2 X = x n 2. n= n=
7 General Periodicity To generalize from 2π-periodic functions to T -periodic, T R. Change variables s = t T 2π, and t = 2π T s, 2 Dene frequency f n = n T, radian frequency ω n = n 2π T : General-periodicity Fourier-Euler relations X X (t) = c n exp 2πif n t, n= c n = T Z T /2 X (t) exp ( 2πif n t) dt, T /2 Inner product X, Y = T Z T /2 X (t)y (t) dt. T /2 Properties of Fourier Coecients Let X = X x n U n ; Y = X y n U n ; Z = X z n U n with U n = exp(iω n t), with ω n = 2πn/T ; Linearity If Z(t) = ax (t) + by (t), then z n = ax n + by n. If X and Y have Fourier representation so does Z. Even function X is even c n are all real, c n = c n. Odd function X is odd c n are all imaginary.
8 Parseval Relation Parseval Relation If X = P n x nu n (X is L 2 class, U n = exp 2πif n t) X 2 X = x n 2. n= Remember stochastic processes? Total power, 2-order stationary process X(t): σ 2 X = R() = E X (t) 2. Total power, harmonic process X(t): σ 2 H = R() = E H(t) 2 = P σn. 2 Calculate the mean as time average: R() = Z b a X (t) 2 dt. Spectral Analysis of Periodic Functions total energy = T /2 T /2 total power = total energy / period = T X (t) 2 dt = T n= T /2 c n 2 X (t) 2 dt = T /2 n= c n 2 Single-frequency oscillation X (t) = c n exp(2πf n t), with f = n/t, Total power = c n 2 Spectral representation Fourier-Euler relations for (periodic) function X. Power spectrum (Parseval) Total power = sum of individual harmonic power.
9 Example: ramp function..5 X(t) t.2.5 c n n arg(c n ), (π rad) n X (t) = t, with t [ T /2, T /2]. X ( t) = X (t), X is odd: c n = T Z T /2 t exp ( iω n t) dt c n = ( )n i ; c n = ; i = exp iπ T /2 2πf n 2πf n 2 ; Fourier Integrals: Basic idea X (t) is not periodic. Dene a T -periodic X T (t) X (t) for t Use previous theory for X T» T 2, T ; 2 X X T (t) = c n exp (2πif n t) ; n= c n = T Z T /2 X (t) exp( 2πif n t) dt T /2 Substitute c n, dene f = f n f n = T, X (t) = X n= Let T, f = T and P R X (t) = Z " Z # T /2 X (t) exp( 2πif n t) dt exp(2πif n t) f T /2»Z X (t) exp( 2πif n t) dt exp(2πif n t) df
10 Fourier Pair Fourier Transform Pair ˆX (f ) = X (t) = X (t) exp( 2πift) dt ˆX (f ) exp(2πift) df direct FT inverse FT ˆX (f ) is the Fourier transform of X (t); ˆX (f ) and X (t) are called a Fourier pair; Fourier Transform operator: F[ ] = [ ] exp( 2πift) dt Inverse Fourier Transform operator: F [ ] = [ ] exp(2πift) dt [ ] ˆX (f ) = F [X (t)], X (t) = F ˆX (f ) ; Dual nature of FT Existence of Fourier Transform Pair Existence of Fourier pair X (t), ˆX (f ) more problematic than Fourier series If X (t) is such that X (t) dt <, it has a FT ˆX (f ). 2 Inverse ˆX (f ) exists if additional conditions of good behavior for fast enough X (t) are imposed (e.g. X (t) as t ± ) 2 8 X(t) t
11 Existence of Fourier Transform Pair However: exp(2πif t) = δ(f f ) exp(2πift) df, δ(f ) and exp(2πift) are like a Fourier pair. Generalization of the Fourier integral concept? generalized functions (also called distributions). Properties of FT () Let X (t) and ˆX (f ) = F [X (t)] be a FT pair. Linearity: F [ax + by ] = af[x ] + bf[y ]. Shift : F[X (t a)] = ˆX (f ) exp ( 2πifa). Shift 2: F[X (t) exp (2πift)] = ˆX (f f ). (Duality: Shift in argument oscillation of the transform) Scale: F[X (at)] = a ˆX ( f a ) Consequence: F [X ( t)] = ˆX ( f ). (Duality: stretching t compression in f )
12 Properties of FT (2) Derivative : Derivative 2: Double F: d n ˆX (f ) = ( 2πi) n F[t n X (t)]. df n» d n F dt X (t) = ( 2πif ) n ˆX (f ). n F [F [X (t)]] = X ( t). Duality: F [X (t)] = ˆX (f ), and F h ˆX (f ) i = X ( t). Properties of FT (3) Symmetry of the function and its FT X (t) real, even real, odd imaginary, even imaginary, odd ˆX (t) real, even imaginary, odd imaginary, even real, odd
13 Examples: Rectangular pulse j t a X (t) = otherwise ; 2a sin(2πfa) ˆX (f ) = = 2a sinc(2πfa). 2πfa (a) t 2 (b) f Examples: Gaussian The Gaussian is invariant to the FT F [ exp ( πt 2)] = exp ( πf 2). Symmetry examples based on the Gaussian: (real - imaginary).8 (a) (b).8.8 (a) (b) (c) (d).5.5 (c) (d) t f real, even real, even real, odd imaginary, odd t f imaginary, even imaginary, even imaginary, odd real, odd
14 Examples: shifted Gaussian Think about a wave group. IFT of a Gaussian at f, width σ: X (t) = A exp ( 2π 2 σ 2 t) exp (2πif t) (a) (c) f (b).5.5 (d) t (a) (c) f (b).5.5 (d) t Length σ t of group inversely proportional to spectral width σ f σ t σ f Convolution and correlation Denitions Convolution product: Z(t) = (X Y )(t) = R X (ξ)y (t ξ) dξ. 2 Correlation product: Z(t) = (X Y )(t) = R X (ξ)y (t + ξ) dξ Theorem. Convolution: 2. Correlation: a) F [X Y ] = F [X ] F [Y ], a) F [X Y ] = F [X ] (F [Y ]), b) F [X Y ] = F [X ] F [Y ], b) F [X X ] = F [X ] 2. 2b) is a signicant result!
15 Convolution properties Another way to write it: (X Y )(t) = 2 Product-like properties X (ξ ) Y (ξ 2 ) δ (t ξ ξ 2 ) dξ dξ 2. comutativity: X Y = Y X, 2 associativity: X (Y Z) = (X Y ) Z, 3 disstributivity (addition): X (Y + Z) = (X Y ) + (X Z); 3 Multiplication with a constant a:a (X Y ) = ax Y = X ay, 4 Derivative: d dt dx (X Y ) = dt Y = X dy dt, 5 Integral: (X Y ) dt = ( X (t)dt ) ( Y (t)dt ). Parseval relation, power spectrum Parseval relation: Total energy: Energy spectrum: X (t) 2 dt = ˆX (f ) 2, Total energy in interval [f, f + df ]: ˆX (f ) 2 df, ˆX (f ) 2 df. Fourier transform superposition of harmonics f with energy ˆX (f ) 2 df.
16 Correlation and power spectrum (deterministic functions) Stochastic process: auto-correlation is dened as R( t) = E {X (t)x (t + t)} = X (t) X (t + t) dt Deterministic function: Replace E{ } [ ]dt autocorrelation R( t) = X (t) X (t + t) dt. The Fourier transform of the autocorrelation is the energy spectrum: F [R(τ)] = R(τ) e 2πif τ dτ = ˆX (f ) 2. Uncertainty Principle Question: well localized in time and well localized in frequency? Transform of a sinusoidal: F [exp (2πif t)] = δ(f f ). Transform of a Gaussian: [ ) A F exp ( ] t2 = 2πσt 2 2σt 2 A exp ( f 2 2σ 2 f ) ; with σ t = 2πσ f One cannot reduce simultaneously the σ f and σ t (σ f σ t = ).
17 Heisenberg Theorem Dene mean spread σ t for X (similar construction for σ f using ˆX ): Assume that X 2 = X (t) 2 dt < ; 2 F T (t) = X (t) 2 X 2 3 Following the denitions µ T = ; F T (t) dt = PDF of time RV T ; t F T (t) dt, σ 2 T = (t µ T ) 2 F T (t) dt. Heisenberg Uncertainty Principle: σ 2 t σ 2 f. (= for Gaussian) 2 (2π) No pair X ˆX is such that both cancel outside an interval. (review) Fourier: Series Transform Conditions T -Periodic R T /2 T /2 X (t) 2 dt < R X (t) dt < Decays t ± Synthesis X (t) = P n= c ne 2πi n T t X (t) = R ˆX (f )e 2πift df Analysis c n = R X n (t)e 2πi T t dt R ˆX (f ) = X (t)e 2πift dt Energy spectrum c n 2 ˆX (f ) 2 Total energy P n= c n 2 R ˆX (f ) 2 df
18 (review) Fourier Transform Properties Convolution Correlation Autocorrelation- Energy spectrum Heisemberg uncertainty (X Y ) (t) = R dxy = ˆX Ŷ X (ξ)y (ξ t)dξ (X Y ) (t) = R X (ξ)y (ξ + t)dξ X Y = ˆX Ŷ X X = ˆX 2 σ 2 t σ 2 f (2π) 2 µ T = R t F T (t) dt, σ 2 T = R (t µ T ) 2 F T (t) dt. Spectral analysis of stochastic processes Fixed ζ = ζ : Function X (t) = X (t, ζ). Fixed t = t: Random Variable X (ζ) = X (t, ζ).
19 Two approaches to derive the spectrum of a process Goal: estimate the spectrum of a stochastic process X (t, ζ). Means: Fourier theory developed for deterministic functions. Approach (simple) Approach 2 (rigorous) Process = family of realizations Realization = function X (t); Apply Fourier theory to realization; Average over all realizations. Physical meaning of spectrum? Represent process X (t) as X (t) = X Hα = X α α Hα = harmonic process; Ane 2πif αt Spectrum of X (t): σ 2 α = P α σ2 α X (t) should be 2-order stationary (harmonic processes): Constant mean and variance Auto-correlation R(t, t2) = E {X (t)x (t2)} = R(t2 t2) Approach, simple () Treat one realization as a deterministic function X (t); 2 Calculate its spectrum using Fourier theory above. However, if process X (t) is 2-order stationary, one realization does not have a Fourier series representation (X is not periodic) 2 does not have a Fourier integral representation since X (t) dt =. Try to circumvent this diculty by using a limit process.
20 Approach, simple (2) Limit process: a) Window the function X (t); b) Dene the spectrum of the windowed function c) Let the window width go to. a) Windowed version of X (t): X T X T (t) = j X (t), T /2 t T /2, otherwise has a Fourier transform Z Z T /2 ˆX T (f ) = X T (t) exp ( 2πift) dt = X (t) exp ( 2πift) dt T /2 Windowed signal
21 Approach, simple (3) b) Apply Parseval relation for X T energy spectrum: total energy: energy in [f, f + f ]: T /2 T /2 X T (t) 2 dt = ˆX T (f ) 2 df ˆX T (f ) 2 df But energy of X is innite: if T, both total energy and spectrum. Approach, simple (4) However, X is 2-order stationary (variance is constant in time) energy (or spectrum) window length T. Normalizing by T should keep the values bounded; Energy/time=power, so total power: power in [f, f + f ]: If lim T T ˆX T (f ) R T /2 T T /2 X T (t) 2 dt = T ˆX T (f ) 2 df T 2 < then for X (t) R ˆX T (f ) 2 df power in [f, f + f ]: lim T T ˆX T (f ) 2 df Note: this is a time average!
22 Approach, simple (5) c) Derive power spectrum for the process, by averaging over ensemble: Denition The power spectrum (power spectral density) of process X (t) is j h(f ) = average of power in [f, f + df ] = lim E ˆX T (f ) 2ff. T T Power spectrum FT Auto-correlation Theorem If X (t) 2-order stationary process with auto-covariance R(τ), then h(f ) exists for all f, and h(f ) = Z R(τ)e 2πift dt, R(τ) = Auto-correlation (deterministic function) (X X )(τ) = Z Z X (t)x (t + τ) dt h(f ) e 2πift df. FT Replaced by the auto-correlation for a stochastic process: R(τ) = E {X (t) X (t + τ)} FT h(f ) = lim T T Equivalent to replacing ensemble by time average: Z T /2 E {F (t)} lim F (t) dt T T T /2 ˆX (f ) 2 ˆX T (f ) 2
23 Approach summary Steps to build the power spectrum of a stochastic process: Take one representation X (t) (no FS/FT representation); 2 Build truncated version X T (t) (has FT representation); 3 Dene for X T (t) power spectrum 2 ˆX T (f ) T, and let T ; ( 4 Average over the ensemble h(f ) = E lim T 2) ˆX T (f ). T Meaning: X T (t) sum of harmonic oscillations f of power 2 ˆX T (f ) T Stochastic process: X T (t) sum of harmonic processes of power h(f ). We built this as a limiting process. But is there such a decomposition for a given process X (t)? Approach 2, rigorous Theorem Let X (t) be a 2-order stationary process. There exists an orthogonal process Z(f ) such that X (t) = with the properties E [dz(f )] = Z e 2πift dz(f ), 2 E ˆ dz(f ) 2 = dh(f ) with dh(f ) = power contributed by [f, f + df ]. 3 For any f f2, E [dz(f)dz (f2)] =. (e.g. Priestley, MB, Spectral Analysis and Time Series) Integral is Stieltjes; convergence in the MS sense. continuous spectrum: dh(f ) = H (f ) df = h(f ) df, h(f ) = power spectrum. Any 2-order stationary process = sum of harmonic processes with uncorrelated amplitudes and phases.
24 Example. White noise For the white-noise process: C(τ) = q δ(τ), with q. Power spectrum h(f ) = F [C] = q All frequencies have equal power. δ(τ) exp ( 2πif τ) dτ = q. Example 2. Harmonic process Denition H(t) = P N n= A n cos (ω n t + T n ); A n and T n mutually uncorrelated, T n uniformly distributed in the interval [ π, π]. auto-covariance C(τ) = n 2 E { A 2 n } cos (2πfn τ), power spectral density h(f ) = 4 one-sided spectrum { E An} 2 [δ(f + fn ) + δ(f f n )]. n h(f ) = n 2 E { A 2 n } δ(f fn ), with f n.
25 One Realization vs. Process T ˆX (f ) 2 h(f ) 6 power density (a) 25 2 (b) power density frequency (Hz) a) ˆX (f ) 2; b) h(f ) Note: Covariance-Ergodic processes Previously, we replaced the ensemble average by the time average. M = E {G(x)} M = lim T T Z G(x) dt, Denition Processes which have the property that E {G(x)} = lim T T Z G(x) dt are called M ergodic. Theorem A zero-mean stochastic process is covariance-ergodic if lim τ C(τ) =
26 Systems and process transformation A procedure that transforms process Y (t) into process X (t) In the process, some characteristics of input Y are changed. Output X is dierent. Spectra of Y and X are dierent. Some frequencies have been ltered out. Linear system/transformation X (t) and Y (t) are two stochastic processes. Denition A system (or transformation) L maps input Y (t) into output X (t): X (t) = L [Y (t)] L is an operator acting only on functions of t. L is linear if a, b C L [ay (t) + by 2 (t)] = al [Y (t)] + bl [Y 2 (t)]. L is shift-invariant if for any s R X (t) = L [Y (t)] X (t s) = L [Y (t s)]. Transformations discussed here are assumed linear and shift-invariant.
27 Examples: General systems Let Y (t) and Y (t) be discrete-time processes: Y (t) = Y (n t) and X (t) = X (n t), Two (3) basic ways to combine them: Autoregressive model AR(n): a X (t) + a X (t t) + a 2 X (t 2 t) a n X (t n t) = Y (t) 2 Moving average model MA(n): X (t) = b Y (t) + b Y (t t) + b 2 Y (t 2 t) +... b n Y (t n t) 3 Autoregressive Moving Average ARMA(m,n) n m a k X (t k t) = b k Y (t k t) k= k= Examples: Autoregressive model AR Second order discrete AR(2): a X (t) + a X (t t) + a 2 X (t 2 t) = Y (t), Output given through an implicit relationship. Physically realizable condition: only X (t n t). Second order continuous AR(2): use X (t) = X (t) X (t t), 2 X (t) = X (t) X (t t) = X (t) 2X (t t) + X (t 2 t) Let t d 2 X (t) dt 2 + α dx (t) dt (Bumpy road - forced oscillation model) + α 2 X (t) = Z(t).
28 Examples: AR(n) Autoregressive process of arbitrary order AR(n): a X (t) + a X (t t) + a 2 X (t 2 t) a n X (t n t) = X (t), and α d n X (t) dt n n d X (t) dx (t) + α α dt n n + α n X (t) = Z(t), dt Examples: Moving Average model (MA) Discrete Moving Average MA(n): X (t) = b Y (t) + b Y (t t) + b 2 Y (t 2 t) +... b n Y (t n t), Continuous Moving Average MA: Replace b j by function w(t) (window) { w(t) w(t) = s T otherwise, MA is the convolution of Y (t) with w: X (t) = Y (s) w(t s) ds = Y w. Note: convolution with window w has also the eect of smearing the function Y.
29 Examples: General ARMA (continuous) For continuous-time processes, the general form of a linear system: d n X (t) d α +α dt n n X (t) dt n dx (t) +...+α n +α n X (t) = w(t s)y (s)ds, dt where α j C (j =, 2,..., n) and w(t)is a window function, w(t)dt =. Fundamental Theorem Theorem If L is a shift-invariant linear transformation X (t) = Y (t) G(t) = Y (s)g(t s) ds, G(t) = L [δ(t)] = impulse response of L A linear system is completely characterized by its impulse response. Steps: Obtain the function G(t) = response of L to a delta impulse, 2 Calculate output X as convolution of input Y and G.
30 Linear transformations of moments Mean L and E {.} are linear operators and commute (acting on independent variables), therefore µ X (t) = E [X (t)] = E [L [Y (t)]] = L [E [Y (t)]] = L [µ Y (t)]. Autocorrelation Let L t2 = linear system operates on the variable t 2. Regard t = parameter. Then R YX (t, t 2 ) = L t2 [R YY (t, t 2 )] = R YY (t, t 2 ) G(t 2 ); R XX (t, t 2 ) = L t [R YX (t, t 2 )] = R YX (t, t 2 ) G(t 2 ); where, for example, R YY (t, t 2 ) G(t 2 ) = R YY (t, t 2 s)g(s) ds. Similar relations for auto-/cross-covariances. Example: White noise Input Y (t) is a zero-mean, white-noise process C YY (t, t 2 ) = q(t ) δ(t 2 t ), q(t ). Power of output X (t) [ E X (t) 2] = q(t) G(t) 2 = q(t s) G(s) 2 ds. If Y (t) is stationary q(t) = q, [ E X (t) 2] = qe, where E = G(s) 2 ds.
31 Goal: power spectrum transformation Time domain Frequency domain Input R YY Output R YY G R YX R YX G R XX FT FT FT h YY? h YX? h XX Power spectrum transformation () Assume that X (t) and Y (t) are 2-order stationary: Constant mean and variance, Auto-correlation R(t, t2) = R(t2 t2) = R(τ). Theorem The following statements are true for a shift-invariant linear system: R YX (τ) = R YY (τ) G ( τ), R XX (τ) = R YX (τ) G(τ), h YX (f ) = h YY (f ) Ĝ (f ), h XX (f ) = h YX (f ) Ĝ(f ), Where Ĝ(f ) = F [G(t)]; h YX (f ) = F [R YX (t)] = cross-spectrum of X and Y ; h XX = F [R XX (t)] = (auto) spectrum of X.
32 Power spectrum transformation (2) Time domain Frequency domain Input R YY G Output R YY R YX R YX G R XX FT FT FT h YY h YY Ĝ h YX h YX Ĝ h XX Power Spectrum Theorem Combining equations: R XX (τ) = R YY (τ) G(τ) G ( τ) = R YY (τ) [G(τ) G(τ)], h XX (f ) = h YY (f ) Ĝ(f ) 2. Conclusions: Spectrum of output = spectrum of input factor function 2 Factor function dened by impulse response function of L. Ĝ(f ) 2.
33 Power spectrum H(f ) = Ĝ(f ). Examples: white noise input Input is zero-mean white noise with δ auto-correlation and constant spectral distribution: R YY (τ) = qδ(τ), h YY (f ) = q, Output spectrum square of window spectrum h XX (f ) = q Ĝ(f ) 2, RXX (τ) = q [G(τ) G(τ)].
34 Examples: Continuous AR() A continuous AR() process is described by equation dx (t) + ax (t) = Y (t), dt Impulse response function G(t) dg(t) dt + ag(t) = δ(t), h XX (f ) = h YY (f ) Ĝ(f ) 2 h XX (f ) = a 2 + ω, ω = 2 2πf. If input is a white-noise, h YY (f ) = q, the output spectrum is h XX (f ) = q a 2 + ω 2. Examples: Continuous MA System is a moving average with window w X (t) = Y (s) w(t s) ds, with Impulse response: G(t) = L [δ(t)] = w(t)dt =. δ(s) w(t s) ds = w(t). h XX (f ) = h YY (f ) ŵ(f ) 2 If w is a rectangular window, its FT is a cardinal sine: w(t) = { /T t T /2 otherwise If input is white noise: ; ŵ(f ) = 2a sin(πft ) πft = sinc(πft ). h XX (f ) = q sinc(πft ) 2.
35 AR() & MA spectral window AR(): h XX (f ) = h YY (f ) Ĝ(f ) 2 ; Ĝ(f ) 2 = a 2 + ω 2, MA: h XX (f ) = h yy (f ) Ĝ(f ) 2 ; Ĝ(f ) 2 = h yy (f ) sinc(πft ) 2 MA and AR behave like low-pass lters. Filters Relations used as lters X (t) = Motivation: Design G(t) so that Y (s)g(t s) ds, h XX (f ) = h YY (f ) Ĝ(f ) 2 ; Ĝ(f ) 2 for some frequencies. Impulse response: G(t), completely characterizes the lter. Transfer function: H(f ) = Ĝ(f ) complex, H(f ) = ρ(f ) e iφ(f ). Gain: Modulus ρ(f ) = f. Phase: Angle φ(f ) = phase f.
X(t)e 2πi nt t dt + 1 T
HOMEWORK 31 I) Use the Fourier-Euler formulae to show that, if X(t) is T -periodic function which admits a Fourier series decomposition X(t) = n= c n exp (πi n ) T t, then (1) if X(t) is even c n are all
More informationThe Discrete Fourier Transform (DFT) Properties of the DFT DFT-Specic Properties Power spectrum estimate. Alex Sheremet.
4. April 2, 27 -order sequences Measurements produce sequences of numbers Measurement purpose: characterize a stochastic process. Example: Process: water surface elevation as a function of time Parameters:
More informationELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process
Department of Electrical Engineering University of Arkansas ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Definition of stochastic process (random
More informationSystem Identification & Parameter Estimation
System Identification & Parameter Estimation Wb3: SIPE lecture Correlation functions in time & frequency domain Alfred C. Schouten, Dept. of Biomechanical Engineering (BMechE), Fac. 3mE // Delft University
More informationStochastic Processes. M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno
Stochastic Processes M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno 1 Outline Stochastic (random) processes. Autocorrelation. Crosscorrelation. Spectral density function.
More informationENSC327 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 informationFourier Analysis and Power Spectral Density
Chapter 4 Fourier Analysis and Power Spectral Density 4. Fourier Series and ransforms Recall Fourier series for periodic functions for x(t + ) = x(t), where x(t) = 2 a + a = 2 a n = 2 b n = 2 n= a n cos
More informationEAS 305 Random Processes Viewgraph 1 of 10. Random Processes
EAS 305 Random Processes Viewgraph 1 of 10 Definitions: Random Processes A random process is a family of random variables indexed by a parameter t T, where T is called the index set λ i Experiment outcome
More information2.1 Basic Concepts Basic operations on signals Classication of signals
Haberle³me Sistemlerine Giri³ (ELE 361) 9 Eylül 2017 TOBB Ekonomi ve Teknoloji Üniversitesi, Güz 2017-18 Dr. A. Melda Yüksel Turgut & Tolga Girici Lecture Notes Chapter 2 Signals and Linear Systems 2.1
More informationENSC327 Communications Systems 2: Fourier Representations. School of Engineering Science Simon Fraser University
ENSC37 Communications Systems : Fourier Representations School o Engineering Science Simon Fraser University Outline Chap..5: Signal Classiications Fourier Transorm Dirac Delta Function Unit Impulse Fourier
More informationStochastic Processes
Elements of Lecture II Hamid R. Rabiee with thanks to Ali Jalali Overview Reading Assignment Chapter 9 of textbook Further Resources MIT Open Course Ware S. Karlin and H. M. Taylor, A First Course in Stochastic
More informationSignals and Spectra (1A) Young Won Lim 11/26/12
Signals and Spectra (A) Copyright (c) 202 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version.2 or any later
More informationSummary of Fourier Transform Properties
Summary of Fourier ransform Properties Frank R. Kschischang he Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of oronto January 7, 207 Definition and Some echnicalities
More informationLINEAR SYSTEMS. J. Elder PSYC 6256 Principles of Neural Coding
LINEAR SYSTEMS Linear Systems 2 Neural coding and cognitive neuroscience in general concerns input-output relationships. Inputs Light intensity Pre-synaptic action potentials Number of items in display
More informationProblem 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 informationELEMENTS OF PROBABILITY THEORY
ELEMENTS OF PROBABILITY THEORY Elements of Probability Theory A collection of subsets of a set Ω is called a σ algebra if it contains Ω and is closed under the operations of taking complements and countable
More informationStochastic Processes. A stochastic process is a function of two variables:
Stochastic Processes Stochastic: from Greek stochastikos, proceeding by guesswork, literally, skillful in aiming. A stochastic process is simply a collection of random variables labelled by some parameter:
More information16.584: Random (Stochastic) Processes
1 16.584: Random (Stochastic) Processes X(t): X : RV : Continuous function of the independent variable t (time, space etc.) Random process : Collection of X(t, ζ) : Indexed on another independent variable
More informationGATE 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 informationFourier Series. Spectral Analysis of Periodic Signals
Fourier Series. Spectral Analysis of Periodic Signals he response of continuous-time linear invariant systems to the complex exponential with unitary magnitude response of a continuous-time LI system at
More informationContinuous Time Signal Analysis: the Fourier Transform. Lathi Chapter 4
Continuous Time Signal Analysis: the Fourier Transform Lathi Chapter 4 Topics Aperiodic signal representation by the Fourier integral (CTFT) Continuous-time Fourier transform Transforms of some useful
More informationStatistical signal processing
Statistical signal processing Short overview of the fundamentals Outline Random variables Random processes Stationarity Ergodicity Spectral analysis Random variable and processes Intuition: A random variable
More information13. Power Spectrum. For a deterministic signal x(t), the spectrum is well defined: If represents its Fourier transform, i.e., if.
For a deterministic signal x(t), the spectrum is well defined: If represents its Fourier transform, i.e., if jt X ( ) = xte ( ) dt, (3-) then X ( ) represents its energy spectrum. his follows from Parseval
More informationA523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011
A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011 Lecture 6 PDFs for Lecture 1-5 are on the web page Problem set 2 is on the web page Article on web page A Guided
More information1 Signals and systems
978--52-5688-4 - Introduction to Orthogonal Transforms: With Applications in Data Processing and Analysis Signals and systems In the first two chapters we will consider some basic concepts and ideas as
More informationProblems on Discrete & Continuous R.Vs
013 SUBJECT NAME SUBJECT CODE MATERIAL NAME MATERIAL CODE : Probability & Random Process : MA 61 : University Questions : SKMA1004 Name of the Student: Branch: Unit I (Random Variables) Problems on Discrete
More informationLECTURE 12 Sections Introduction to the Fourier series of periodic signals
Signals and Systems I Wednesday, February 11, 29 LECURE 12 Sections 3.1-3.3 Introduction to the Fourier series of periodic signals Chapter 3: Fourier Series of periodic signals 3. Introduction 3.1 Historical
More informationCommunication Systems Lecture 21, 22. Dong In Kim School of Information & Comm. Eng. Sungkyunkwan University
Communication Systems Lecture 1, Dong In Kim School of Information & Comm. Eng. Sungkyunkwan University 1 Outline Linear Systems with WSS Inputs Noise White noise, Gaussian noise, White Gaussian noise
More informationName of the Student: Problems on Discrete & Continuous R.Vs
Engineering Mathematics 05 SUBJECT NAME : Probability & Random Process SUBJECT CODE : MA6 MATERIAL NAME : University Questions MATERIAL CODE : JM08AM004 REGULATION : R008 UPDATED ON : Nov-Dec 04 (Scan
More informationA6523 Linear, Shift-invariant Systems and Fourier Transforms
A6523 Linear, Shift-invariant Systems and Fourier Transforms Linear systems underly much of what happens in nature and are used in instrumentation to make measurements of various kinds. We will define
More informationEmpirical Mean and Variance!
Global Image Properties! Global image properties refer to an image as a whole rather than components. Computation of global image properties is often required for image enhancement, preceding image analysis.!
More information7 The Waveform Channel
7 The Waveform Channel The waveform transmitted by the digital demodulator will be corrupted by the channel before it reaches the digital demodulator in the receiver. One important part of the channel
More information2.161 Signal Processing: Continuous and Discrete Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 2.6 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. MASSACHUSETTS
More informationSpectral Analysis. Jesús Fernández-Villaverde University of Pennsylvania
Spectral Analysis Jesús Fernández-Villaverde University of Pennsylvania 1 Why Spectral Analysis? We want to develop a theory to obtain the business cycle properties of the data. Burns and Mitchell (1946).
More informationFundamentals of Digital Commun. Ch. 4: Random Variables and Random Processes
Fundamentals of Digital Commun. Ch. 4: Random Variables and Random Processes Klaus Witrisal witrisal@tugraz.at Signal Processing and Speech Communication Laboratory www.spsc.tugraz.at Graz University of
More informationTSKS01 Digital Communication Lecture 1
TSKS01 Digital Communication Lecture 1 Introduction, Repetition, and Noise Modeling Emil Björnson Department of Electrical Engineering (ISY) Division of Communication Systems Emil Björnson Course Director
More informationwhere r n = dn+1 x(t)
Random Variables Overview Probability Random variables Transforms of pdfs Moments and cumulants Useful distributions Random vectors Linear transformations of random vectors The multivariate normal distribution
More informationFundamentals of the Discrete Fourier Transform
Seminar presentation at the Politecnico di Milano, Como, November 12, 2012 Fundamentals of the Discrete Fourier Transform Michael G. Sideris sideris@ucalgary.ca Department of Geomatics Engineering University
More information13.42 READING 6: SPECTRUM OF A RANDOM PROCESS 1. STATIONARY AND ERGODIC RANDOM PROCESSES
13.42 READING 6: SPECTRUM OF A RANDOM PROCESS SPRING 24 c A. H. TECHET & M.S. TRIANTAFYLLOU 1. STATIONARY AND ERGODIC RANDOM PROCESSES Given the random process y(ζ, t) we assume that the expected value
More information3. 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 informationSRI VIDYA COLLEGE OF ENGINEERING AND TECHNOLOGY UNIT 3 RANDOM PROCESS TWO MARK QUESTIONS
UNIT 3 RANDOM PROCESS TWO MARK QUESTIONS 1. Define random process? The sample space composed of functions of time is called a random process. 2. Define Stationary process? If a random process is divided
More informationSignal Processing Signal and System Classifications. Chapter 13
Chapter 3 Signal Processing 3.. Signal and System Classifications In general, electrical signals can represent either current or voltage, and may be classified into two main categories: energy signals
More informationECE6604 PERSONAL & MOBILE COMMUNICATIONS. Week 3. Flat Fading Channels Envelope Distribution Autocorrelation of a Random Process
1 ECE6604 PERSONAL & MOBILE COMMUNICATIONS Week 3 Flat Fading Channels Envelope Distribution Autocorrelation of a Random Process 2 Multipath-Fading Mechanism local scatterers mobile subscriber base station
More informationLINEAR RESPONSE THEORY
MIT Department of Chemistry 5.74, Spring 5: Introductory Quantum Mechanics II Instructor: Professor Andrei Tokmakoff p. 8 LINEAR RESPONSE THEORY We have statistically described the time-dependent behavior
More informationFourier Series and Transforms. Revision Lecture
E. (5-6) : / 3 Periodic signals can be written as a sum of sine and cosine waves: u(t) u(t) = a + n= (a ncosπnft+b n sinπnft) T = + T/3 T/ T +.65sin(πFt) -.6sin(πFt) +.6sin(πFt) + -.3cos(πFt) + T/ Fundamental
More information2 Frequency-Domain Analysis
2 requency-domain Analysis Electrical engineers live in the two worlds, so to speak, of time and frequency. requency-domain analysis is an extremely valuable tool to the communications engineer, more so
More informationChapter 5 Random Variables and Processes
Chapter 5 Random Variables and Processes Wireless Information Transmission System Lab. Institute of Communications Engineering National Sun Yat-sen University Table of Contents 5.1 Introduction 5. Probability
More informationEE4601 Communication Systems
EE4601 Communication Systems Week 4 Ergodic Random Processes, Power Spectrum Linear Systems 0 c 2011, Georgia Institute of Technology (lect4 1) Ergodic Random Processes An ergodic random process is one
More informationThis examination consists of 11 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS
THE UNIVERSITY OF BRITISH COLUMBIA Department of Electrical and Computer Engineering EECE 564 Detection and Estimation of Signals in Noise Final Examination 6 December 2006 This examination consists of
More informationThis examination consists of 10 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS
THE UNIVERSITY OF BRITISH COLUMBIA Department of Electrical and Computer Engineering EECE 564 Detection and Estimation of Signals in Noise Final Examination 08 December 2009 This examination consists of
More informationFourier Analysis and Sampling
Chapter Fourier Analysis and Sampling Fourier analysis refers to a collection of tools that can be applied to express a function in terms of complex sinusoids, called basis elements, of different frequencies.
More informationMathematical Foundations of Signal Processing
Mathematical Foundations of Signal Processing Module 4: Continuous-Time Systems and Signals Benjamín Béjar Haro Mihailo Kolundžija Reza Parhizkar Adam Scholefield October 24, 2016 Continuous Time Signals
More information8: Correlation. E1.10 Fourier Series and Transforms ( ) Fourier Transform - Correlation: 8 1 / 11. 8: Correlation
E. Fourier Series and Transforms (25-5585) - Correlation: 8 / The cross-correlation between two signals u(t) and v(t) is w(t) = u(t) v(t) u (τ)v(τ +t)dτ = u (τ t)v(τ)dτ [sub: τ τ t] The complex conjugate,
More informationTime Series Analysis: 4. Digital Linear Filters. P. F. Góra
Time Series Analysis: 4. Digital Linear Filters P. F. Góra http://th-www.if.uj.edu.pl/zfs/gora/ 2018 Linear filters Filtering in Fourier domain is very easy: multiply the DFT of the input by a transfer
More informationIV. Covariance Analysis
IV. Covariance Analysis Autocovariance Remember that when a stochastic process has time values that are interdependent, then we can characterize that interdependency by computing the autocovariance function.
More informationFourier Methods in Digital Signal Processing Final Exam ME 579, Spring 2015 NAME
Fourier Methods in Digital Signal Processing Final Exam ME 579, Instructions for this CLOSED BOOK EXAM 2 hours long. Monday, May 8th, 8-10am in ME1051 Answer FIVE Questions, at LEAST ONE from each section.
More informationChapter 6. Random Processes
Chapter 6 Random Processes Random Process A random process is a time-varying function that assigns the outcome of a random experiment to each time instant: X(t). For a fixed (sample path): a random process
More informationName of the Student: Problems on Discrete & Continuous R.Vs
Engineering Mathematics 08 SUBJECT NAME : Probability & Random Processes SUBJECT CODE : MA645 MATERIAL NAME : University Questions REGULATION : R03 UPDATED ON : November 07 (Upto N/D 07 Q.P) (Scan the
More informationP 1.5 X 4.5 / X 2 and (iii) The smallest value of n for
DHANALAKSHMI COLLEGE OF ENEINEERING, CHENNAI DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING MA645 PROBABILITY AND RANDOM PROCESS UNIT I : RANDOM VARIABLES PART B (6 MARKS). A random variable X
More informationThis is a Gaussian probability centered around m = 0 (the most probable and mean position is the origin) and the mean square displacement m 2 = n,or
Physics 7b: Statistical Mechanics Brownian Motion Brownian motion is the motion of a particle due to the buffeting by the molecules in a gas or liquid. The particle must be small enough that the effects
More information2A1H 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 informationRandom 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 informationProf. Dr.-Ing. Armin Dekorsy Department of Communications Engineering. Stochastic Processes and Linear Algebra Recap Slides
Prof. Dr.-Ing. Armin Dekorsy Department of Communications Engineering Stochastic Processes and Linear Algebra Recap Slides Stochastic processes and variables XX tt 0 = XX xx nn (tt) xx 2 (tt) XX tt XX
More informationSignals and Spectra - Review
Signals and Spectra - Review SIGNALS DETERMINISTIC No uncertainty w.r.t. the value of a signal at any time Modeled by mathematical epressions RANDOM some degree of uncertainty before the signal occurs
More informationThe concentration of a drug in blood. Exponential decay. Different realizations. Exponential decay with noise. dc(t) dt.
The concentration of a drug in blood Exponential decay C12 concentration 2 4 6 8 1 C12 concentration 2 4 6 8 1 dc(t) dt = µc(t) C(t) = C()e µt 2 4 6 8 1 12 time in minutes 2 4 6 8 1 12 time in minutes
More informationPROBABILITY AND RANDOM PROCESSESS
PROBABILITY AND RANDOM PROCESSESS SOLUTIONS TO UNIVERSITY QUESTION PAPER YEAR : JUNE 2014 CODE NO : 6074 /M PREPARED BY: D.B.V.RAVISANKAR ASSOCIATE PROFESSOR IT DEPARTMENT MVSR ENGINEERING COLLEGE, NADERGUL
More informationGaussian, Markov and stationary processes
Gaussian, Markov and stationary processes Gonzalo Mateos Dept. of ECE and Goergen Institute for Data Science University of Rochester gmateosb@ece.rochester.edu http://www.ece.rochester.edu/~gmateosb/ November
More informationStochastic Process II Dr.-Ing. Sudchai Boonto
Dr-Ing Sudchai Boonto Department of Control System and Instrumentation Engineering King Mongkuts Unniversity of Technology Thonburi Thailand Random process Consider a random experiment specified by the
More information2A1H Time-Frequency Analysis II Bugs/queries to HT 2011 For hints and answers visit dwm/courses/2tf
Time-Frequency Analysis II (HT 20) 2AH 2AH Time-Frequency Analysis II Bugs/queries to david.murray@eng.ox.ac.uk HT 20 For hints and answers visit www.robots.ox.ac.uk/ dwm/courses/2tf David Murray. A periodic
More informationLecture 1: Pragmatic Introduction to Stochastic Differential Equations
Lecture 1: Pragmatic Introduction to Stochastic Differential Equations Simo Särkkä Aalto University, Finland (visiting at Oxford University, UK) November 13, 2013 Simo Särkkä (Aalto) Lecture 1: Pragmatic
More informationLTI Systems (Continuous & Discrete) - Basics
LTI Systems (Continuous & Discrete) - Basics 1. A system with an input x(t) and output y(t) is described by the relation: y(t) = t. x(t). This system is (a) linear and time-invariant (b) linear and time-varying
More informationECE 636: Systems identification
ECE 636: Systems identification Lectures 3 4 Random variables/signals (continued) Random/stochastic vectors Random signals and linear systems Random signals in the frequency domain υ ε x S z + y Experimental
More informationThe Hilbert Transform
The Hilbert Transform Frank R. Kschischang The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto October 22, 2006; updated March 0, 205 Definition The Hilbert
More informationSolutions to Problems in Chapter 4
Solutions to Problems in Chapter 4 Problems with Solutions Problem 4. Fourier Series of the Output Voltage of an Ideal Full-Wave Diode Bridge Rectifier he nonlinear circuit in Figure 4. is a full-wave
More informationFunctions not limited in time
Functions not limited in time We can segment an arbitrary L 2 function into segments of width T. The mth segment is u m (t) = u(t)rect(t/t m). We then have m 0 u(t) =l.i.m. m0 u m (t) m= m 0 This wors
More informationFigure 3.1 Effect on frequency spectrum of increasing period T 0. Consider the amplitude spectrum of a periodic waveform as shown in Figure 3.2.
3. Fourier ransorm From Fourier Series to Fourier ransorm [, 2] In communication systems, we oten deal with non-periodic signals. An extension o the time-requency relationship to a non-periodic signal
More informationCONTINUOUS IMAGE MATHEMATICAL CHARACTERIZATION
c01.fm Page 3 Friday, December 8, 2006 10:08 AM 1 CONTINUOUS IMAGE MATHEMATICAL CHARACTERIZATION In the design and analysis of image processing systems, it is convenient and often necessary mathematically
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 informationChapter 2 Random Processes
Chapter 2 Random Processes 21 Introduction We saw in Section 111 on page 10 that many systems are best studied using the concept of random variables where the outcome of a random experiment was associated
More information3F1 Random Processes Examples Paper (for all 6 lectures)
3F Random Processes Examples Paper (for all 6 lectures). Three factories make the same electrical component. Factory A supplies half of the total number of components to the central depot, while factories
More informationE2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)
E.5 Signals & Linear Systems Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & ) 1. Sketch each of the following continuous-time signals, specify if the signal is periodic/non-periodic,
More informationA6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2013
A6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2013 Lecture 26 Localization/Matched Filtering (continued) Prewhitening Lectures next week: Reading Bases, principal
More informationVer 3808 E1.10 Fourier Series and Transforms (2014) E1.10 Fourier Series and Transforms. Problem Sheet 1 (Lecture 1)
Ver 88 E. Fourier Series and Transforms 4 Key: [A] easy... [E]hard Questions from RBH textbook: 4., 4.8. E. Fourier Series and Transforms Problem Sheet Lecture. [B] Using the geometric progression formula,
More informationLecture 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 informationA6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring
A653 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 15 http://www.astro.cornell.edu/~cordes/a653 Lecture 3 Power spectrum issues Frequentist approach Bayesian approach (some
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Spring 2014 TTh 14:30-15:45 CBC C313 Lecture 05 Image Processing Basics 13/02/04 http://www.ee.unlv.edu/~b1morris/ecg782/
More informationCorrelation, discrete Fourier transforms and the power spectral density
Correlation, discrete Fourier transforms and the power spectral density visuals to accompany lectures, notes and m-files by Tak Igusa tigusa@jhu.edu Department of Civil Engineering Johns Hopkins University
More informationfor valid PSD. PART B (Answer all five units, 5 X 10 = 50 Marks) UNIT I
Code: 15A04304 R15 B.Tech II Year I Semester (R15) Regular Examinations November/December 016 PROBABILITY THEY & STOCHASTIC PROCESSES (Electronics and Communication Engineering) Time: 3 hours Max. Marks:
More information4 Classical Coherence Theory
This chapter is based largely on Wolf, Introduction to the theory of coherence and polarization of light [? ]. Until now, we have not been concerned with the nature of the light field itself. Instead,
More informationMath 127: Course Summary
Math 27: Course Summary Rich Schwartz October 27, 2009 General Information: M27 is a course in functional analysis. Functional analysis deals with normed, infinite dimensional vector spaces. Usually, these
More informationStochastic Processes: I. consider bowl of worms model for oscilloscope experiment:
Stochastic Processes: I consider bowl of worms model for oscilloscope experiment: SAPAscope 2.0 / 0 1 RESET SAPA2e 22, 23 II 1 stochastic process is: Stochastic Processes: II informally: bowl + drawing
More informationTime Series Analysis: 4. Linear filters. P. F. Góra
Time Series Analysis: 4. Linear filters P. F. Góra http://th-www.if.uj.edu.pl/zfs/gora/ 2012 Linear filters in the Fourier domain Filtering: Multiplying the transform by a transfer function. g n DFT G
More informationOrdinary Differential Equation Theory
Part I Ordinary Differential Equation Theory 1 Introductory Theory An n th order ODE for y = y(t) has the form Usually it can be written F (t, y, y,.., y (n) ) = y (n) = f(t, y, y,.., y (n 1) ) (Implicit
More informationTimbral, Scale, Pitch modifications
Introduction Timbral, Scale, Pitch modifications M2 Mathématiques / Vision / Apprentissage Audio signal analysis, indexing and transformation Page 1 / 40 Page 2 / 40 Modification of playback speed Modifications
More information5 Operations on Multiple Random Variables
EE360 Random Signal analysis Chapter 5: Operations on Multiple Random Variables 5 Operations on Multiple Random Variables Expected value of a function of r.v. s Two r.v. s: ḡ = E[g(X, Y )] = g(x, y)f X,Y
More information2. (a) What is gaussian random variable? Develop an equation for guassian distribution
Code No: R059210401 Set No. 1 II B.Tech I Semester Supplementary Examinations, February 2007 PROBABILITY THEORY AND STOCHASTIC PROCESS ( Common to Electronics & Communication Engineering, Electronics &
More informationPART 1. Review of DSP. f (t)e iωt dt. F(ω) = f (t) = 1 2π. F(ω)e iωt dω. f (t) F (ω) The Fourier Transform. Fourier Transform.
PART 1 Review of DSP Mauricio Sacchi University of Alberta, Edmonton, AB, Canada The Fourier Transform F() = f (t) = 1 2π f (t)e it dt F()e it d Fourier Transform Inverse Transform f (t) F () Part 1 Review
More informationState Space Representation of Gaussian Processes
State Space Representation of Gaussian Processes Simo Särkkä Department of Biomedical Engineering and Computational Science (BECS) Aalto University, Espoo, Finland June 12th, 2013 Simo Särkkä (Aalto University)
More informationIntroduction to Probability and Stochastic Processes I
Introduction to Probability and Stochastic Processes I Lecture 3 Henrik Vie Christensen vie@control.auc.dk Department of Control Engineering Institute of Electronic Systems Aalborg University Denmark Slides
More informationModule 4. Signal Representation and Baseband Processing. Version 2 ECE IIT, Kharagpur
Module Signal Representation and Baseband Processing Version ECE II, Kharagpur Lesson 8 Response of Linear System to Random Processes Version ECE II, Kharagpur After reading this lesson, you will learn
More information