Summary of Random Variable Concepts April 19, 2000

Similar documents
ADSP ADSP ADSP ADSP. Advanced Digital Signal Processing (18-792) Spring Fall Semester, Department of Electrical and Computer Engineering

信號與系統 Signals and Systems

EECE 301 Signals & Systems Prof. Mark Fowler

信號與系統 Signals and Systems

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 12

Permutation Enumeration

PRACTICAL FILTER DESIGN & IMPLEMENTATION LAB

Roberto s Notes on Infinite Series Chapter 1: Series Section 2. Infinite series

Combinatorics. Chapter Permutations. Reading questions. Counting Problems. Counting Technique: The Product Rule

Ch 9 Sequences, Series, and Probability

7. Counting Measure. Definitions and Basic Properties

8. Combinatorial Structures

Chapter 12 Sound Waves. We study the properties and detection of a particular type of wave sound waves.

Objectives. Some Basic Terms. Analog and Digital Signals. Analog-to-digital conversion. Parameters of ADC process: Related terms

}, how many different strings of length n 1 exist? }, how many different strings of length n 2 exist that contain at least one a 1

CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER

13 Legislative Bargaining

4. INTERSYMBOL INTERFERENCE

X-Bar and S-Squared Charts

Massachusetts Institute of Technology Dept. of Electrical Engineering and Computer Science Fall Semester, Introduction to EECS 2.

Laboratory Exercise 3: Dynamic System Response Laboratory Handout AME 250: Fundamentals of Measurements and Data Analysis

Encode Decode Sample Quantize [ ] [ ]

Logarithms APPENDIX IV. 265 Appendix

A SELECTIVE POINTER FORWARDING STRATEGY FOR LOCATION TRACKING IN PERSONAL COMMUNICATION SYSTEMS

Design of FPGA- Based SPWM Single Phase Full-Bridge Inverter

Data Mining the Online Encyclopedia of Integer Sequences for New Identities Hieu Nguyen

Recovering low frequencies for impedance inversion by frequency domain deconvolution

Chapter (6) Discrete Probability Distributions Examples

CCD Image Processing: Issues & Solutions

A New Space-Repetition Code Based on One Bit Feedback Compared to Alamouti Space-Time Code

APPLICATION NOTE UNDERSTANDING EFFECTIVE BITS

Unit 5: Estimating with Confidence

Spread Spectrum Signal for Digital Communications

The Detection of Abrupt Changes in Fatigue Data by Using Cumulative Sum (CUSUM) Method

Intelligent location of two simultaneously active acoustic emission sources: Part II

lecture notes September 2, Sequential Choice

1. How many possible ways are there to form five-letter words using only the letters A H? How many such words consist of five distinct letters?

Math 140 Introductory Statistics

H2 Mathematics Pure Mathematics Section A Comprehensive Checklist of Concepts and Skills by Mr Wee Wen Shih. Visit: wenshih.wordpress.

Efficient Feedback-Based Scheduling Policies for Chunked Network Codes over Networks with Loss and Delay

Shuffling Cards. D.J.W. Telkamp. Utrecht University Mathematics Bachelor s Thesis. Supervised by Dr. K. Dajani

3. Error Correcting Codes

BOTTLENECK BRANCH MARKING FOR NOISE CONSOLIDATION

Discrete Random Variables: Joint PMFs, Conditioning and Independence

INCREASE OF STRAIN GAGE OUTPUT VOLTAGE SIGNALS ACCURACY USING VIRTUAL INSTRUMENT WITH HARMONIC EXCITATION

LINEAR-PHASE FIR FILTERS: THE WINDOWING METHOD

Name Class. Date Section. Test Form A Chapter Chapter 9 Infinite Series. 1 n 1 2 n 3n 1, n 1, 2, 3, Find the fourth term of the sequence

Measurement of Equivalent Input Distortion AN 20

THE LUCAS TRIANGLE RECOUNTED. Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA Introduction

Single Bit DACs in a Nutshell. Part I DAC Basics

