ECE302 Spring 2006 HW12 Solutions April 27,
|
|
|
- Cuthbert Carter
- 9 years ago
- Views:
Transcription
1 ECE02 Spring 2006 HW2 Solutions April 27, 2006 Solutions to HW2 Note: These solutions are D. J. Goodman, the authors of our textbook. I have annotated and corrected them as necessary. Text in italics is mine. Problem Let A be a nonnegative random variable that is independent of any collection of samples Xt ),...,Xt k ) of a wide sense stationary random process Xt). Is Y t) = A + Xt) a wide sense stationary process? Problem Solution To show that Y t) is wide-sense stationary we must show that it meets the two requirements of Definition 0.5, namely that its expected value and autocorelation function must be independent of t. Since Y t) = A + Xt), the mean of Y t) is The autocorrelation of Y t) is E [Y t)] = E [A] + E [Xt)] = E [A] + µ X ) R Y t,τ) = E [A + Xt))A + Xt + τ))] 2) = E [ A 2] + E [A] E [Xt)] + AE [Xt + τ)] + E [Xt)Xt + τ)] ) = E [ A 2] + 2E [A]µ X + R X τ), 4) where the last equality is justified by the fact that we are given that Xt) is wide sense stationary. We see that neither E[Y t)] nor R Y t,τ) depend on t. Thus Y t) is a wide sense stationary process. Problem 0.. Xt) and Y t) are independent wide sense stationary processes with expected values µ X and µ Y and autocorrelation functions R X τ) and R Y τ) respectively. Let Wt) = Xt)Y t). a) Find µ W and R W t,τ) and show that Wt) is wide sense stationary. b) Are Wt) and Xt) jointly wide sense stationary? Problem 0.. Solution a) Since Xt) and Y t) are independent processes, E [Wt)] = E [Xt)Y t)] = E [Xt)]E [Y t)] = µ X µ Y. ) In addition, R W t,τ) = E [Wt)Wt + τ)] 2) = E [Xt)Y t)xt + τ)y t + τ)] ) = E [Xt)Xt + τ)]e [Y t)y t + τ)] 4) = R X τ)r Y τ) 5) We can conclude that Wt) is wide sense stationary.
2 ECE02 Spring 2006 HW2 Solutions April 27, b) To examine whether Xt) and Wt) are jointly wide sense stationary, we calculate R WX t,τ) = E [Wt)Xt + τ)] = E [Xt)Y t)xt + τ)]. 6) By independence of Xt) and Y t), R WX t,τ) = E [Xt)Xt + τ)]e [Y t)] = µ Y R X τ). 7) Since Wt) and Xt) are both wide sense stationary and since R WX t,τ) depends only on the time difference τ, we can conclude from Definition 0.8 that Wt) and Xt) are jointly wide sense stationary. Problem 0..2 Xt) is a wide sense stationary random process. For each process X i t) defined below, determine whether X i t) and Xt) are jointly wide sense stationary. a) X t) = Xt + a) b) X 2 t) = Xat) Problem 0..2 Solution To show that Xt) and X i t) are jointly wide sense stationary, we must first show that X i t) is wide sense stationary and then we must show that the cross correlation R XXi t,τ) is only a function of the time difference τ. For each X i t), we have to check whether these facts are implied by the fact that Xt) is wide sense stationary. a) Since E[X t)] = E[Xt + a)] = µ X and R X t,τ) = E [X t)x t + τ)] ) = E [Xt + a)xt + τ + a)] 2) = R X τ), ) we have verified that X t) is wide sense stationary. Now we calculate the cross correlation R XX t,τ) = E [Xt)X t + τ)] 4) = E [Xt)Xt + τ + a)] 5) = R X τ + a). 6) Since R XX t,τ) depends on the time difference τ but not on the absolute time t, we conclude that Xt) and X t) are jointly wide sense stationary. b) Since E[X 2 t)] = E[Xat)] = µ X and R X2 t,τ) = E [X 2 t)x 2 t + τ)] 7) = E [Xat)Xat + τ))] 8) = E [Xat)Xat + aτ)] = R X aτ), 9)
3 ECE02 Spring 2006 HW2 Solutions April 27, 2006 we have verified that X 2 t) is wide sense stationary. Now we calculate the cross correlation R XX2 t,τ) = E [Xt)X 2 t + τ)] 0) = E [Xt)Xat + τ))] ) = R X a )t + τ). 2) Except for the trivial case when a = and X 2 t) = Xt), R XX2 t,τ) depends on both the absolute time t and the time difference τ, we conclude that Xt) and X 2 t) are not jointly wide sense stationary. Problem 0.. Xt) is a wide sense stationary stochastic process with autocorrelation function R X τ) = 0 sin2π000τ)/2π000τ). The process Y t) is a version of Xt) delayed by 50 microseconds: Y t) = Xt t 0 ) where t 0 = s. a) Derive the autocorrelation function of Y t). b) Derive the cross-correlation function of Xt) and Y t). c) Is Y t) wide sense stationary? d) Are Xt) and Y t) jointly wide sense stationary? Problem 0.. Solution a) Y t) has autocorrelation function b) The cross correlation of Xt) and Y t) is R Y t,τ) = E [Y t)y t + τ)] ) = E [Xt t 0 )Xt + τ t 0 )] 2) = R X τ). ) R XY t,τ) = E [Xt)Y t + τ)] 4) = E [Xt)Xt + τ t 0 )] 5) = R X τ t 0 ). 6) c) We have already verified that R Y t,τ) depends only on the time difference τ. Since E[Y t)] = E[Xt t 0 )] = µ X, we have verified that Y t) is wide sense stationary. d) Since Xt) and Y t) are wide sense stationary and since we have shown that R XY t,τ) depends only on τ, we know that Xt) and Y t) are jointly wide sense stationary. Comment: This problem is badly designed since the conclusions don t depend on the specific R X τ) given in the problem text. Sorry about that!)
4 ECE02 Spring 2006 HW2 Solutions April 27, Problem.2. The random sequence X n is the input to a discrete-time filter. The output is a) What is the impulse response h n? Y n = X n+ + X n + X n. b) Find the autocorrelation of the output Y n when X n is a wide sense stationary random sequence with µ X = 0 and autocorrelation { n = 0, R X [n] = 0 otherwise. Problem.2. Solution a) Note that Y i = h n X i n = X i+ + X i + X i ) n= By matching coefficients, we see that h n = { / n =,0, 0 otherwise 2) b) By Theorem.5, the output autocorrelation is R Y [n] = h i h j R X [n + i j] ) = 9 i= j= i= j= R X [n + i j] 4) = 9 R X [n + 2] + 2R X [n + ] + R X [n] + 2R X [n ] + R X [n 2]) 5) We see that the filter is linear and time invariant. Substituting in R X [n] yields / n = 0 2/9 n = R Y [n] = /9 n = 2 0 otherwise 6)
5 ECE02 Spring 2006 HW2 Solutions April 27, Problem.2.2 Xt) is a wide sense stationary process with autocorrelation function sin2000πt) + sin000πt) R X τ) = πt The process Xt) is sampled at rate /T s = 4,000 Hz, yielding the discrete-time process X n. What is the autocorrelation function R X [k] of X n? Problem.2.2 Solution Applying Theorem.4 with sampling period T s = /4000 s yields R X [k] = R X kt s ) = 0 sin2000πkt s) + sin000πkt s ) 2000πkT s ) sin0.5πk) + sin0.25πk) = 20 πk 2) = 0 sinc0.5k) + 5 sinc0.25k) ) Problem.. X n is a stationary Gaussian sequence with expected value E[X n ] = 0 and autocorrelation function R X [k] = 2 k. Find the PDF of X = [ X X 2 X ]. Problem.. Solution Since the process X n has expected value E[X n ] = 0, we know that C X k) = R X k) = 2 k. Thus X = [ ] X X 2 X has covariance matrix /2 /4 C X = = /2 /2. ) /4 /2 From Definition 5.7, the PDF of X is f X x) = 2π) n/2 exp ) [det C X )] /2 2 x C X x. 2) Equivalently, we can write out the PDF in terms of the variables x, x 2 and x. To do so we find that the inverse covariance matrix is 4/ 2/ 0 C X = 2/ 5/ 2/ ) 0 2/ 4/ A little bit of algebra will show that detc X ) = 9/6 and that It follows that f X x) = 2 x C X x = 2x2 + 5x x2 2x x 2 2x 2x. 4) 4 exp 2x2 2π) /2 5x x2 + 2x x 2 + 2x ) 2x. 5)
6 ECE02 Spring 2006 HW2 Solutions April 27, Problem..2 X n is a sequence of independent random variables such that X n = 0 for n < 0 while for n 0, each X n is a Gaussian 0,) random variable. Passing X n through the filter h = [ ] yields the output Yn. Find the PDFs of: a) Y = [ Y Y 2 Y ], b) Y 2 = [ Y Y 2 ]. Problem..2 Solution The sequence X n is passed through the filter The output sequence is Y n. h = [ h 0 h h 2 ] = [ ] ) a) Following the approach of Equation.58), we can write the output Y = [ ] Y Y 2 Y as X Y h h X Y = Y 2 = h 2 h h 0 0 X = 0 X X Y 0 h 2 h h ) X 2 X } {{ } H X }{{} X We note that the components of X are iid Gaussian 0, ) random variables. Hence X has covariance matrix C X = I, the identity matrix. Since Y = HX, 2 2 C Y = HC X H = HH = 2 2. ) 2 Some calculation by hand or by Matlab) will show that detc Y ) = and that C Y = ) 2 2 Some algebra will show that This implies Y has PDF y C Y y = 5y2 + 5y y2 + 8y y 2 + 2y y + 4y 2 y. 5) f Y y) = 2π) /2 [detc Y )] = 2π) /2 exp exp /2 2 y C Y y 5y2 + 5y y2 + 8y y 2 + 2y y + 4y 2 y 6 ) 6) ). 7)
7 ECE02 Spring 2006 HW2 Solutions April 27, b) To find the PDF of Y 2 = [ ], Y Y 2 we start by observing that the covariance matrix of Y 2 is just the upper left 2 2 submatrix of C Y. That is, [ ] [ ] 2 2 C Y2 = and C /2 2 Y 2 =. 8) Since detc Y2 ) = 2, it follows that f Y2 y) = 2π) /2 [detc Y2 )] = 2π) /2 2 exp exp /2 2 y C 2 y2 2y y 2 y2 2 ) Y 2 y 9) ). 0) Problem.5. Xt) is a wide sense stationary process with autocorrelation function R X τ) = 0 What is the power spectral density of Xt)? sin2000πτ) + sin000πτ). 2000πτ Problem.5. Solution To use Table., we write R X τ) in terms of the autocorrelation In terms of the sinc ) function, we obtain sincx) = sinπx) πx. ) R X τ) = 0sinc2000τ) + 5sinc000τ). 2) From Table., S X f) = 0 ) f 2,000 rect + 5 ) f 2000,000 rect,000 ) Here is a graph of the PSD S X f) f
8 ECE02 Spring 2006 HW2 Solutions April 27, Problem.6. X n is a wide sense stationary discrete-time random sequence with autocorrelation function { δ[k] + 0.) k k = 0, ±, ±2,..., R X [k] = 0 otherwise. Find the power spectral density S X f). Problem.6. Solution Since the random sequence X n has autocorrelation function R X [k] = δ k + 0.) k, ) We can find the PSD directly from Table.2 with 0. k corresponding to a k. The table yields 0.) cos 2πφ S X φ) = ) 2 = 20.)cos 2πφ.0 0.2cos 2πφ. 2)
Probability and Random Variables. Generation of random variables (r.v.)
Probability and Random Variables Method for generating random variables with a specified probability distribution function. Gaussian And Markov Processes Characterization of Stationary Random Process Linearly
LS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
Chapter 8 - Power Density Spectrum
EE385 Class Notes 8/8/03 John Stensby Chapter 8 - Power Density Spectrum Let X(t) be a WSS random process. X(t) has an average power, given in watts, of E[X(t) ], a constant. his total average power is
EE 179 April 21, 2014 Digital and Analog Communication Systems Handout #16 Homework #2 Solutions
EE 79 April, 04 Digital and Analog Communication Systems Handout #6 Homework # Solutions. Operations on signals (Lathi& Ding.3-3). For the signal g(t) shown below, sketch: a. g(t 4); b. g(t/.5); c. g(t
ECE302 Spring 2006 HW5 Solutions February 21, 2006 1
ECE3 Spring 6 HW5 Solutions February 1, 6 1 Solutions to HW5 Note: Most of these solutions were generated by R. D. Yates and D. J. Goodman, the authors of our textbook. I have added comments in italics
SF2940: Probability theory Lecture 8: Multivariate Normal Distribution
SF2940: Probability theory Lecture 8: Multivariate Normal Distribution Timo Koski 24.09.2015 Timo Koski Matematisk statistik 24.09.2015 1 / 1 Learning outcomes Random vectors, mean vector, covariance matrix,
Solutions to Exam in Speech Signal Processing EN2300
Solutions to Exam in Speech Signal Processing EN23 Date: Thursday, Dec 2, 8: 3: Place: Allowed: Grades: Language: Solutions: Q34, Q36 Beta Math Handbook (or corresponding), calculator with empty memory.
SF2940: Probability theory Lecture 8: Multivariate Normal Distribution
SF2940: Probability theory Lecture 8: Multivariate Normal Distribution Timo Koski 24.09.2014 Timo Koski () Mathematisk statistik 24.09.2014 1 / 75 Learning outcomes Random vectors, mean vector, covariance
5 Systems of Equations
Systems of Equations Concepts: Solutions to Systems of Equations-Graphically and Algebraically Solving Systems - Substitution Method Solving Systems - Elimination Method Using -Dimensional Graphs to Approximate
MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
1 Short Introduction to Time Series
ECONOMICS 7344, Spring 202 Bent E. Sørensen January 24, 202 Short Introduction to Time Series A time series is a collection of stochastic variables x,.., x t,.., x T indexed by an integer value t. The
Overview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model
Overview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model 1 September 004 A. Introduction and assumptions The classical normal linear regression model can be written
min ǫ = E{e 2 [n]}. (11.2)
C H A P T E R 11 Wiener Filtering INTRODUCTION In this chapter we will consider the use of LTI systems in order to perform minimum mean-square-error (MMSE) estimation of a WSS random process of interest,
TTT4120 Digital Signal Processing Suggested Solution to Exam Fall 2008
Norwegian University of Science and Technology Department of Electronics and Telecommunications TTT40 Digital Signal Processing Suggested Solution to Exam Fall 008 Problem (a) The input and the input-output
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
Linearly Independent Sets and Linearly Dependent Sets
These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for in-class presentation
Systems with Persistent Memory: the Observation Inequality Problems and Solutions
Chapter 6 Systems with Persistent Memory: the Observation Inequality Problems and Solutions Facts that are recalled in the problems wt) = ut) + 1 c A 1 s ] R c t s)) hws) + Ks r)wr)dr ds. 6.1) w = w +
Generating Random Numbers Variance Reduction Quasi-Monte Carlo. Simulation Methods. Leonid Kogan. MIT, Sloan. 15.450, Fall 2010
Simulation Methods Leonid Kogan MIT, Sloan 15.450, Fall 2010 c Leonid Kogan ( MIT, Sloan ) Simulation Methods 15.450, Fall 2010 1 / 35 Outline 1 Generating Random Numbers 2 Variance Reduction 3 Quasi-Monte
Digital Signal Processing IIR Filter Design via Impulse Invariance
Digital Signal Processing IIR Filter Design via Impulse Invariance D. Richard Brown III D. Richard Brown III 1 / 11 Basic Procedure We assume here that we ve already decided to use an IIR filter. The basic
Correlation in Random Variables
Correlation in Random Variables Lecture 11 Spring 2002 Correlation in Random Variables Suppose that an experiment produces two random variables, X and Y. What can we say about the relationship between
Matrices and Polynomials
APPENDIX 9 Matrices and Polynomials he Multiplication of Polynomials Let α(z) =α 0 +α 1 z+α 2 z 2 + α p z p and y(z) =y 0 +y 1 z+y 2 z 2 + y n z n be two polynomials of degrees p and n respectively. hen,
College of the Holy Cross, Spring 2009 Math 373, Partial Differential Equations Midterm 1 Practice Questions
College of the Holy Cross, Spring 29 Math 373, Partial Differential Equations Midterm 1 Practice Questions 1. (a) Find a solution of u x + u y + u = xy. Hint: Try a polynomial of degree 2. Solution. Use
Lecture 8 ELE 301: Signals and Systems
Lecture 8 ELE 3: Signals and Systems Prof. Paul Cuff Princeton University Fall 2-2 Cuff (Lecture 7) ELE 3: Signals and Systems Fall 2-2 / 37 Properties of the Fourier Transform Properties of the Fourier
3 Signals and Systems: Part II
3 Signals and Systems: Part II Recommended Problems P3.1 Sketch each of the following signals. (a) x[n] = b[n] + 3[n - 3] (b) x[n] = u[n] - u[n - 5] (c) x[n] = 6[n] + 1n + (i)2 [n - 2] + (i)ag[n - 3] (d)
Determine If An Equation Represents a Function
Question : What is a linear function? The term linear function consists of two parts: linear and function. To understand what these terms mean together, we must first understand what a function is. The
The Bivariate Normal Distribution
The Bivariate Normal Distribution This is Section 4.7 of the st edition (2002) of the book Introduction to Probability, by D. P. Bertsekas and J. N. Tsitsiklis. The material in this section was not included
For a partition B 1,..., B n, where B i B j = for i. A = (A B 1 ) (A B 2 ),..., (A B n ) and thus. P (A) = P (A B i ) = P (A B i )P (B i )
Probability Review 15.075 Cynthia Rudin A probability space, defined by Kolmogorov (1903-1987) consists of: A set of outcomes S, e.g., for the roll of a die, S = {1, 2, 3, 4, 5, 6}, 1 1 2 1 6 for the roll
THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok
THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexer Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html This is a joint work with J.A. Hartigan
Probability Generating Functions
page 39 Chapter 3 Probability Generating Functions 3 Preamble: Generating Functions Generating functions are widely used in mathematics, and play an important role in probability theory Consider a sequence
Advanced Signal Processing and Digital Noise Reduction
Advanced Signal Processing and Digital Noise Reduction Saeed V. Vaseghi Queen's University of Belfast UK WILEY HTEUBNER A Partnership between John Wiley & Sons and B. G. Teubner Publishers Chichester New
Row Echelon Form and Reduced Row Echelon Form
These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation
Probability for Estimation (review)
Probability for Estimation (review) In general, we want to develop an estimator for systems of the form: x = f x, u + η(t); y = h x + ω(t); ggggg y, ffff x We will primarily focus on discrete time linear
Solving Systems of Linear Equations Using Matrices
Solving Systems of Linear Equations Using Matrices What is a Matrix? A matrix is a compact grid or array of numbers. It can be created from a system of equations and used to solve the system of equations.
The continuous and discrete Fourier transforms
FYSA21 Mathematical Tools in Science The continuous and discrete Fourier transforms Lennart Lindegren Lund Observatory (Department of Astronomy, Lund University) 1 The continuous Fourier transform 1.1
NRZ Bandwidth - HF Cutoff vs. SNR
Application Note: HFAN-09.0. Rev.2; 04/08 NRZ Bandwidth - HF Cutoff vs. SNR Functional Diagrams Pin Configurations appear at end of data sheet. Functional Diagrams continued at end of data sheet. UCSP
SGN-1158 Introduction to Signal Processing Test. Solutions
SGN-1158 Introduction to Signal Processing Test. Solutions 1. Convolve the function ( ) with itself and show that the Fourier transform of the result is the square of the Fourier transform of ( ). (Hints:
ON SUPERCYCLICITY CRITERIA. Nuha H. Hamada Business Administration College Al Ain University of Science and Technology 5-th st, Abu Dhabi, 112612, UAE
International Journal of Pure and Applied Mathematics Volume 101 No. 3 2015, 401-405 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v101i3.7
Chapter 10 Introduction to Time Series Analysis
Chapter 1 Introduction to Time Series Analysis A time series is a collection of observations made sequentially in time. Examples are daily mortality counts, particulate air pollution measurements, and
SECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA
SECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA This handout presents the second derivative test for a local extrema of a Lagrange multiplier problem. The Section 1 presents a geometric motivation for the
Linear and quadratic Taylor polynomials for functions of several variables.
ams/econ 11b supplementary notes ucsc Linear quadratic Taylor polynomials for functions of several variables. c 010, Yonatan Katznelson Finding the extreme (minimum or maximum) values of a function, is
1.5. Factorisation. Introduction. Prerequisites. Learning Outcomes. Learning Style
Factorisation 1.5 Introduction In Block 4 we showed the way in which brackets were removed from algebraic expressions. Factorisation, which can be considered as the reverse of this process, is dealt with
Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain
Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
Introduction to Time Series Analysis. Lecture 1.
Introduction to Time Series Analysis. Lecture 1. Peter Bartlett 1. Organizational issues. 2. Objectives of time series analysis. Examples. 3. Overview of the course. 4. Time series models. 5. Time series
Linear Threshold Units
Linear Threshold Units w x hx (... w n x n w We assume that each feature x j and each weight w j is a real number (we will relax this later) We will study three different algorithms for learning linear
Introduction to General and Generalized Linear Models
Introduction to General and Generalized Linear Models General Linear Models - part I Henrik Madsen Poul Thyregod Informatics and Mathematical Modelling Technical University of Denmark DK-2800 Kgs. Lyngby
ECE302 Spring 2006 HW3 Solutions February 2, 2006 1
ECE302 Spring 2006 HW3 Solutions February 2, 2006 1 Solutions to HW3 Note: Most of these solutions were generated by R. D. Yates and D. J. Goodman, the authors of our textbook. I have added comments in
Zeros of Polynomial Functions
Zeros of Polynomial Functions The Rational Zero Theorem If f (x) = a n x n + a n-1 x n-1 + + a 1 x + a 0 has integer coefficients and p/q (where p/q is reduced) is a rational zero, then p is a factor of
Some probability and statistics
Appendix A Some probability and statistics A Probabilities, random variables and their distribution We summarize a few of the basic concepts of random variables, usually denoted by capital letters, X,Y,
Time Series Analysis of Aviation Data
Time Series Analysis of Aviation Data Dr. Richard Xie February, 2012 What is a Time Series A time series is a sequence of observations in chorological order, such as Daily closing price of stock MSFT in
The Monte Carlo Framework, Examples from Finance and Generating Correlated Random Variables
Monte Carlo Simulation: IEOR E4703 Fall 2004 c 2004 by Martin Haugh The Monte Carlo Framework, Examples from Finance and Generating Correlated Random Variables 1 The Monte Carlo Framework Suppose we wish
CONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation
Chapter 2 CONTROLLABILITY 2 Reachable Set and Controllability Suppose we have a linear system described by the state equation ẋ Ax + Bu (2) x() x Consider the following problem For a given vector x in
Chapter 17. Orthogonal Matrices and Symmetries of Space
Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length
Lecture 8: Signal Detection and Noise Assumption
ECE 83 Fall Statistical Signal Processing instructor: R. Nowak, scribe: Feng Ju Lecture 8: Signal Detection and Noise Assumption Signal Detection : X = W H : X = S + W where W N(, σ I n n and S = [s, s,...,
An Introduction to Machine Learning
An Introduction to Machine Learning L5: Novelty Detection and Regression Alexander J. Smola Statistical Machine Learning Program Canberra, ACT 0200 Australia [email protected] Tata Institute, Pune,
Chapter 9. Systems of Linear Equations
Chapter 9. Systems of Linear Equations 9.1. Solve Systems of Linear Equations by Graphing KYOTE Standards: CR 21; CA 13 In this section we discuss how to solve systems of two linear equations in two variables
LECTURE 4. Last time: Lecture outline
LECTURE 4 Last time: Types of convergence Weak Law of Large Numbers Strong Law of Large Numbers Asymptotic Equipartition Property Lecture outline Stochastic processes Markov chains Entropy rate Random
5 Signal Design for Bandlimited Channels
225 5 Signal Design for Bandlimited Channels So far, we have not imposed any bandwidth constraints on the transmitted passband signal, or equivalently, on the transmitted baseband signal s b (t) I[k]g
Principle of Data Reduction
Chapter 6 Principle of Data Reduction 6.1 Introduction An experimenter uses the information in a sample X 1,..., X n to make inferences about an unknown parameter θ. If the sample size n is large, then
Time Series Analysis 1. Lecture 8: Time Series Analysis. Time Series Analysis MIT 18.S096. Dr. Kempthorne. Fall 2013 MIT 18.S096
Lecture 8: Time Series Analysis MIT 18.S096 Dr. Kempthorne Fall 2013 MIT 18.S096 Time Series Analysis 1 Outline Time Series Analysis 1 Time Series Analysis MIT 18.S096 Time Series Analysis 2 A stochastic
2.3. Finding polynomial functions. An Introduction:
2.3. Finding polynomial functions. An Introduction: As is usually the case when learning a new concept in mathematics, the new concept is the reverse of the previous one. Remember how you first learned
MULTIVARIATE PROBABILITY DISTRIBUTIONS
MULTIVARIATE PROBABILITY DISTRIBUTIONS. PRELIMINARIES.. Example. Consider an experiment that consists of tossing a die and a coin at the same time. We can consider a number of random variables defined
Time Series Analysis
Time Series Analysis Autoregressive, MA and ARMA processes Andrés M. Alonso Carolina García-Martos Universidad Carlos III de Madrid Universidad Politécnica de Madrid June July, 212 Alonso and García-Martos
Stat 704 Data Analysis I Probability Review
1 / 30 Stat 704 Data Analysis I Probability Review Timothy Hanson Department of Statistics, University of South Carolina Course information 2 / 30 Logistics: Tuesday/Thursday 11:40am to 12:55pm in LeConte
Vector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
Homework #2 Solutions
MAT Spring Problems Section.:, 8,, 4, 8 Section.5:,,, 4,, 6 Extra Problem # Homework # Solutions... Sketch likely solution curves through the given slope field for dy dx = x + y...8. Sketch likely solution
Year 9 set 1 Mathematics notes, to accompany the 9H book.
Part 1: Year 9 set 1 Mathematics notes, to accompany the 9H book. equations 1. (p.1), 1.6 (p. 44), 4.6 (p.196) sequences 3. (p.115) Pupils use the Elmwood Press Essential Maths book by David Raymer (9H
3.1 Solving Systems Using Tables and Graphs
Algebra 2 Chapter 3 3.1 Solve Systems Using Tables & Graphs 3.1 Solving Systems Using Tables and Graphs A solution to a system of linear equations is an that makes all of the equations. To solve a system
Notes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
M2S1 Lecture Notes. G. A. Young http://www2.imperial.ac.uk/ ayoung
M2S1 Lecture Notes G. A. Young http://www2.imperial.ac.uk/ ayoung September 2011 ii Contents 1 DEFINITIONS, TERMINOLOGY, NOTATION 1 1.1 EVENTS AND THE SAMPLE SPACE......................... 1 1.1.1 OPERATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
Solving Linear Systems, Continued and The Inverse of a Matrix
, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing
3. Interpolation. Closing the Gaps of Discretization... Beyond Polynomials
3. Interpolation Closing the Gaps of Discretization... Beyond Polynomials Closing the Gaps of Discretization... Beyond Polynomials, December 19, 2012 1 3.3. Polynomial Splines Idea of Polynomial Splines
CCNY. BME I5100: Biomedical Signal Processing. Linear Discrimination. Lucas C. Parra Biomedical Engineering Department City College of New York
BME I5100: Biomedical Signal Processing Linear Discrimination Lucas C. Parra Biomedical Engineering Department CCNY 1 Schedule Week 1: Introduction Linear, stationary, normal - the stuff biology is not
Lecture 5 Principal Minors and the Hessian
Lecture 5 Principal Minors and the Hessian Eivind Eriksen BI Norwegian School of Management Department of Economics October 01, 2010 Eivind Eriksen (BI Dept of Economics) Lecture 5 Principal Minors and
Maximum likelihood estimation of mean reverting processes
Maximum likelihood estimation of mean reverting processes José Carlos García Franco Onward, Inc. [email protected] Abstract Mean reverting processes are frequently used models in real options. For
Solving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation
The sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].
Probability Theory Probability Spaces and Events Consider a random experiment with several possible outcomes. For example, we might roll a pair of dice, flip a coin three times, or choose a random real
Math 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,
COMPLETE MARKETS DO NOT ALLOW FREE CASH FLOW STREAMS
COMPLETE MARKETS DO NOT ALLOW FREE CASH FLOW STREAMS NICOLE BÄUERLE AND STEFANIE GRETHER Abstract. In this short note we prove a conjecture posed in Cui et al. 2012): Dynamic mean-variance problems in
A course in Time Series Analysis. Suhasini Subba Rao Email: [email protected]
A course in Time Series Analysis Suhasini Subba Rao Email: [email protected] August 5, 205 Contents Introduction 8. Time Series data................................. 8.. R code....................................2
Ex. 2.1 (Davide Basilio Bartolini)
ECE 54: Elements of Information Theory, Fall 00 Homework Solutions Ex.. (Davide Basilio Bartolini) Text Coin Flips. A fair coin is flipped until the first head occurs. Let X denote the number of flips
State Space Time Series Analysis
State Space Time Series Analysis p. 1 State Space Time Series Analysis Siem Jan Koopman http://staff.feweb.vu.nl/koopman Department of Econometrics VU University Amsterdam Tinbergen Institute 2011 State
FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL
FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL STATIsTICs 4 IV. RANDOm VECTORs 1. JOINTLY DIsTRIBUTED RANDOm VARIABLEs If are two rom variables defined on the same sample space we define the joint
3. Reaction Diffusion Equations Consider the following ODE model for population growth
3. Reaction Diffusion Equations Consider the following ODE model for population growth u t a u t u t, u 0 u 0 where u t denotes the population size at time t, and a u plays the role of the population dependent
UNIVERSITY OF CALIFORNIA, SAN DIEGO Electrical & Computer Engineering Department ECE 101 - Fall 2010 Linear Systems Fundamentals
UNIVERSITY OF CALIFORNIA, SAN DIEGO Electrical & Computer Engineering Department ECE 101 - Fall 2010 Linear Systems Fundamentals FINAL EXAM WITH SOLUTIONS (YOURS!) You are allowed one 2-sided sheet of
SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
Department of Chemical Engineering ChE-101: Approaches to Chemical Engineering Problem Solving MATLAB Tutorial VI
Department of Chemical Engineering ChE-101: Approaches to Chemical Engineering Problem Solving MATLAB Tutorial VI Solving a System of Linear Algebraic Equations (last updated 5/19/05 by GGB) Objectives:
The Open University s repository of research publications and other research outputs
Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:
A SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS
A SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS Eusebio GÓMEZ, Miguel A. GÓMEZ-VILLEGAS and J. Miguel MARÍN Abstract In this paper it is taken up a revision and characterization of the class of
Understanding and Applying Kalman Filtering
Understanding and Applying Kalman Filtering Lindsay Kleeman Department of Electrical and Computer Systems Engineering Monash University, Clayton 1 Introduction Objectives: 1. Provide a basic understanding
Spatial Statistics Chapter 3 Basics of areal data and areal data modeling
Spatial Statistics Chapter 3 Basics of areal data and areal data modeling Recall areal data also known as lattice data are data Y (s), s D where D is a discrete index set. This usually corresponds to data
Abstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix multiplication).
MAT 2 (Badger, Spring 202) LU Factorization Selected Notes September 2, 202 Abstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix
Scott C. Douglas, et. Al. Convergence Issues in the LMS Adaptive Filter. 2000 CRC Press LLC. <http://www.engnetbase.com>.
Scott C. Douglas, et. Al. Convergence Issues in the LMS Adaptive Filter. 2000 CRC Press LLC. . Convergence Issues in the LMS Adaptive Filter Scott C. Douglas University of Utah
Basics of Floating-Point Quantization
Chapter 2 Basics of Floating-Point Quantization Representation of physical quantities in terms of floating-point numbers allows one to cover a very wide dynamic range with a relatively small number of
2.1 Increasing, Decreasing, and Piecewise Functions; Applications
2.1 Increasing, Decreasing, and Piecewise Functions; Applications Graph functions, looking for intervals on which the function is increasing, decreasing, or constant, and estimate relative maxima and minima.
