ECE-S Introduction to Digital Signal Processing Lecture 3C Properties of Autocorrelation and Correlation

Similar documents
Digital Signal Processing

ELEN E4810: Digital Signal Processing Topic 2: Time domain

Lecture 4: FT Pairs, Random Signals and z-transform

Lecture 19 IIR Filters

Module 3. Convolution. Aim

Properties of LTI Systems

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

Digital Signal Processing Lecture 3 - Discrete-Time Systems

Digital Signal Processing Lecture 4

Probability Space. J. McNames Portland State University ECE 538/638 Stochastic Signals Ver

ELC 4351: Digital Signal Processing

Discrete-Time Signals & Systems

Chapter 7: The z-transform

INTRODUCTION Noise is present in many situations of daily life for ex: Microphones will record noise and speech. Goal: Reconstruct original signal Wie

ECE4270 Fundamentals of DSP Lecture 20. Fixed-Point Arithmetic in FIR and IIR Filters (part I) Overview of Lecture. Overflow. FIR Digital Filter

Interchange of Filtering and Downsampling/Upsampling

Discrete Fourier Transform

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

Frequency-Domain C/S of LTI Systems

EE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley

ELEG 305: Digital Signal Processing


Discrete-time signals and systems

Analog vs. discrete signals

EEM 409. Random Signals. Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Problem 2:

Universiti Malaysia Perlis EKT430: DIGITAL SIGNAL PROCESSING LAB ASSIGNMENT 3: DISCRETE TIME SYSTEM IN TIME DOMAIN

Flash File. Module 3 : Sampling and Reconstruction Lecture 28 : Discrete time Fourier transform and its Properties. Objectives: Scope of this Lecture:

7.17. Determine the z-transform and ROC for the following time signals: Sketch the ROC, poles, and zeros in the z-plane. X(z) = x[n]z n.

Lecture 18: Stability

UNIT-II Z-TRANSFORM. This expression is also called a one sided z-transform. This non causal sequence produces positive powers of z in X (z).

DIGITAL SIGNAL PROCESSING LECTURE 1

Digital Signal Processing I Final Exam Fall 2008 ECE Dec Cover Sheet

MAHALAKSHMI ENGINEERING COLLEGE-TRICHY

Projection Theorem 1

Chapter 3 Convolution Representation

COURSE OUTLINE. Introduction Signals and Noise Filtering Noise Sensors and associated electronics. Sensors, Signals and Noise 1

Digital Signal Processing Lecture 5

EE538 Final Exam Fall 2007 Mon, Dec 10, 8-10 am RHPH 127 Dec. 10, Cover Sheet

DSP Laboratory (EELE 4110) Lab#3 Discrete Time Signals

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Digital Filter Structures. Basic IIR Digital Filter Structures. of an LTI digital filter is given by the convolution sum or, by the linear constant

Properties of the Autocorrelation Function

LECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)

EE123 Digital Signal Processing

DSP-I DSP-I DSP-I DSP-I

UNIT 1. SIGNALS AND SYSTEM

6.02 Fall 2012 Lecture #10

ECE 438 Exam 2 Solutions, 11/08/2006.

EE538 Final Exam Fall :20 pm -5:20 pm PHYS 223 Dec. 17, Cover Sheet

DETECTION theory deals primarily with techniques for

LAB # 3 HANDOUT. y(n)=t[x(n)] Discrete systems have different classifications based on the input and output relation:

Solutions. Number of Problems: 10

EEL3135: Homework #4

Lecture 11 FIR Filters

Quadratic Equations 6 QUESTIONS. Relatively Easy: Questions 1 to 2 Moderately Difficult: Questions 3 to 4 Difficult: Questions 5 to 6

UCSD ECE153 Handout #40 Prof. Young-Han Kim Thursday, May 29, Homework Set #8 Due: Thursday, June 5, 2011

MMSE System Identification, Gradient Descent, and the Least Mean Squares Algorithm

ELEG 305: Digital Signal Processing

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz

EE482: Digital Signal Processing Applications

III.B Linear Transformations: Matched filter

Solution 10 July 2015 ECE301 Signals and Systems: Midterm. Cover Sheet