IEEE P Wireless Personal Area Networks

A generalization of Eulerian numbers via rook placements

Harnessing oversampling in correlation-coded OTDR

ON THE FUNDAMENTAL RELATIONSHIP BETWEEN THE ACHIEVABLE CAPACITY AND DELAY IN MOBILE WIRELESS NETWORKS

We often find the probability of an event by counting the number of elements in a simple sample space.

Fitting Signals into Given Spectrum Modulation Methods

AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS

Shuffling. Shahrzad Haddadan. March 7, 2013

x y z HD(x, y) + HD(y, z) HD(x, z)

Design of FPGA Based SPWM Single Phase Inverter

Multipath and Doppler Effects and Models

EE 508 Lecture 6. Filter Concepts/Terminology Approximation Problem

ECE 333: Introduction to Communication Networks Fall Lecture 4: Physical layer II

GENERATE AND MEASURE STANDING SOUND WAVES IN KUNDT S TUBE.

Circular waveguides. Introduction. Table of Contents

Adaptive Comb Filtering for Harmonic Signal Enhancement

On the Number of Permutations on n Objects with. greatest cycle length

General Model :Algorithms in the Real World. Applications. Block Codes

Mod. Notations. Primary definition. Specific values. Traditional name. Traditional notation. Mathematica StandardForm notation. Specialized values

Fingerprint Classification Based on Directional Image Constructed Using Wavelet Transform Domains

PROJECT #2 GENERIC ROBOT SIMULATOR

AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS

Tehrani N Journal of Scientific and Engineering Research, 2018, 5(7):1-7

NOISE IN A SPECTRUM ANALYZER. Carlo F.M. Carobbi and Fabio Ferrini Department of Information Engineering University of Florence, Italy

arxiv: v2 [math.co] 15 Oct 2018

Wavelet Transform. CSEP 590 Data Compression Autumn Wavelet Transformed Barbara (Enhanced) Wavelet Transformed Barbara (Actual)

A Novel Small Signal Power Line Quality Measurement System

Analysis and Optimization Design of Snubber Cricuit for Isolated DC-DC Converters in DC Power Grid

CS3203 #5. 6/9/04 Janak J Parekh

Cooperative Spectrum Sensing in Cognitive Radio Networks

AC : USING ELLIPTIC INTEGRALS AND FUNCTIONS TO STUDY LARGE-AMPLITUDE OSCILLATIONS OF A PENDULUM

Introduction to Wireless Communication Systems ECE 476/ECE 501C/CS 513 Winter 2003

HOW BAD RECEIVER COORDINATES CAN AFFECT GPS TIMING

Performance Limits and Practical Decoding of Interleaved Reed-Solomon Polar Concatenated Codes

AP Calculus BC. Sample Student Responses and Scoring Commentary. Inside: Free Response Question 6. Scoring Guideline.

Chapter 1 The Design of Passive Intermodulation Test System Applied in LTE 2600

Lab 2: Common Source Amplifier.

E X P E R I M E N T 13

Parameter Estimation for Bivariate Mixed Lognormal Distribution

Empirical Estimation of Probability Distribution of Extreme Responses of Turret Moored FPSOs

Combinatorics and probability

Application of Improved Genetic Algorithm to Two-side Assembly Line Balancing

CP 405/EC 422 MODEL TEST PAPER - 1 PULSE & DIGITAL CIRCUITS. Time: Three Hours Maximum Marks: 100

The Throughput and Delay Trade-off of Wireless Ad-hoc Networks

Measurement-Based Opportunistic Feedback and Scheduling for Wireless Systems

Adaptive Resource Allocation in Multiuser OFDM Systems

COMPRESSION OF TRANSMULTIPLEXED ACOUSTIC SIGNALS

Cancellation of Multiuser Interference due to Carrier Frequency Offsets in Uplink OFDMA

A Bipolar Cockcroft-Walton Voltage Multiplier for Gas Lasers

The Fundamental Capacity-Delay Tradeoff in Large Mobile Ad Hoc Networks

