Random Process Part 1

Similar documents
ANALYSIS IN THE FREQUENCY DOMAIN

1973 AP Calculus AB: Section I

Slide 1. Slide 2. Slide 3 DIGITAL SIGNAL PROCESSING CLASSIFICATION OF SIGNALS

Bifurcation Theory. , a stationary point, depends on the value of α. At certain values

SECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero.

Lecture 2: Discrete-Time Signals & Systems. Reza Mohammadkhani, Digital Signal Processing, 2015 University of Kurdistan eng.uok.ac.

Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.

Need to understand interaction of macroscopic measures

Supplementary Materials

Continuous probability distributions

Cramér-Rao Inequality: Let f(x; θ) be a probability density function with continuous parameter

Where k is either given or determined from the data and c is an arbitrary constant.

Linear-Phase FIR Transfer Functions. Functions. Functions. Functions. Functions. Functions. Let

10. The Discrete-Time Fourier Transform (DTFT)

Problem Statement. Definitions, Equations and Helpful Hints BEAUTIFUL HOMEWORK 6 ENGR 323 PROBLEM 3-79 WOOLSEY

Lecture 37 (Schrödinger Equation) Physics Spring 2018 Douglas Fields

Chapter 10. The singular integral Introducing S(n) and J(n)

SAFE HANDS & IIT-ian's PACE EDT-15 (JEE) SOLUTIONS

Hydrogen Atom and One Electron Ions

Superposition. Thinning

Search sequence databases 3 10/25/2016

ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process

COMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, April 04, 2005, 8:35 AM) PART I: CHAPTER TWO COMB MATH.

Searching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list.

22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches.

Sec 2.3 Modeling with First Order Equations

Functions of Two Random Variables

High Energy Physics. Lecture 5 The Passage of Particles through Matter

Optics and Non-Linear Optics I Non-linear Optics Tutorial Sheet November 2007

Introduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018

2. Laser physics - basics

Recall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1

Computing and Communications -- Network Coding

Complex Powers and Logs (5A) Young Won Lim 10/17/13

2. Background Material

1997 AP Calculus AB: Section I, Part A

cycle that does not cross any edges (including its own), then it has at least

Why is a E&M nature of light not sufficient to explain experiments?

Limiting value of higher Mahler measure

Coupled Pendulums. Two normal modes.

Note If the candidate believes that e x = 0 solves to x = 0 or gives an extra solution of x = 0, then withhold the final accuracy mark.

Solution: APPM 1360 Final (150 pts) Spring (60 pts total) The following parts are not related, justify your answers:

Basic Polyhedral theory

Functions of Two Random Variables

BSc Engineering Sciences A. Y. 2017/18 Written exam of the course Mathematical Analysis 2 August 30, x n, ) n 2

2008 AP Calculus BC Multiple Choice Exam

Content Skills Assessments Lessons. Identify, classify, and apply properties of negative and positive angles.

EEO 401 Digital Signal Processing Prof. Mark Fowler

What is the product of an integer multiplied by zero? and divided by zero?

Section 11.6: Directional Derivatives and the Gradient Vector

Outline. Thanks to Ian Blockland and Randy Sobie for these slides Lifetimes of Decaying Particles Scattering Cross Sections Fermi s Golden Rule

The van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012

Spectral Synthesis in the Heisenberg Group

EAcos θ, where θ is the angle between the electric field and

Addition of angular momentum

