6.435 Lecture 1 v - MIT OpenCourseWare Identification 6.435 SET 4 –Input Design –Persistence of...

23
System Identification 6.435 SET 4 –Input Design –Persistence of Excitation –Pseudo-random Sequences Munther A. Dahleh Lecture 4 6.435, System Identification Prof. Munther A. Dahleh 1

Transcript of 6.435 Lecture 1 v - MIT OpenCourseWare Identification 6.435 SET 4 –Input Design –Persistence of...

System Identification

6.435

SET 4 –Input Design

–Persistence of Excitation

–Pseudo-random Sequences

Munther A. Dahleh

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

1

Input Signals

• Commonly used signals

– Step function

– Pseudorandom binary sequence (PRBS)

– Autoregressive, moving average process

– Periodic signals: sum of sinusoids

• Notion of “sufficient excitation”. Conditions !

• Degeneracy of input design.

• Relations between PBRS & white noise.

• Frequency domain properties of such signals.

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

2

Examples

• Step input

• A Pseudorandom binary sequence

– periodic signal

– switches between two levels in a certain fashion – levels = ± a period = M

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

3

• Autoregressive moving average

is a random sequence

{ARMA process}

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

4

Spectral Properties

• PRBS

[takes on 0,1]

all calculations are mod 2.

are either 0 or 1

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

5

• Covariance function

and evaluating ,

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

6

• ARMA

• Sum of sinusoids

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

7

PRBS vs. WN

• Given any smooth function

• Approximate the integral by Riemann sum.

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

8

• The spectrum of PRBS approximate WN as distributions.

• Homework:

= WN = PRBS

Compare

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

9

Persistent Excitation

Definition:

A quasi-stationary input, u, is persistently exciting of order n

if the matrix

is positive definite.

• Recall: The correlation method in the time-domain required

the inversion of to estimate M-parameters of the

impulse response.

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

10

Relation to the Spectrum

Theorem:

Let u be a quasi-stationary input of dimension nu, with

spectrum . Assume that for at least n

distinct frequencies. Then u is p.e. of order n.

Proof:

Let be a n xnu row vector such

nu nu

. Define that

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

11

Then,

But at n distinct

frequencies at these frequencies = g = 0.

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

12

Theorem (Scalar):

If u is p.e of order n for at least n-points.

Proof: Suppose for at most points.

Let g be any vector with

Pick a vector

at the points where

at some other frequency.

then

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

13

Examples

• Step input: persistently exciting of order 1

• PRBS:

(Verify!)

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

14

singular 1st and last row are the same.

PRBS is p.e. of order M.

• ARMA Process is p.e. of any order.

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

15

• Sum of sinusoids

is non-zero at exactly n-points, where

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

16

Theorem:

is quasi-stationary. Define

Then

is persistently exciting of order n.

Proof: Define

equivalence established.

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

17

O

Spectrum of Filtered Signals

Generation of a process with a given Covariance:

given then x is the output of a filter with a WN If signal signal as an input. The Filter is the spectral factor of

stable minimum phase.

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

18

SOSI

SOSI

Important relations

A model for noisy outputs:

quasi-stationary constant.

• Very Important relations in system ID. • Correlation methods are central in identifying an unknown plant. • Proofs: Messy; Straight forward.

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

19

Ergodicity

• is a stochastic process

Sample function or a realization

• Sample mean

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

20

• Sample Covariance

• A process is 2nd-order ergodic if

mean the sample mean of any realization.

covariance the sample covariance of any realization.

• Sample averages Ensemble averages

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

21

A general ergodic process

+

WN Signal

quasi–stationary signal uniformly stable

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

22

w.p.1

w.p.1

w.p.1

Remark:

Most of our computations will depend on a given realization of a quasi-stationary process. Ergodicity will allow us to make statements about repeated experiments.

Lecture 4 6.435, System Identification Prof. Munther A. Dahleh

23