Ideal Amplifier/Attenuator. Memoryless. where k is some real constant. Integrator. System with memory

Similar documents
ECE-314 Fall 2012 Review Questions

Notes 03 largely plagiarized by %khc

Linear Time Invariant Systems

Manipulations involving the signal amplitude (dependent variable).

Chapter 2: Time-Domain Representations of Linear Time-Invariant Systems. Chih-Wei Liu

BEST LINEAR FORECASTS VS. BEST POSSIBLE FORECASTS

Fourier transform. Continuous-time Fourier transform (CTFT) ω ω

Section 8 Convolution and Deconvolution

6.003: Signals and Systems

The Eigen Function of Linear Systems

12 Getting Started With Fourier Analysis

Big O Notation for Time Complexity of Algorithms

Economics 8723 Macroeconomic Theory Problem Set 2 Professor Sanjay Chugh Spring 2017

Actuarial Society of India

1. Solve by the method of undetermined coefficients and by the method of variation of parameters. (4)

ODEs II, Supplement to Lectures 6 & 7: The Jordan Normal Form: Solving Autonomous, Homogeneous Linear Systems. April 2, 2003

Comparison between Fourier and Corrected Fourier Series Methods

Stochastic Processes Adopted From p Chapter 9 Probability, Random Variables and Stochastic Processes, 4th Edition A. Papoulis and S.

6.01: Introduction to EECS I Lecture 3 February 15, 2011

N! AND THE GAMMA FUNCTION

Lecture 9: Polynomial Approximations

Electrical Engineering Department Network Lab.

Extremal graph theory II: K t and K t,t

Lecture 15 First Properties of the Brownian Motion

Sampling Example. ( ) δ ( f 1) (1/2)cos(12πt), T 0 = 1

6/27/2012. Signals and Systems EE235. Chicken. Today s menu. Why did the chicken cross the Möbius Strip? To get to the other er um

EGR 544 Communication Theory

OLS bias for econometric models with errors-in-variables. The Lucas-critique Supplementary note to Lecture 17

F D D D D F. smoothed value of the data including Y t the most recent data.

Math 6710, Fall 2016 Final Exam Solutions

Pure Math 30: Explained!

LIMITS OF FUNCTIONS (I)

h[n] is the impulse response of the discrete-time system:

STK4080/9080 Survival and event history analysis

King Fahd University of Petroleum & Minerals Computer Engineering g Dept

Department of Mathematical and Statistical Sciences University of Alberta

10.3 Autocorrelation Function of Ergodic RP 10.4 Power Spectral Density of Ergodic RP 10.5 Normal RP (Gaussian RP)

ECE 308 Discrete-Time Signals and Systems

Dynamic h-index: the Hirsch index in function of time

Discrete-Time Signals and Systems. Introduction to Digital Signal Processing. Independent Variable. What is a Signal? What is a System?

David Randall. ( )e ikx. k = u x,t. u( x,t)e ikx dx L. x L /2. Recall that the proof of (1) and (2) involves use of the orthogonality condition.

UNIT 6 Signals and Systems

Online Supplement to Reactive Tabu Search in a Team-Learning Problem

λiv Av = 0 or ( λi Av ) = 0. In order for a vector v to be an eigenvector, it must be in the kernel of λi

2 f(x) dx = 1, 0. 2f(x 1) dx d) 1 4t t6 t. t 2 dt i)

The Central Limit Theorem

Solutions to selected problems from the midterm exam Math 222 Winter 2015

Review Exercises for Chapter 9

10/10/2011. Signals and Systems EE235. Today s menu. Chicken

Signal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.

Clock Skew and Signal Representation

6.003 Homework #5 Solutions

If boundary values are necessary, they are called mixed initial-boundary value problems. Again, the simplest prototypes of these IV problems are:

1 Notes on Little s Law (l = λw)

The analysis of the method on the one variable function s limit Ke Wu

6.003: Signals and Systems Lecture 20 April 22, 2010

K3 p K2 p Kp 0 p 2 p 3 p

6/10/2014. Definition. Time series Data. Time series Graph. Components of time series. Time series Seasonal. Time series Trend

4/9/2012. Signals and Systems KX5BQY EE235. Today s menu. System properties

FIXED FUZZY POINT THEOREMS IN FUZZY METRIC SPACE

Principles of Communications Lecture 1: Signals and Systems. Chih-Wei Liu 劉志尉 National Chiao Tung University

Calculus Limits. Limit of a function.. 1. One-Sided Limits...1. Infinite limits 2. Vertical Asymptotes...3. Calculating Limits Using the Limit Laws.

ECE 350 Matlab-Based Project #3