Discrete-Time Systems

Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes (cont d)

Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes

Stability Condition in Terms of the Pole Locations

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches

Final Exam ECE301 Signals and Systems Friday, May 3, Cover Sheet

ECE 308 Discrete-Time Signals and Systems

ECE 636: Systems identification

Z-Transform. The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = g(t)e st dt. Z : G(z) =

EE123 Digital Signal Processing

y[n] = = h[k]x[n k] h[k]z n k k= 0 h[k]z k ) = H(z)z n h[k]z h (7.1)

A DARK GREY P O N T, with a Switch Tail, and a small Star on the Forehead. Any

Two Posts to Fill On School Board

z-transforms Definition of the z-transform Chapter

Lecture Schedule: Week Date Lecture Title

Definition. A signal is a sequence of numbers. sequence is also referred to as being in l 1 (Z), or just in l 1. A sequence {x(n)} satisfying

The z-transform Part 2

EE123 Digital Signal Processing

E : Lecture 1 Introduction

Each problem is worth 25 points, and you may solve the problems in any order.

SRI VIDYA COLLEGE OF ENGINEERING AND TECHNOLOGY UNIT 3 RANDOM PROCESS TWO MARK QUESTIONS

Numbers. 2.1 Integers. P(n) = n(n 4 5n 2 + 4) = n(n 2 1)(n 2 4) = (n 2)(n 1)n(n + 1)(n + 2); 120 =

Chapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform

Shift Property of z-transform. Lecture 16. More z-transform (Lathi 5.2, ) More Properties of z-transform. Convolution property of z-transform

ESE 531: Digital Signal Processing

SOLUTIONS FOR PROBLEMS 1-30

ECE503: Digital Signal Processing Lecture 6

UCSD ECE 153 Handout #46 Prof. Young-Han Kim Thursday, June 5, Solutions to Homework Set #8 (Prepared by TA Fatemeh Arbabjolfaei)

The Z-Transform. Fall 2012, EE123 Digital Signal Processing. Eigen Functions of LTI System. Eigen Functions of LTI System

Introduction to Statistical Inference

Introduction to DSP Time Domain Representation of Signals and Systems

Examples. 2-input, 1-output discrete-time systems: 1-input, 1-output discrete-time systems:

Lecture 7 - IIR Filters

Discrete Time Fourier Transform (DTFT)

Series Solutions. 8.1 Taylor Polynomials

Lecture 19: Bayesian Linear Estimators

ECE534, Spring 2018: Solutions for Problem Set #5

Transcription:

ECE-S352-701 Introduction to Digital Signal Processing Lecture 3C Properties of Autocorrelation and Correlation Assuming we have two sequences x(n) and y(n) from which we form a linear combination: c(n) = ax(n) + by(n-l) a, b are arbitrary constants, l is some arbitrary shift Recall that the energy of a signal is: E x(n) 2 finite or infinite value n = - if 0 < E < then x(n) is an energy signal E x is the energy of signal x(n) Computing the energy of c(n) in expansion form yields: E c(n) 2 = [ax(n) + by(n-l) ] 2 = n = - n = - a 2 x 2 (n) + n = - b 2 y 2 (n-l) + n = - 2ab x(n)y(n-l) n = - the first two terms are easily identified as: a 2 r xx (0) and b 2 r yy (0) from the definition (repeated below), with l = 0. r xx (l) = x(n)x(n-l) l = 0, ±1, ±2, n= - Thus r xx (0) = E x and r yy (0) = E y the energies of x(n) and y(n) respectively. ECE-S352-701 DSP 1 of 6 July 9, 2001