Transcription:

Summary of Radom Variable Cocepts April 9, 2000 his is a list of importat cocepts we have covered, rather tha a review that derives or explais them. he first ad primary viewpoit: A radom process is a idexed collectio of radom variables. hat is, a radom process is {X(t): t I}, where I is a ifiite collectio of times (or time idices). For each time t i I, there is a radom variable deoted X(t). Sometimes we write X t istead of X(t). he radom process itself is deoted {X(t): t I}, or by oe of the shorthads: {X(t)}, X(t), X or ay of the previous with X t replacig X(t). Discrete ad Cotiuous ime Radom Processes Discrete-time radom processes have I = {0,,2,...}, I = {,2,3,... } or I = {...,-2,-,0,,2,... }. For discrete-time processes we ofte use the followig otatios {X()}, {X } or replace by some other letter such as i,j,k,m that suggests a iteger. Cotiuous-time radom processes have I = [a,b], where - a<b. Probability Distributio of the Radom Process {X(t)} o kow the probability distributio of a radom process is to kow the joit distributio of every fiite collectio of its radom variables; i.e. to kow the joit distributio of X(t ), X(t 2 ),...,X(t ) for every ad t,...,t I. For example, it suffices to kow the joit cdf, pdf or cmf of X(t ), X(t 2 ),...,X(t ). Kowig the probability distributio of a radom process, we ca compute the probability of ay evet ivolvig the radom process, or ay coditioal probability, or ay expected value. Partial Characterizatios of the Probability Distributio of a Radom Process {X(t)} he probability distributio of a radom process is a awful lot to have to kow or to specify. Cosequetly, we ofte work with oe or more of the followig partial descriptios of its probability distributio.. First-order distributio: his cosists of the margial distributios of every idividual radom variable X(t), t I, as specified, for example, by cdf, pdf or pmf of every idividual radom variable. 2. Secod-order distributio: his cosists of the joit distributio of every pair of radom variables (X(t),X(s)) t,s I, as specified, for example by the joit cdf, pdf or pmf of every pair of radom variables. 3. th-order distributio: his cosists of the joit distributio of every collectio of radom variables (X(t ),...,X(t )), t,...,t I, as specified, for example by specifyig the joit cdf, pdf or pmf of collectio of radom variables. 4. mea fuctio: m X (t) = E X(t) 5. power fuctio: P X (t) = E X 2 (t) 6. autocorrelatio fuctio: R X (t,t 2 ) = correlatio betwee X(t ) ad X(t 2 ) = E X(t ) X(t 2 ) EECS 40 Witer 2000

7. autocovariace fuctio: C X (t,t 2 ) = covariace of X(t ) ad X(t 2 ) = E [(X(t )-m X (t ))(X(t 2 )-m X (t 2 ))] = R X (t,t 2 ) - m X (t )m X (t 2 ) (we derived this formula i class) Some Discrete-ime Examples. IID Radom Process (Idepedet ad Idetically Distributed): Like the ame suggests, the radom variables are idepedet ad idetically distributed. For IID radom processes the complete probability distributio is determied from the probability distributio of just oe radom variable. 2. Beroulli Radom Process: A biary IID radom process. 3. Movig Average (MA) Radom Process: M- Y = bi X i i=0 where {X } is a IID process, M 2 is a iteger, ad b 0,...,b M- are parameters. 4. Autoregressive Radom (AR) Process: N Y = ai Y -i + X N i= where {X } is a IID process, X is idepedet of Y -,Y -2,..., N is a iteger, ad a 0,...,a N are parameters. 5. Autoregressive Radom Movig Average (ARMA) Process: N M- Y = ai Y -i + bi X i i= i=0 where {X } is a IID process, X is idepedet of Y -,Y -2,..., N is a iteger, a 0,...,a N are parameters, M 2 is a iteger, ad b 0,...,b M- are parameters. 6. Biomial Radom Process: Y = Xi i= where {X } is a Beroulli process, with X = 0 or. 7. Gaussia Radom Process: his meas that every fiite collectio of the radom variables is joitly Gaussia. Some Cotiuous-ime Examples. Siusoidal radom process: X(t) = A cos(ωt + Θ) where A ad Θ are idepedet radom variables, ad Θ is uiformly distributed o [0,2π). EECS 40 2 Witer 2000