CLOSED FORM EVALUATION OF RESTRICTED SUMS CONTAINING SQUARES OF FIBONOMIAL COEFFICIENTS

L-functions and Class Numbers

DETERMINATION OF PARTICULAR SOLUTIONS OF NONHOMOGENEOUS LINEAR DIFFERENTIAL EQUATIONS BY DISCRETE DECONVOLUTION

Fresnel Dragging Explained

BE.430 Tutorial: Linear Operator Theory and Eigenfunction Expansion

A Two-Level Quantum Analysis of ERP Data for Mock-Interrogation Trials. Michael Schillaci Jennifer Vendemia Robert Buzan Eric Green

International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research)

MATH 507a ASSIGNMENT 4 SOLUTIONS FALL 2018 Prof. Alexander. g (x) dx = g(b) g(0) = g(b),

Lecture 8 April 18, 2018

Math 2414 Homework Set 7 Solutions 10 Points

SUMMATION OF INFINITE SERIES REVISITED

A TAUBERIAN THEOREM FOR THE WEIGHTED MEAN METHOD OF SUMMABILITY

Time Dependent Queuing

Discrete-Time System Properties. Discrete-Time System Properties. Terminology: Implication. Terminology: Equivalence. Reference: Section 2.

S n. = n. Sum of first n terms of an A. P is

TAKA KUSANO. laculty of Science Hrosh tlnlersty 1982) (n-l) + + Pn(t)x 0, (n-l) + + Pn(t)Y f(t,y), XR R are continuous functions.

Continuous Time. Time-Domain System Analysis. Impulse Response. Impulse Response. Impulse Response. Impulse Response. ( t) + b 0.

MODERN CONTROL SYSTEMS

EECS 723-Microwave Engineering

Solutions - Midterm Exam

11. Adaptive Control in the Presence of Bounded Disturbances Consider MIMO systems in the form,

ECE4270 Fundamentals of DSP. Lecture 2 Discrete-Time Signals and Systems & Difference Equations. Overview of Lecture 2. More Discrete-Time Systems

F.Y. Diploma : Sem. II [AE/CH/FG/ME/PT/PG] Applied Mathematics

An interesting result about subset sums. Nitu Kitchloo. Lior Pachter. November 27, Abstract

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 4 9/16/2013. Applications of the large deviation technique

Mean Square Convergent Finite Difference Scheme for Stochastic Parabolic PDEs

Introduction to the Mathematics of Lévy Processes

Continuous Time Linear Time Invariant (LTI) Systems. Dr. Ali Hussein Muqaibel. Introduction

Theoretical Physics Prof. Ruiz, UNC Asheville, doctorphys on YouTube Chapter R Notes. Convolution

INTEGER INTERVAL VALUE OF NEWTON DIVIDED DIFFERENCE AND FORWARD AND BACKWARD INTERPOLATION FORMULA

Math-303 Chapter 7 Linear systems of ODE November 16, Chapter 7. Systems of 1 st Order Linear Differential Equations.

Using Linnik's Identity to Approximate the Prime Counting Function with the Logarithmic Integral

SOLUTIONS TO ECE 3084

In this section we will study periodic signals in terms of their frequency f t is said to be periodic if (4.1)

Samuel Sindayigaya 1, Nyongesa L. Kennedy 2, Adu A.M. Wasike 3

B. Maddah INDE 504 Simulation 09/02/17

Chemical Engineering 374

Transcription:

