Discrete Time Systems - Representations Lecture 4 Systems and - - PowerPoint PPT Presentation

discrete time systems representations
SMART_READER_LITE
LIVE PREVIEW

Discrete Time Systems - Representations Lecture 4 Systems and - - PowerPoint PPT Presentation

STADIUS - Center for Dynamical Systems, Signal Processing and Data Analytics Discrete Time Systems - Representations Lecture 4 Systems and Control Theory STADIUS - Center for Dynamical Systems, Signal Processing and Data Analytics


slide-1
SLIDE 1

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Discrete Time Systems - Representations

Lecture 4

slide-2
SLIDE 2

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Discrete Time Systems

2

  • For each time step the

system has:

  • A vector of inputs
  • A vector of outputs
  • A vector of states
slide-3
SLIDE 3

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

How to represent a system?

  • A system can be represented in multiple ways
  • Block-diagram
  • State space representation
  • Difference/differential equations
  • Impulse response
  • Transfer functions
  • In this lecture we will take a look at the different representations

3

slide-4
SLIDE 4

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Block-diagram

4

  • A block diagram is a visual representation of a system. All LTI’s

(Linear Time Invariant) systems can be constructed using these 3 building blocks. Note that every memory element corresponds to

  • ne state variable.
slide-5
SLIDE 5

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Example: compound interest

  • :deposits and withdrawals from of cash from bank account
  • :current saldo on bank account (before deposit and interest)
  • :The acquired interest that year
  • :the saldo on the next year = current saldo + interest + deposits

5

slide-6
SLIDE 6

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Example: compound interest

6

50 50

slide-7
SLIDE 7

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Example: compound interest

  • Simulate the block diagram

7

53 50 2,5

slide-8
SLIDE 8

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Example: compound interest

  • Simulate the block diagram

8

  • 25

30 52 2,6

slide-9
SLIDE 9

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Example: compound interest

  • Simulate the block diagram

9

32 30 1,5

slide-10
SLIDE 10

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Example: compound interest

  • Simulate the block diagram

10

33 32 1,6

slide-11
SLIDE 11

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Example: compound interest

  • Simulate the block diagram

11

30 65 33 1,7

slide-12
SLIDE 12

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Example: compound interest

  • Simulate the block diagram

12

68 65 3,2

slide-13
SLIDE 13

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Example: compound interest

  • Simulate the block diagram

13

72 68 3,4

slide-14
SLIDE 14

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Bad block diagrams

  • Delay-free loops
  • Connecting two outputs without using a

sum

14

Never use a block diagram that has one of these issues!!

S1 S2

slide-15
SLIDE 15

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Bad block diagrams

  • Delay-free loop:
  • The issue is that this leads to an implicit

connection

  • depends on ,which is not yet

known

  • You can easily rewrite this in an allowd

shape

15

slide-16
SLIDE 16

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Bad block diagrams

  • Connecting two outputs
  • The issue is that this can lead to

inconsistencies

  • According to this block diagram the
  • utput of the systems S1 and S2 are

equal

  • There is no way to get around this

16

S1 S2

slide-17
SLIDE 17

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

State space representation

  • This state space representation is again specific to LTI systems:
  • Linear: it’s easy to see these systems are linear (see lecture about

classification of dynamical systems)

  • Time-invariant: the matrices A,B,C,D do not depend on time, if it

were to be a time-variant system the matrices would be replaced by A[k], B[k], C[k] and D[k]

17

  • Discrete time
slide-18
SLIDE 18

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

From block diagram to state space

  • Block diagram
  • State space representation
  • In general
  • Let the inputs of the memory element

be and the outputs .

  • Trace back to retrieve equations for

and

  • This results in:

18

slide-19
SLIDE 19

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

From state space to block diagram (DT)

  • First Add a delay element for every state

x[k]

19

slide-20
SLIDE 20

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

From state space to block diagram (DT)

  • Add a delay element for every state x[k]
  • Determine the input for every state x[k+1]

from the matrixes A and B, as a combination of the states x[k] and inputs u[k]

20 24

slide-21
SLIDE 21

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

From state space to block diagram (DT)

  • Add a delay element for every state x[k]
  • Determine the input for every state x[k+1]

from the matrixes A and B, as a combination of the states x[k] and inputs u[k]

  • Determine the outputs y[k] in the same

way with the matrixes C and D

21 21

u[k] y[k]

