Digtal Signal Processing And Modeling www.themegallery.com The Autocorrelation Extension Problem Chapter 5.2.8 2006. 09. 21 / KIM JEONG JOONG / 20067168.

Slides:



Advertisements
Similar presentations
SUNG JOO KIM The Step-Up and Step-Down Recursions
Advertisements

Digtal Signal Processing And Modeling The Design of FIR Least Squares Inverse Filters Chapter Application / KIM.
1 Valid and Invalid arguments. 2 Definition of Argument Sequence of statements: Statement 1; Statement 2; Therefore, Statement 3. Statements 1 and 2 are.
AGC DSP AGC DSP Professor A G Constantinides©1 Modern Spectral Estimation Modern Spectral Estimation is based on a priori assumptions on the manner, the.
1 Chapter 5 Numerical Integration. 2 A Review of the Definite Integral.
Quantum One: Lecture 16.
1 Copyright M.R.K. Krishna Rao Solving Recurrence Relations Steps for solving a linear homogeneous recurrence relation of degree 2 : Step #1.
Lecture 6 Hyperreal Numbers (Nonstandard Analysis)
Use of moment generating functions. Definition Let X denote a random variable with probability density function f(x) if continuous (probability mass function.
AGC DSP AGC DSP Professor A G Constantinides©1 A Prediction Problem Problem: Given a sample set of a stationary processes to predict the value of the process.
Linear Algebraic Equations
Ch 5.2: Series Solutions Near an Ordinary Point, Part I
Chapter 7. Random Process – Spectral Characteristics
4.2 Integer Exponents and the Quotient Rule
Adaptive Signal Processing
Review of Probability.
1 7.1 Discrete Fourier Transform (DFT) 7.2 DFT Properties 7.3 Cyclic Convolution 7.4 Linear Convolution via DFT Chapter 7 Discrete Fourier Transform Section.
Copyright © Cengage Learning. All rights reserved.
Random Process The concept of random variable was defined previously as mapping from the Sample Space S to the real line as shown below.
Properties and the Inverse of
Polynomial Datapaths Optimization Using Finite Abstract Algebra(I) Presenter: 陳炳元 Graduate Institute of Electronics Engineering Graduate Institute of Electronics.
7.4 Generating Functions Definition 1: The generation function for the sequence a 0, a 1,...,a k,... of real numbers is the infinite series G(x) = a 0.
Time Series Analysis.
Chapter 5 Section 2 Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Chapter 4.3 Logarithms. The previous section dealt with exponential function of the form y = a x for all positive values of a, where a ≠1.
Page 4 – 6 #7, 8, 10, 12, page 6 Challenge yourself.
Functions of Random Variables. Methods for determining the distribution of functions of Random Variables 1.Distribution function method 2.Moment generating.
Chapter 9 Factor Analysis
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
1 1 Chapter 3 The z-Transform 2 2  Consider a sequence x[n] = u[n]. Its Fourier transform does not converge.  Consider that, instead of e j , we use.
Chapter 5 Section 2. Objectives 1 Copyright © 2012, 2008, 2004 Pearson Education, Inc. Use 0 as an exponent. Use negative numbers as exponents. Use the.
1 Binomial Coefficients CS 202 Epp, section ??? Aaron Bloomfield.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
One Random Variable Random Process.
Inequalities Denoting Inequalities Properties Solving Inequalities.
Fourier Analysis of Discrete Time Signals
Week 21 Stochastic Process - Introduction Stochastic processes are processes that proceed randomly in time. Rather than consider fixed random variables.
Chapter 2.7 – Absolute Value Inequalities. Objectives Solve absolute value inequalities of the form /x/ < a Solve absolute value inequalities of the form.
CHAPTER 5 SIGNAL SPACE ANALYSIS
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 9/18/2008.
CHAPTER Continuity Series Definition: Given a series   n=1 a n = a 1 + a 2 + a 3 + …, let s n denote its nth partial sum: s n =  n i=1 a i = a.
1 EE571 PART 4 Classification of Random Processes Huseyin Bilgekul Eeng571 Probability and astochastic Processes Department of Electrical and Electronic.
Analysis of Experimental Data; Introduction
Discrete-time Random Signals
1 EE571 PART 3 Random Processes Huseyin Bilgekul Eeng571 Probability and astochastic Processes Department of Electrical and Electronic Engineering Eastern.
Inductive Proofs and Inductive Definitions Jim Skon.
Vocabulary Unit 4 Section 1:
Week 111 Some facts about Power Series Consider the power series with non-negative coefficients a k. If converges for any positive value of t, say for.
CS104:Discrete Structures Chapter 2: Proof Techniques.
Chapter 5.1 Notes Simplifying Polynomials Multiplying Polynomials Degree of a Polynomial Algebra 2.
Introduction to Logarithms Chapter 8.4. Logarithmic Functions log b y = x if and only if b x = y.
1-1 © 2008 Pearson Prentice Hall. All rights reserved Chapter 1 Real Numbers and Algebraic Expressions Active Learning Questions.
AUTOCORRELATION 1 Assumption B.5 states that the values of the disturbance term in the observations in the sample are generated independently of each other.
Geology 5600/6600 Signal Analysis 11 Sep 2015 © A.R. Lowry 2015 Last time: The Central Limit theorem : The sum of a sequence of random variables tends.
1 Section 7.1 First-Order Predicate Calculus Predicate calculus studies the internal structure of sentences where subjects are applied to predicates existentially.
Extending a displacement A displacement defined by a pair where l is the length of the displacement and  the angle between its direction and the x-axix.
CHAPTER 1 – EQUATIONS AND INEQUALITIES 1.4 – SOLVING ABSOLUTE VALUE EQUATIONS Unit 1 – First-Degree Equations and Inequalities.
RS – Reed Solomon Error correcting code. Error-correcting codes are clever ways of representing data so that one can recover the original information.
Chapter 2 The z-transform and Fourier Transforms The Z Transform The Inverse of Z Transform The Prosperity of Z Transform System Function System Function.
DYNAMIC BEHAVIOR OF PROCESSES :
4.3 Riemann Sums and Definite Integrals
Chapter R Section 7: Radical Notation and Rational Exponents
P.3 Polynomials and Special Products Unit P:Prerequisites for Algebra 5-Trig.
College Algebra Chapter 4 Exponential and Logarithmic Functions
ELG5377 Adaptive Signal Processing
Real Numbers and Their Properties
Modern Spectral Estimation
College Algebra Chapter 4 Exponential and Logarithmic Functions
Math Properties.
Chapter 4 THE LAPLACE TRANSFORM.
Presentation transcript:

Digtal Signal Processing And Modeling The Autocorrelation Extension Problem Chapter / KIM JEONG JOONG /

statistical D.S.P Autocorrelation Extension Given the first (p + 1) values of an autocorrelation sequence, r(k) for k = 0, 1,..., p, how may we extend (extrapolate) this partial autocorrelation sequence for k > p in such a way that the extrapolated sequence is a valid autocorrelation sequence? the autocorrelation matrix formed from this sequence must be nonnegative definite, Rp>=0 Therefore, any extension must preserve this nonnegative definite property, i.e., Rp+1 >= 0, and Rp+2 >= 0, and so on.

statistical D.S.P Autocorrelation Extension This follows from the act that this extrapolation generates the autocorrelation sequence of the AR(p) process that is consistent with the given autocorrelation values given a partial autocorrelation sequence r, (k) for k = 0, 1,..., p, what values of r(p+1) will produce a valid partial autocorrelation sequence with Rp+1 >= 0 The answers to these questions may be deduced from Property 7 by expressing rx ( p + 1 ) in terms of the reflection coefficient Г(p+1) may place a bound on the allowable values for r(p + 1)

statistical D.S.P Autocorrelation Extension

statistical D.S.P Example Given the partial autocorrelation sequence rx (0) = 1 and r, (1) = 0.5, let us find the set of allowable values for r, (2), assuming that rx (2) is real. For the first-order model we have and a1 (1) = Г1 = Thus, with a first-order modeling error of €1 = rx(0)[l - |Г1|^2] = 0.75 we have r,(2) = -Г2 € 1 - al(l)rx(l) = -0.75Г Therefore, with 1 rz 1 a 1 it follows that In the special case of rz = 0, rx(2) = 0.25 and, in the extreme cases of Г 2 = ±1, The autocorrelation values are r, (2) = -0.5 and r, (2) = 1.