c

CAREER POINT UNIVE

SUBMITTED BY-Varun kumar meenaUID-K12020B.TECH 3RD YEARBRANCH-MECHANICAL

SUBMITTED TO-MR. SOMESH CHATURVEDI

Ass. Prof. OF ELECTRICAL DEPTT

MAJOR ASSIGNMENT- Design & Discreatization of continuous time

state space equations

STATE SPACE REPRESENTATIONS OF DISCRETE-TIME SYS Nonuniqueness of State Space Representations

STATE SPACE REPRESENTATIONS OF DISCRETE-TIME SYS Nonuniqueness of State Space Representations

≡

SOLVING DISCRETE TIE STATE-SPACE EQUATIONSSolution of LTI Discrete-Tim State Equations

x(k) or any positive integer k may be obtined directly by recursion, as follows:

SOLVING DISCRETE TIE STATE-SPACE EQUATIONSState Transition MatrixIt is possible to write the solution of the homogeneous state equation

as

state transition matrix(fundamental matrix) :

SOLVING DISCRETE TIE STATE-SPACE EQUATIONSState Transition Matrix

SOLVING DISCRETE TIE STATE-SPACE EQUATIONSz Transform Approach to the Solution of Discrete-Time State Equations

SOLVING DISCRETE TIE STATE-SPACE EQUATIONSz Transform Approach to the Solution of Discrete-Time State EquationsExample:

a) b)

Coding • P1=[8 56 96];• Q1=[1 4 9 10];• Sys=tf(P1,Q1)• Roots(P1);• Roots(Q1);• pzMAP(sys);

Figure

Coding.2• Num=[49];• Den=[ 1 4 9 ];• Sys=tf(num,den);• load ltiexamples• ltiview

Graph

Coding • Num=[49 89 96];• Den=[1 4 9];• Sys=tf[Num,Den];• Load ltiexamples• ltiview

Graph