slide-22
SLIDE 22

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Different state space representations

  • State space representation is not unique:
  • Take the following system, which connects u[k] to y[k]:
  • Now take a non-singular square matrix T and the following system. The relation between u[k]

and y[k] will be the same.

  • With

and , we have found a different state space representation for this system.

  • The same holds for continuous time.

22

slide-23
SLIDE 23

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Different state space representations

  • Input-output behavior is maintained
  • Internal behavior can be very different
  • If A has an Eigenvalue decomposition PDP-1 and T = P-1 then the resulting state space model

will be greatly simplified

  • If no Eigenvalue decomposition exists for A then a Jordan form may be used.

23

slide-24
SLIDE 24

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Difference equations

  • Similar to differential equations, but for discrete time
  • General form:
  • n is the order of the system
  • k is usually taken to be larger than zero
  • Each value y[k+i] represents the output of the system at a moment k+i
  • Each value u[k+i] represents an external input delivered to the system
  • Solution in 2 parts:
  • homogenous: solution from input zero
  • particular: solution derived as a response from the input

24

slide-25
SLIDE 25

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Homogenous difference equations

  • General form:
  • Expected form of solution:
  • Substitution of the expected solution in the difference equation:
  • Division by rk leads to the characteristic equation:
  • Solutions of the characteristic equation:
  • Homogenous solution to the difference equation:

25

slide-26
SLIDE 26

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Example: Fibonacci sequence

26

slide-27
SLIDE 27

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Example: Fibonacci sequence

  • Homogenous difference equation and starting conditions:

; ,

  • Characteristic equation:
  • Roots:
  • General solution:
  • Filling in starting conditions:
  • With solutions:

27

slide-28
SLIDE 28

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Complex roots to the characteristic equation

  • Complex and/or negative roots will result in oscillating behavior.
  • If the difference equations and starting conditions are both real the complex roots can only

be present in conjugate pairs.

  • This can be converted into a cosine using Euler’s formula:

28

slide-29
SLIDE 29

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Non-homogeneous difference equations

  • General form:
  • A linear combination of inputs results in the same linear combination of the outputs

resulting from each input individually.

  • The equation can thus be solved for each input individually and the results added together

afterwards.

  • The resulting particular solutions can then be added to the general form of the homogenous

solution.

29

slide-30
SLIDE 30

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Particular solutions to difference equations

30

slide-31
SLIDE 31

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Example

  • Given:
  • We start by solving the homogenous equation:
  • We will now fill in the suggested solution:

31

slide-32
SLIDE 32

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Example

  • The complete solution has the form:
  • Filling in the starting conditions gives us:

32

slide-33
SLIDE 33

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Impulse responses (Discrete time)

  • What is an impulse?
  • You can decompose any signal in a sum of impulse responses

33

slide-34
SLIDE 34

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Convolution theorem (DT)

  • The convolution theorem states:
  • Proof:
  • Conclusion
  • The impulse of a system does describe the input/output behavior

completely.

34

Definition of impulse response Time-invariance Superposition Sums are convolutions

slide-35
SLIDE 35

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Examples of Dirac-delta’s

  • Popping balloons for acoustic measurements

35

slide-36
SLIDE 36

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Example: Leontief model of a planned economy

  • Won the nobel prize in 1973
  • A simple model that assigns values to

different sectors

  • For simplicity we choose a planned
  • economy. But today governments all over

the world are using similar models to model their economy.

36

slide-37
SLIDE 37

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Example: Leontief model of a planned economy

  • Leontief divided the economy in sectors

who buy from eachother.

  • To produce one unit of industry 0.40 units
  • f agriculture are required

37

SALES Agricultu re Industry Services PU R C H AS E Agricultur e 0.40 0.03 0.03 Industry 0.06 0.40 0.10 Services 0.12 0.16 0.20

slide-38
SLIDE 38

Systems and Control Theory

STADIUS - Center for Dynamical Systems, Signal

Processing and Data Analytics

Example: Leontief model of a planned economy

  • Notation
  • :production of sector i in month k
  • :the demand to goods from sector i in the next month
  • Note: in planned economy demand can be steered, economists can decide how many

rations they give.

  • The model
  • It is anti-causal: a subdivision of non-causal, for which only future values have to be

known to know the current value

  • http://www.unc.edu/~marzuola/Math547_S13/Math547_S13_Projects/M_Kim_Section001_

Leontief_IO_Model.pdf

38