Liear Time-Ivaria Sysems (LTI Sysems) Oulie Basic Sysem Properies Memoryless ad sysems wih memory (saic or dyamic) Causal ad o-causal sysems (Causaliy) Liear ad o-liear sysems (Lieariy) Sable ad o-sable sysems (Sabiliy) Time-Ivaria sysems (Time ivariace) Basic Sysem Properies Memoryless ad sysems wih memory (saic or dyamic) Causal ad o-causal sysems (Causaliy) Liear ad o-liear sysems (Lieariy) 4 Sable ad o-sable sysems (Sabiliy) 5 Time-Ivaria sysems (Time ivariace) Memoryless ad sysems wih memory (saic or dyamic): A sysem is called memoryless, if he oupu, y (, of a give sysem for each value of he idepede variable a a give ime depeds oly o he ipu value a ime A sysem has memory if he oupu a ime depeds i geeral o he pas values of he ipu x ( for some rage of he values of o A sysem wih memory reais or sores iformaio abou ipu values a imes oher ha he curre ipu value D-T sigal erms: The rasformaio does o deped o he previous samples of he sequece, i is memoryless D-T sysem Sysem ame Sysem Equaio Defiiio Descripio Ideal Amplifier/Aeuaor Iegraor y( k, y[ k where k is some real cosa y ( d Iegrae he values of he ipu sigal from all pas imes up o prese ime Memoryless Sysem wih memory

Coiuous ime sysems: a) y( 5si( cos( ): This sysem is memoryless 7 b) y( ) d For some geeral ipu fucio x (, his sysem is a sysem wih memory, because i depeds o all pas values of he ipu c) y( e d - cosider e Soluio: we use iegraio by pars, u du d dv e u v e v e vdu e e e y( e ( ) e ( So we have sysem wih memory Discree ime sysems : a y [ 5] This sysem i o memoryless, because he oupu value a depeds o he ipu values a 5 b y [ si( ) 5 - memoryless sysem Causal ad o-causal sysems: If he oupu of he sysem y ( a ay ime depeds oly o he ipu a prese ad/or previous imes, we say ha he sysem is causal, mahemaically his ca be represeed as y ( f (, ),) A ocausal sysem aicipaes he fuure values of he ipu sigal i some way All memoryless sysems are causal For real ime sysem where acually deoed ime causaliy is impora Causaliy is o a esseial cosrai i applicaios where is o ime, for example, image processig If we are doig processig o recorded daa, he also causaliy may o be required Coiuous ime sysems: a) Ideal Predicor: his sysem is give by he followig ipu-oupu relaioship y ( ), i is ocausal sysem, sice he value y ( of he oupu a ime depeds o he value x ( ) of he ipu a ime, so he oupu mus appear before he ipu sigal as show i figure -7 e d e e e

- y( - Figure -7: Ideal Predicor I geeral, y( k q), where q is a posiive real umber, is a ocausal sysem b) Ideal Time Delay : The Ideal Time Delay has he followig equaio y ( ) ad his sysem is causal Discree ime sysems : a) poi MA Filer: The poi MA Filer y [ ] ] ] is a causal sysem b) 9 poi MA Filer: The 9-poi MA Filer wih he followig defiiio: y[ 4] ] ] ] ] ] ] 4] 9 is a ocausal filer, sice he filer oupu a ime requires he fuure values x [ 4], ], ] ad x [ ] of he ipu c) The sysem defied by y [ k] is ocausal k d) y [ ] - is a causal, sice he oupu value a for he sysem described by y [ ] depeds o he previous values of e) y [ 5x [ ] - is a ocausal, sice he oupu value depeds o he ipu value Liear ad o-liear sysems (Lieariy): This is a impora propery of he sysem We will see laer ha if we have sysem which is liear ad ime ivaria he i has a very compac represeaio A operaor T is called liear if he followig relaioships hold: T Or T ( ax bx ( a Tx ( b Tx ( a y ( b y ( for C-T sigals [ ax bx [ a Tx [ b Tx [ a y [ b y [ for D-T sigals To explai hese relaioships, suppose ha T acs o wo ipu sigals x ( ) ad x ( ) o produce he followig sigals:

( T ( T y - The respose of he sysem o he ipu x ( ) ad ) y - The respose of he sysem o he ipu x ( ) Ad suppose ha a ad b are wo cosas To ge he lieariy propery, a liear sysem has he impora propery of superposiio: superposiio If a ipu cosiss of weighed sum of several sigals ( a b ), he oupu is also weighed sum of he resposes of he sysem o each of hose ipu sigals ( a y b y ( )) ( The superposiio propery cosiss of wo pars: Addiiviy: The respose o { } is { y( y( } Homogeeiy: The respose o a x ( ) is a y ( ), where a is ay real umber if we are cosiderig oly real sigals ad a is ay complex umber if we are cosiderig complex valued sigals This meas ha if a sysem is homogeeous, he he scaled ipu gives a scaled oupu (some scalig facors) From figure -8, we see ha we ca decompose complicaed sigal x ( io a sum of simpler sigals x ( ) ad x (, ad he rea each of hese sigals hrough he sysem x ( Liear Sysem y( T x ( x ( ) y Tx ( ) Liear Sysem ( a bx ( Liear Sysem y( ay( by ( Figure -8: Lieariy Sysem lieariy checks To deermie ha he sysem is liear, use he followig seps (see also he figure -8): Form he sum ay( by( cosiderig wo ipu-oupu relaioship y ( ) ad y ( ) Cosruc he respose, ax bx ( T (, of he ipu: a b Check for equaliy he respose of sep wih he respose of sep, if hese wo resposes are equal, he he sysem is liear 4

Coiuous ime sysems: a) y( 5 Soluio: From sep, we cosider wo ipus ad oupu sigals muliplied by scalars Sice y( 5, we have y( 5, y( 5 ad he sum weighed by wo cosas is: ay( by( 5a 5b From sep, we use he sum ax bx ( ) as a ipu o he sysem, where ( ax bx ( 5 ax ( bx ( 5ax ( 5bx ( T ( From sep, hese equaios are equal, ad he he sysem is liear b) y( Rx (, where R is a cosa Soluio: From sep, we have: ay( by( arx ( brx ( From sep, we cosider he rasformaio acig o ax Usig T T ax ( bx ( R ax ( bx ( 5 ( bx ( ) x y x x y xy y we obai he followig equaio ax ( bx ( R ax ( bx ( R a x ( a bx ( x ( ab x ( x ( b x ( From sep, he sysem is o liear d x c) y( d Soluio: d x d x ay ( by( a b d d ow d a b d x ( d x ( T a b a b d d d i his case, he sysem is liear, as he resul of he firs sep ad secod sep are equal Discree ime sysems: a) y [ 5] ax bx [ ax [ 5] bx [ 5] ay [ by [ T [ herefore y [ 5] is liear sysem

Dr Qadri Hamarsheh b) y [ u[ k], k ax bx [ ax [ u[ k] bx [ u[ k] ay [ by [ T [ liear sysem Sable ad o-sable sysems (Sabiliy): There are several defiiios for sabiliy Here we will cosider bouded ipu boded oupu (BIBO) sabiliy A sysem is said o be BIBO sable if every bouded ipu produces a bouded oupu We say ha a sigal x [ is bouded if we ca fid a cosa M such ha for all, x [ M, ad we say ha he oupu sigal y [ is also bouded if we ca fid a cosa K such ha y [ K a) The movig average sysem defied by y [ k] is sable as k y [ is sum of fiie umbers ad so i is bouded b) The accumulaor sysem defied by y [ k] is usable If we ake k u[, he ui sep he y [ ], y[], y[], y[, so y[ grows wihou boud c) y [ 7 ], assume ha, M for some fiie M for all I his case M implies ha y[ 7M, so he sysem is sable d) y [ ], assume ha, M for some fiie M for all I his case, sice we have y [ ], were he oupu direcly depeds o, i grows wihou boud as icreases, so he sysem is o sable Time-Ivaria sysems (Time ivariace): A sysem is said o be ime ivariace (TI) if he behavior ad he srucure of he sysem do o chage wih ime (TI sysem respods exacly he same way o maer whe he ipu sigal is applied) Thus a sysem is said o be ime ivaria if a ime shif (delay or advace) i he ipu sigal, x ( ), leads o ideical delay or advace i he oupu sigal Mahemaically If y[ T{ } he y[ ] T{ ]} for ay Time ivariace esig seps (see figure -9): Fid he shifed oupu y ] of he sysem [ Fid he oupu of he shifed ipu y [ T{ ]} Compare sep ad sep, if hey are equal, he he sysem is ime ivariace 6

Ipu sigal Track Shif o he lef or righ Track ] Respose o he shifed sigal Track y[ T{ ]} - y d [ y[ y [ Track Respose o he ipu sigal Track y[ Shifed oupu y[ y[ ] Track Figure -9: Time Ivariace Tesig seps Coiuous ime sysems: Deermie wheher or o he sysem is a ime-ivaria for? y( To solve his ask, we go hrough he seps described above for ime ivariace esig: Sep: he resul of he shifed oupu: y( ) ( ) ) Sep : he oupu of he shifed ipu: y ( T{ )} ) Sep : Comparig he wo oupus we see ha hey are o equal, so his sysem is ime varyig Discree ime sysems: Deermie wheher or o he sysems are ime-ivaria? a y [ 7 7] Soluio: Sep: he resul of he shifed oupu: y [ ] 7 7] Sep : he oupu of he shifed ipu: y T{ ]} 7 7] Sep : Comparig he wo oupus we see ha hey are equal, so his sysem is ime ivaria b y[ 7 Soluio: Sep: he resul of he shifed oupu: y[ ] 7( ) ] Sep : he oupu of he shifed ipu: y T{ ]} 7 ] Sep : Comparig he wo oupus we see ha hey are o equal, so his sysem is ime varyig 7

c Accumulaor sysem : y [ k] k Soluio: Sep: he resul of he shifed oupu is give by: y [ ] Sep : he oupu of he shifed ipu: y { k k] T ]}, le x ], he he correspodig oupu is [ [ x k y [ k] k] k Sep : Comparig he wo oupus: The wo expressios are equal To ge ha, le us chage he idex of summaio by i k i he secod sum he we see ha y[ i] y[ ] i So his sysem is ime ivaria A sysem ca be liear wihou beig ime ivaria ad i ca be ime ivaria wihou beig liear 8