Exercise 1. Sketch the graph of the following function. (x 2

Week 3: Connected Subgraphs

Text: WMM, Chapter 5. Sections , ,

Self-Adjointness and Its Relationship to Quantum Mechanics. Ronald I. Frank 2016

A Propagating Wave Packet Group Velocity Dispersion

The graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the

Math-3. Lesson 5-6 Euler s Number e Logarithmic and Exponential Modeling (Newton s Law of Cooling)

INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS. xy 1 (mod p), (x, y) I (j)

Ch. 24 Molecular Reaction Dynamics 1. Collision Theory

Diploma Macro Paper 2

Linear Non-Gaussian Structural Equation Models

Quasi-Classical States of the Simple Harmonic Oscillator

SER/BER in a Fading Channel

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results

Introduction to the Fourier transform. Computer Vision & Digital Image Processing. The Fourier transform (continued) The Fourier transform (continued)

The Matrix Exponential

Chapter 13 GMM for Linear Factor Models in Discount Factor form. GMM on the pricing errors gives a crosssectional

(1) Then we could wave our hands over this and it would become:

Strongly Connected Components

Y 0. Standing Wave Interference between the incident & reflected waves Standing wave. A string with one end fixed on a wall

A. Limits and Horizontal Asymptotes ( ) f x f x. f x. x "±# ( ).

Derangements and Applications

The pn junction: 2 Current vs Voltage (IV) characteristics

The Matrix Exponential

u r du = ur+1 r + 1 du = ln u + C u sin u du = cos u + C cos u du = sin u + C sec u tan u du = sec u + C e u du = e u + C

Network Congestion Games

2F1120 Spektrala transformer för Media Solutions to Steiglitz, Chapter 1

Addition of angular momentum

EXST Regression Techniques Page 1

1997 AP Calculus AB: Section I, Part A

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula

Mathematics. Complex Number rectangular form. Quadratic equation. Quadratic equation. Complex number Functions: sinusoids. Differentiation Integration


Higher order derivatives

1 Minimum Cut Problem

y = 2xe x + x 2 e x at (0, 3). solution: Since y is implicitly related to x we have to use implicit differentiation: 3 6y = 0 y = 1 2 x ln(b) ln(b)

surface of a dielectric-metal interface. It is commonly used today for discovering the ways in

ON RIGHT(LEFT) DUO PO-SEMIGROUPS. S. K. Lee and K. Y. Park

Numbering Systems Basic Building Blocks Scaling and Round-off Noise. Number Representation. Floating vs. Fixed point. DSP Design.

Problem Set #2 Due: Friday April 20, 2018 at 5 PM.

ABEL TYPE THEOREMS FOR THE WAVELET TRANSFORM THROUGH THE QUASIASYMPTOTIC BOUNDEDNESS

The second condition says that a node α of the tree has exactly n children if the arity of its label is n.

Contemporary, atomic, nuclear, and particle physics

Section 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation.

Transcription:

Random Procss Part A random procss t (, ζ is a signal or wavform in tim. t : tim ζ : outcom in th sampl spac Each tim w rapat th xprimnt, a nw wavform is gnratd. ( W will adopt t for short. Tim sampls of a random procss ( t constitut a squnc of random variabls:,,, or ( t, ( t, ( t, t t t3 3 Statistical Rlationship among Random Sampls In gnral, a random procss is compltly charactrizd by th joint cdf F,,, ( x, x,, xk Pt x, t x,, t x k t t tk k for any choic of t < t < < t k and for any k Howvr w may nd a simplr modl that is clos to th ral world tractabl to analysis. Frquntly usd assumptions ar: Stationary and wid-sns stationary random procsss for analyzing signals Markov procsss for analyzing quus

Classs of Random Procss Stationary Random Procss: tim-shift-invariant ( t is a stationary random procss if F ( x, x,, x F ( x, x,, x,,, k,,, k t t tk t+ t+ tk+ for any, for any choic of t < t < < t, and for any k Wid-Sns Stationary Random Procss ( t is a wid-sns stationary (WSS random procss if k Man: ( t m for all t Autocorrlation: R ( t, t R (, t t for any t and t Markov procss Mmorylss: t t for any F ( x x x,, x F ( x x,,, k+ k, k k+ k tk+ tk tk t tk+ tk k and for any choic of t < t < < t < t k k+

3 Momnts of a Random Procss Man m ( t ( t Varianc { } σ ( t ( t m ( t Auto-corrlation t R ( t, t t t Auto-covarianc ( t t { }{ } C ( t, t m ( t m ( t t t R ( t, t m ( t m ( t cov, is an altrnativ notation.

4 Exampls of Random Procsss Random Phas Signal t ( cos( ωt+θ, whr Θ is a random variabl, uniform in th intrval (0, π. Th man of th random procss is m ( t ( t cos( ωt+θ cos( ωt+ θ f ( θ dθ Θ π cos( ωt+ θ dθ 0 π 0 for all t. Th auto-corrlation is R ( t, t ( t ( t cos( ωt +Θ cos( ωt +Θ ωt + θ ωt + θ dθ π π cos( 0 cos( π cos( ωt + ωt + θ + cos( ωt ωt π 0 0 + cos ( { ω t t } dθ cos ω R ( t, t is a function of t t. Th random phas signal is a wid-sns stationary random procss Rf. cos( A+ B + cos( A B cos Acos B, cos( A+ B cos Acos B sin Asin B

5 Random Tlgraph Signal ( t taks on on of th two valus for any t. For simplicity, assum th signal lvl is ithr + or at any tim. Th tim btwn succssiv transitions is xponntially distributd with man. α Th procss bgins at tim t 0. (0 ± with qual probabilitis 0.5 W claim [ ] [ ] P ( t P ( t 0.5 for any t ( ( ( ( ( ( ( P t P 0 P t 0 P 0 P t 0 + P[ an odd numbr of transitions] + P[ an vn numbr of transitions] P[ any numbr of transitions] Howvr w not [ ] k k 0 k 0 P an vn numbr of transitions duringintrval t P ( t ( αt αt k ( αt k 0 αt αt + αt αt P[ an odd numbr of transitions during intrval t] αt αt αt ( k! k ( k! αt + αt

6 Naturally m ( t 0 and σ ( t for allt. W claim α R ( t, t whr t t. R ( t, t ( t ( t ( P[ ( t ( t ] ( P[ ( t ( t ] + + [ an vn numbr of transitions during ] [ an odd numbr of ] P t t P α t t α t t + α t t α whr t t Th autocorrlation dcays with. Th random tlgraph signal is a wid-sns stationary random procss.

7 Winr Procss and Brownian Motion Initially (0 0. Th procss maks a transition vry Δ in tim, up or down by h with qual probabilitis. W claim that m ( t 0 for all t, and σ ( t αt as Δ 0. Modl th succssiv transitions as iid random variabls D, D, D3,. Thn j σd j D 0 and h αδ.. How many transitions occur during (0, t? Ans. t Δ Thrfor and ( t D + D + + D m ( t 0, t σ ( t αδ αt Δ t Δ According to th cntral limit thorm, as Δ 0, ( t bcoms a gaussian random variabl N(0, αt.

8 W claim that R ( t, t α min( t, t Suppos t< t. Thn R ( t, t ( t ( t D+ D + + D t D + D + + D t Δ Δ noting DD D D 0 for i j i j i j t Δ D + D + + D t α Δ Δ αt α min( tt, Th Winr procss is not a wid-sns stationary random procss.

9 Exampls of Stationary Random Procsss To prov ( t is a stationary random procss, w must show th tim-shift-invarianc: F ( x, x,, x F ( x, x,, x,,, k,,, k t t tk t+ t+ tk + for any, any choic of t < t < < t, and for any k A random tlgraph signal is stationary k W hav shown [ ] [ ] P ( t P ( t 0.5 for any t + p ( θ P[ an vn numbr of transitions during a tim intrval θ] po ( θ P[ an odd numbr of transitions during a tim intrval θ] Lt k b th numbr of sampls. For k, f ( x ± with prob 0.5, for any t. t That is quivalnt to say f ( x f ( x for any t+ t αθ αθ For k, f ( x, x (, with prob 0.5 p ( t t for any., t+ t+ (, 0.5 p ( t t (, 0.5 p ( t t (, 0.5 p ( t t o o

0 f, t+ t+ ( x, x dos not dpnd on. f ( x, x f ( x, x for any.,, t+ t+ t t For k 3, f ( x, x, x (,, with prob 0.5 p ( t t p ( t t,, 3 3 t+ t+ t3+ (,, 0.5 p ( t t p ( t t o 3 (,, 0.5 p ( t t p ( t t o 3 (,, 0.5 p ( t t p ( t t 3 (,, 0.5 p ( t t p ( t t 3 (,, 0.5 po( t t po( t3 t (,, 0.5 p ( t t p ( t t o o o o 3 (,, 0.5 p ( t t p ( t t 3 for any. f ( x, x, x dos not dpnd on.,, 3 t+ t+ t3+ f ( x, x, x f ( x, x, x for any.,, 3,, 3 t+ t+ t3+ t t t3 In gnral, w can s that f ( x, x,, x dos not dpnd on for any k,,, k t+ t+ t k + and for any sampling instants t,, t. k

A random phas signal is stationary t ( cos( ωt+θ, whr Θ is uniform ovr (0, π is stationary. In fact, on can show any priodic signal with th random phas uniformly distributd ovr th priod is stationary [rf. Wozncraft and Jacobs, Principls of Communications Enginring, pp37]

Wid-sns Stationary Random Procss Thorm. A stationary random procss is a wid-sns stationary random procss. wid-sns stationary stationary ( Suppos t Howvr is stationary. Thn ( ( f x, x f x, x for any t, t and s.,, t t t+ s t+ s R ( t, t t t applying tim shift of s t R t t 0 t t (, xx f x x dxdx, (, xx f x x dxdx, ( whr t t. Som proprtis of wid-sns stationary random procsss:. Avrag powr dos not vary with th tim t t t+ 0 R (0, which do not vary with t.. Autocorrlation is an vn function R ( R ( R ( t t R t ( t intrchanging th ordr

3 3. Max Valu R (0 R ( for any From th Cauchy-Schwartz inquality, for any rvs and Y, Y Y., Thrfor Howvr That says t t+ t t+ (0 t t+ R R ( t t+ for any. R (0 R ( for any Sinc R (0 0, R (0 R (. Also R ( R ( 4. Bound on th rat of chang { R R } (0 ( P t+ t > ε. ε Markov Inquality: For any non-ngativ random variabl, P[ > ε] u( ε / ε ε ( P P t+ t > ε t+ t > ε ( t+ ε { R R } (0 ( t ε from th Markov inquality

4 5. If R (0 R ( d, thn ( Using th Cauchy-Schwartz inquality, ( ( R is priodic with priod d, and ( 0 t+ + d t+ t t+ + d t+ t for any t+ d t t t+ + d t t+ t+ + d + t+ t+ t+ + d t for any { + } { } R ( d R ( R (0 R ( d R (0 { } If R (0 R ( d, R ( + d R ( 0. Thrfor R ( + d R ( for any. ( Also + R (0 R ( d 0 t+ d t t+ d t t t+ d 6. If ( t m+ N( t and Nt ( 0 and lim R N ( 0, thn lim R ( m. R ( t t+ ( m N ( m N + + ( ( Thrfor lim R ( m t N t+ m + m N + N + N N m + R t t+ t t+ S LG (3 rd Edition pp.54 figur9.3 for som plots of autocorrlation.