Y(J)S DSP Slide 1 System identification We are given an unknown system - how can we figure out what it is ? What do we mean by "what it is" ? Need to be.

Slides:



Advertisements
Similar presentations
DCSP-14 Jianfeng Feng Department of Computer Science Warwick Univ., UK
Advertisements

Computer Vision Lecture 7: The Fourier Transform
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Response to a Sinusoidal Input Frequency Analysis of an RC Circuit.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: The Linear Prediction Model The Autocorrelation Method Levinson and Durbin.
Y(J)S DSP Slide 1 Outline 1. Signals 2. Sampling 3. Time and frequency domains 4. Systems 5. Filters 6. Convolution 7. MA, AR, ARMA filters 8. System identification.
Lecture 7: Basis Functions & Fourier Series
Characteristics of a Linear System 2.7. Topics Memory Invertibility Inverse of a System Causality Stability Time Invariance Linearity.
Special Factoring Forms Solving Polynomial Equations
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.
Cellular Communications
Ch 5.8: Bessel’s Equation Bessel Equation of order :
OPTIMUM FILTERING.
AMI 4622 Digital Signal Processing
Review of Frequency Domain
EE-2027 SaS 06-07, L11 1/12 Lecture 11: Fourier Transform Properties and Examples 3. Basis functions (3 lectures): Concept of basis function. Fourier series.
EECS 20 Chapter 10 Part 11 Fourier Transform In the last several chapters we Viewed periodic functions in terms of frequency components (Fourier series)
Basics of Digital Filters & Sub-band Coding Gilad Lerman Math 5467 (stealing slides from Gonzalez & Woods)
EE-2027 SaS, L15 1/15 Lecture 15: Continuous-Time Transfer Functions 6 Transfer Function of Continuous-Time Systems (3 lectures): Transfer function, frequency.
Lecture 8: Fourier Series and Fourier Transform
Signals, Fourier Series
Lecture 9: Fourier Transform Properties and Examples
CELLULAR COMMUNICATIONS DSP Intro. Signals: quantization and sampling.
Systems: Definition Filter
Leo Lam © Signals and Systems EE235. Leo Lam © Fourier Transform Q: What did the Fourier transform of the arbitrary signal say to.
Discrete-Time and System (A Review)
Chapter 2: Discrete time signals and systems
Signal Processing First CH 8 IIR Filters The General IIR Difference Equation 2 feedback term recursive filter FIR part No. of coeff. = N+M+1.
Linear Shift-Invariant Systems. Linear If x(t) and y(t) are two input signals to a system, the system is linear if H[a*x(t) + b*y(t)] = aH[x(t)] + bH[y(t)]
1 CS 551/651: Structure of Spoken Language Lecture 8: Mathematical Descriptions of the Speech Signal John-Paul Hosom Fall 2008.
FOURIER SERIES §Jean-Baptiste Fourier (France, ) proved that almost any period function can be represented as the sum of sinusoids with integrally.
Speech Coding Using LPC. What is Speech Coding  Speech coding is the procedure of transforming speech signal into more compact form for Transmission.
CISE315 SaS, L171/16 Lecture 8: Basis Functions & Fourier Series 3. Basis functions: Concept of basis function. Fourier series representation of time functions.
(Lecture #08)1 Digital Signal Processing Lecture# 8 Chapter 5.
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: First-Order Second-Order N th -Order Computation of the Output Signal Transfer.
Professor Walter W. Olson Department of Mechanical, Industrial and Manufacturing Engineering University of Toledo System Solutions Dc1c1 c2c2 c n-1 cncn.
Speech Signal Representations I Seminar Speech Recognition 2002 F.R. Verhage.
Fourier Analysis of Discrete-Time Systems
October 29, 2013Computer Vision Lecture 13: Fourier Transform II 1 The Fourier Transform In the previous lecture, we discussed the Hough transform. There.
Chapter 2. Signals and Linear Systems
Technological Educational Institute Of Crete Department Of Applied Informatics and Multimedia Neural Networks Laboratory Slide 1 FOURIER TRANSFORMATION.
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Stability Response to a Sinusoid Filtering White Noise Autocorrelation Power.
 Circuits in which the source voltage or current is time-varying (particularly interested in sinusoidally time-varying excitation, or simply, excitation.
Discrete-time Random Signals
Technological Educational Institute Of Crete Department Of Applied Informatics and Multimedia Neural Networks Laboratory Slide 1 DISCRETE SIGNALS AND SYSTEMS.
2/17/2007DSP Course-IUST-Spring Semester 1 Digital Signal Processing Electrical Engineering Department Iran University of Science & Tech.
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Frequency Response Response of a Sinusoid DT MA Filter Filter Design DT WMA Filter.
Chapter 6 Discrete-Time System. 2/90  Operation of discrete time system 1. Discrete time system where and are multiplier D is delay element Fig. 6-1.
1 Roadmap SignalSystem Input Signal Output Signal characteristics Given input and system information, solve for the response Solving differential equation.
EENG 420 Digital Signal Processing Lecture 2.
Lecture 7: Basis Functions & Fourier Series
LECTURE 30: SYSTEM ANALYSIS USING THE TRANSFER FUNCTION
Digital Signal Processing
Linear Prediction Simple first- and second-order systems
Lecture 12 Linearity & Time-Invariance Convolution
Linear Prediction.
Outline Linear Shift-invariant system Linear filters
CT-321 Digital Signal Processing
State Space Analysis and Controller Design
Lect5 A framework for digital filter design
UNIT V Linear Time Invariant Discrete-Time Systems
UNIT-I SIGNALS & SYSTEMS.
CS3291: "Interrogation Surprise" on Section /10/04
2 Linear Time-Invariant Systems --Analysis of Signals and Systems in time-domain An arbitrary signal can be represented as the supposition of scaled.
Chapter 6 Discrete-Time System
Fourier Series September 18, 2000 EE 64, Section 1 ©Michael R. Gustafson II Pratt School of Engineering.
Digital and Non-Linear Control
LECTURE 18: FOURIER ANALYSIS OF CT SYSTEMS
System Properties Especially: Linear Time Invariant Systems
LECTURE 05: CONVOLUTION OF DISCRETE-TIME SIGNALS
16. Mean Square Estimation
Presentation transcript:

Y(J)S DSP Slide 1 System identification We are given an unknown system - how can we figure out what it is ? What do we mean by "what it is" ? Need to be able to predict output for any input For example, if we know L, all a l, M, all b m or H(  ) for all  Easy system identification problem We can input any x we want and observe y Difficult system identification problem The system is "hooked up" - we can only observe x and y x y unknown system unknown system

Y(J)S DSP Slide 2 Filter identification Is the system identification problem always solvable ? Not if the system characteristics can change over time Since you can't predict what it will do next So only solvable if system is time invariant Not if system can have a hidden trigger signal So only solvable if system is linear Since for linear systems small changes in input lead to bounded changes in output So only solvable if system is a filter !

Y(J)S DSP Slide 3 Easy problem Impulse Response (IR) To solve the easy problem we need to decide which x signal to use One common choice is the unit impulse a signal which is zero everywhere except at a particular time (time zero) The response of the filter to an impulse at time zero (UI) is called the impulse response IR (surprising name !) Since a filter is time invariant, we know the response for impulses at any time (SUI) Since a filter is linear, we know the response for the weighted sum of shifted impulses But all signals can be expressed as weighted sum of SUIs SUIs are a basis that induces the time representation So knowing the IR is sufficient to predict the output of a filter for any input signal x 0 0

Y(J)S DSP Slide 4 Easy problem Frequency Response (FR) To solve the easy problem we need to decide which x signal to use One common choice is the sinusoid x n = sin (  n ) Since filters do not create new frequencies (sinusoids are eigensignals of filters) the response of the filter to a a sinusoid of frequency  is a sinusoid of frequency  (or zero) y n = A  sin (  n +    ) So we input all possible sinusoids but remember only the frequency response FR the gain A  the phase shift   But all signals can be expressed as weighted sum of sinsuoids Fourier basis induces the frequency representation So knowing the FR is sufficient to predict the output of a filter for any input x  AA 

Y(J)S DSP Slide 5 Hard problem Wiener-Hopf equations Assume that the unknown system is an MA with 3 coefficients Then we can write three equations for three unknown coefficients (note - we need to observe 5 x and 3 y ) in matrix form The matrix has Toeplitz form which means it can be readily inverted Note - WH equations are never written this way instead use correlations

Y(J)S DSP Slide 6 Hard problem Yule-Walker equations Assume that the unknown system is an IIR with 3 coefficients Then we can write three equations for three unknown coefficients (note - need to observe 3 x and 5 y) in matrix form The matrix also has Toeplitz form This is the basis of Levinson-Durbin equations for LPC modeling Note - YW equations are never written this way instead use correlations