Code No.

A5405
NR
JAWAHARLAL NEHRU TECHNOLOGY UNIVERSITY, HYDERABAD
M.Tech. I Semester Regular Examinations, March – 2009
DIGITAL CONTROL SYSTEMS
(Control Systems)
Time: 3 hours Max. Marks.60
Answer any Five questions
All questions carry equal marks
---
1.a) State and explain sampling theorem?
b) Obtain the z-transform of
i) f ( k ) = gk ( 2 K −1 ) − 2k + 3 , where K ≥ 0
ii) A unit step function delayed by 4 sampling periods.
z −2
c) Find the inverse z-transform of X ( z ) =
(1 − z −1 )
3

2.a) Decompose the following transfer function by direct decomposition and draw
the state diagram. Also, write down the discrete state equations in vector-
matrix form.
b) Given the state equation X ( K + 1) = A × ( K )
⎡0 1 0⎤
⎢
find the state transition matrix φ (K) if A = ⎢0 0 1 ⎥⎥
⎢⎣0 −0.5 1.5⎥⎦

3.a) Explain the stability of the characteristic equation given by:

i) P(z) = z3 – 1.2z2 – 0.1z + 0.2 = 0 and
ii) P(z) = z3 – 0.2z2 – 0.25z + 0.05 = 0
b) Explain the Liapunor stability analysis of linear time-invariant continuous time
system and Linear time invariant discrete time system.

4. Sketch the root locus diagram of a digital system indicating all the component
0.15 K ( z + 0.7453)
information on the root loci., given with G ( z ) = if T = 0.1 sec
( z − 1)( z − 0.4119 )
and 0.5 sec.

5.a) A discrete data control system is described by the state equation

⎡0 0 0 ⎤ ⎡1 ⎤
X ( K + 1) = A × ( K ) + Bu ( K ) where A =≤ ⎢0 0.5 0 ⎥ and B = ⎢⎢0⎥⎥ , determine the state
⎢ ⎥
⎢⎣0 0 2 ⎥⎦ ⎢⎣1 ⎥⎦
controllability of the system.
b) Investigate the controllability and observability of the following system:
⎡ −1 1 ⎤ ⎡0 ⎤
X ( K + 1) = ⎢ ⎥ X (K ) + ⎢ ⎥u(K )
⎣ 0 −1⎦ ⎣1 ⎦
y ( K ) = [1 1] × ( K )
Contd…2
Code No. A5401 ::2::

6. What is dead beat response? Explain the design of digital control systems with
dead beat response?

7. Consider the system: x ( k + 1) = Gx ( k ) + Hu ( k )

y (k ) = C ×(k )
⎡ 0 −0.16 ⎤ ⎡0⎤
Where G = ⎢ ⎥ ; H = ⎢ ⎥ ; C = [ 0 1]
⎣1 −1 ⎦ ⎣1 ⎦
Design a full order observer.

8. Find the optimal control µ 0 ( k ) , K = 0, 1, 2, …10, such that the performance

1 10 2
index J = ∑ ⎡ x ( K ) + 2u 2 ( K )⎤⎦ is minimized, subject to the equality constraint
2 K =0 ⎣
x ( k + 1) = x ( k ) + 2u ( k ) . The initial state is x(0)=1 and the final state is x(11)=0.

*****