2. Poisso Coutig Process: Let, 2,... be a IID radom process where each is expoetially distributed with mea /a. is the th iterarrival time. Let S = + 2 +...+. S is the th arrival time. Y(t) = if S t ad S + > t, i.e. if the th evet has occurred by time t but ot the +'th. 3. Radom Process with Fiite Number of Sample Fuctios: Sample fuctios: X(t,) =, X(t,2) = -2, X(t,3) = si πt, X(t,4) = cos πt. hese have probabilities P(), P(2), P(3), P(4) 4. Gaussia Radom Process: his meas that every fiite collectio of the radom variables is joitly Gaussia. 5. White Noise Ra\dom Process: his is a WSS radom process with power spectral desity that is costat with frequecy. he Secod, i.e. Alterative, View of a Radom Process A radom process is a radomly chose sample fuctio. More specifically, a radom process is {X(t,s): t I, s S}, where I is a set of time-idices (as before) ad S is the sample space of some uderlyig radom experimet with probability law P. For each t, X(t,s) is a radom variable. (Recall that model of a radom variable as a fuctio of a uderlyig radom experimet. Note that the value of this model is that all radom variables are viewed as fuctios of the same uderlyig experimet.) For each s S, X(t,s) is a fuctio of t called a sample fuctio. Oe may thik of the radom process as beig geerated i the followig way: At the begiig of time, the uderlyig experimet is performed (whose probability law is P) resultig i a outcome s. he radom process produces the sample fuctio X(t,s) (for this particular s). his is called the sample-fuctio viewpoit. I priciple, oe ca derive the probability distributio of the radom process (as eeded i the first viewpoit) by kowig the fuctio X(t,s) ad the probability law P of the uderlyig experimet. Statioarity A radom process {X(t): t I} is (strictly) statioary if the probability distributio of X(t +τ),x(t 2 +τ),...,x(t +τ) does ot deped o τ for every choice of ad t,...,t. hat is, F X(t +τ),x(t 2 +τ),...,x(t +τ) (x,...,x ) does ot deped o τ ad if the radom process has joit pdf's or pmf's, the same holds for them. he basic idea is that for a statioary r.p. the probability distributios of radom variables (ad vectors) do ot chage with time shifts. he probability of somethig happeig at time t is the same as the probability of it happeig at ay other time. he followig are some of the cosequeces of statioarity: f X(t) (x) = fx(s)(x) all t,s,x f X(t)X(t+τ) (x,x2) = fx(s)x(s+τ)(x,x2) all t, s, τ, x,x2 µ X (t) is the same for all t R X (t,t+τ) does ot deped o t. EECS 40 3 Witer 2000