Now the complete expression: E c = a 2 r xx (0) + b 2 r yy (0) + 2abr xy (l) must be greater than or equal to zero. a 2 r xx (0) + b 2 r yy (0) + 2abr xy (l) 0 With the assumption that b 0 we may write: (a/b) 2 r xx (0) + r yy (0) + 2(a/b)r xy (l) 0 Now viewing this as a quadratic in the variable (a/b), in order for a nonnegative answer the discriminant must be non-positive which yields the following relationships: r xy (l) [r xx (0) r yy (0)] 1/2 = [E x E y ] 1/2 This places an upper bound on cross correlation in terms of the energy of the two signals for the case where y(n) = x(n) r xx (l) r xx (0) = E x we see that the value l=0 corresponds to the maximum value of the autocorrelation function (which makes perfect sense) Normalizing correlation Scaling does not change the shape of the autocorrelation or crosscorrelation sequences hence we may normalize them producing values in the closed interval [-1, 1] as follows: ρ xx (l) = r xx (l) / r xx (0) ρ xy (l) = r xy (l) / [r xx (0)r yy (0)] 1/2 normalized autocorrelation normalized crosscorrelation Convolution Relationship r xy (l) = x(n) * y(-n) where n = l ECE-S352 DSP 2 of 6

Fold and symmetry relationship r xy (l) = r yx (-l) previously shown For the case of autocorrelation: r xx (l) = r xx (-l) which shows that autocorrelation is an even function and we only need to compute r xx (l) for l>=0 Periodic sequences If x(n) and y(n) are two power signals each with period N, the averages over the infinite interval are the same as over a single period and one may write: N-1 r xy (l) =1/N x(n)y(n-l) think of 1/N as a normalization factor N-1 r xx (l) =1/N x(n)x(n-l) Here the correlation sequences are also periodic with period N. One of the main uses of cross correlation is to identify periodicities in an observer signal generally corrupted by noise. where y(n) = x(n) + w(n) y(n) is the observed signal x(n) is the actual signal and has unknown period N w(n) is a random additive noise or interference. We observe M samples of y(n) with the constraints M>>N 0<=n<= ECE-S352 DSP 3 of 6

The autocorrelation of y(n) is: r yy (l) = 1/M y(n)y(n-l) r yy (l) = 1/M [x(n)+w(n)][x(n-l)+w(n-l)] = 1/M [x(n)x(n-l)] + ECE-S352 DSP 4 of 6 1/M [x(n)w(n-l) + w(n)x(n-l)] + 1/M [w(n)w(n-l)] Or more compactly: r yy (l) = r xx (l) + r xw (l) + r wx (l) + r ww (l) The cross correlations between the signal x(n) and the interference w(n) are expected to be small since x(n) and w(n) should be unrelated. The autocorrelation of the noise w(n) will have a peak at zero but should rapidly decay to zero. Hence we are left with r yy (l) looking like the autocorrelation of x(n) which should show peaks at 0, N, 2N etc. The caveats here are: (1) that the peak at zero for r yy (l) will be larger due to the autocorrelation of w(n); and (2)since we are using a finite amount of data (M) the values of the peaks will reduce as we move further from 0 due to the inclusion of zeros in the product terms. However we should clearly be able to determine the unknown period N. Look at example 2.6.3 in the text for a good example with different SNR.

Input-Output Correlation Sequences x(n) h(n) y(n) For the above system r xx (l) is known as well as the impulse response h(n) and the corresponding output y(n). r yx (l) is given as: y(n) = h(n)*x(n) = x(n)* h(n) r yx (l) = y(l)*x(-l) from conv/corr definition r yx (l) = [h(l)*x(l)]*x(-l) = h(l)*[x(l)*x(-l)] r yx (l) =h(l) * r xx (l) The cross correlation between the input and output is the convolution of the impulse response with the autocorrelation of the input sequence! (Note this approach is used in network and modal analyzers to find transfer functions!!!) Alternatively r xx (l) h(n) we may think of the cross correlation to be the output of a LTI system when the input is the autocorrelation of x(n). Now let use consider the ac of the output: r yy (l) = y(l) * y(-l) r yy (l) = [h(l)*x(l)] * [h(-l)*x(-l)] r yy (l) = [h(l)*h(-l)] * [x(l)*x(-l)] r yy (l) = r hh (l) * r xx (l) ECE-S352 DSP 5 of 6 r yx (l)

r hh (l) exists if the system is stable, and this means that the type of signal which the input signal is (power or energy) does not change in the output. Finally r yy (0) = r hh (k)r xx (k) n = - which is the energy or power of the output signal in terms of autocorrelations. ECE-S352 DSP 6 of 6