Wide-sese Statioarity A radom process {X(t): t } is wide-sese statioary (WSS) if m X (t) ad R X (t,t+τ) do ot deped o t. Statioarity wide-sese statioary. he coverse is false. Wide-sese statioarity is a weak kid of statioarity that is easier to check ad to work with, sice it oly depeds o the mea ad autocorrelatio fuctios. Properties of the Autocorrelatio Fuctio of Wide-Sese Statioary (or Statioary) Radom Processes. Symmetry: R X (-τ) = RX(τ) 2. R X (0) R X (τ) for all τ 3. R X (τ) = R decay (τ) + R m (τ) + R periodic (τ), where R decay (τ) is a fuctio such that R decay (τ) 0 as τ, R m (τ) = (m X ) 2 is the term due to the mea of the radom process, ad R periodic (τ) is a periodice fuctio that is itself due to a periodic compoet of the sample fuctios. Ergodicity (this will ot be covered o the exam, but is icluded here for completeess) Recall the law of large umbers. Does it hold for radom processes other tha IID? Sometimes yes, sometimes o. Processes for which it does are called ergodic. Defiitio: (ot the stadard mathematical defiitio) A discrete-time statioary radom process {X(): =,2,...} is (strict-sese) ergodic if i= g(x(i+),,x(i+m) E g(x(),...,x(m)) almost surely as for ay m ad ay fuctio g(x,...,xm) such that E g(x,,xm) is well-defied. A cotiuous-time statioary radom process {X(t): t [0,)} is (strict-sese) ergodic if 0 g(x(t+τi), X(t+τm)) E g(x(τ),...,x(τm)) almost surely as for ay m, τ,...,τm ad ay fuctio g(x,...,xm) such that E g(x(τ),,x(τm)) is welldefied. For "two-sided" discrete- ad cotiuous-time radom processes, the above averages are replaced by 2+ i=- ad 2 -, respectively. he basic idea is that for ergodic processes, time averages coverge to expected values. As examples, the followig are cosequeces of ergodicity. 2. i= X(i) EX, 0 X(t) dt EX i= 2 2 X (i) EX, 0 X 2 (t) dt EX 2 EECS 40 4 Witer 2000

3. 4. i= X(i)X(i+) R X(), 0 X(t)X(t+τ) dt RX(τ) i= X(i)X(i+m) R X(m), 5. A N P(A) where A is ay evet ad A is the umber of times A occurs i X(),...,X() For statioary processes that are ot ergodic, time averages such as those above coverge, but ot to the expected value. Istead, all that we ca say is E g(x(i+),,x(i+m)) i= E g(x(),...,x(m)) as E 0 g(x(t+τi), X(t+τm)) E g(x(τ),...,x(τm)) as Radom Processes ito Liear Filters Here we focus oly o cotiuous-time radom processes ad filters. he situatio is basically the same for discrete-time radom processes ad filters, but we have ot had the time to discuss it. If the wide-sese statioary radom process {X(t)} with mea m X ad autocorrelatio fuctio R X (τ) is the iput to a liear filter with impulse respose h(t) ad frequecy respose H(f), the the output of the filter is a wide-sese statioary radom process {Y(t)} with m Y = m X h(t) dt = m X H(0) - R X (τ) = R X (τ) * h(τ) * h(-τ) recall the def of covolutio: x(t)*y(t) = x(u) y(t-u) du - Importat Fact: If the iput to a liear filter is a Gaussia radom process, the the output is a Gaussia radom process. Power Spectral Desity he power spectral desity of a WSS radom process {X(t)} is S X (f) = F{R X (τ)} = R X (τ) e -j2πfτ dτ = Fourier trasform of R X (τ) - Properties of the power spectral desity:. S X (f) 0. 2. S X (-f) = S X (f). 3. S X (f) dx = power i {X(t)} - EECS 40 5 Witer 2000

f 2 4. 2 S X (f) dx = power i {X(t)} i the frequecy bad [f,f 2 ]. f his is why it is called a power spectral desity; i.e. oe itegrates it over a frequecy bad to obtai the power i that bad. 5. If {X(t)} is the iput to a liear filter with frequecy respose H(f), the the output radom process {Y(t)} has power spectral desity S Y (f) = S X (f) H(f) H(-f) = S X (f) H(f) 2 6. Alterate formula for the power spectral desity (more difficult to work with) S X (f) = lim 2 E F{X (t)} 2, where X (t) = X(t), - t 0, else 7. Power spectral desity of some simple processes: a. X(t) = A, where A is a radom variable S X (f) = E A 2 δ(f). b. X(t) = A cos (2πft+Θ) where A ad Θ are idepedet radom variables ad Θ is uiformly distributed o [0,2π). he S X (f) = 2 E A2 [δ(f-f o ) + δ(f+f o )] c. If the iput to a liear filter with frequecy respose H(f) is white oise X(t) with S Y (f) = c, the the output has power spectral desity S Y (f) = c H(f) 2 EECS 40 6 Witer 2000