Module 2: Modeling Discrete Time Systems by Pulse Transfer - nptel

Loading...

Digital Control

Module 2

Lecture 1

Module 2: Modeling Discrete Time Systems by Pulse Transfer Function Lecture Note 1

1

Motivation for using Z-transform

In general, control system design methods can be classified as: conventional or classical control techniques modern control techniques Classical methods use transform techniques and are based on transfer function models, whereas modern techniques are based on modeling of system by state variable methods. Laplace transform is the basic tool of the classical methods in continuous domain. In principle, it can also be used for modeling digital control systems. However typical Laplace transform expressions of systems with digital or sampled signals contain exponential terms in the form of eT s which makes the manipulation in the Laplace domain difficult. This can be regarded as a motivation of using Z-transform. Let the output of an ideal sampler be denoted by f ∗ (t). L[f ∗ (t)] = F ∗ (s) ∞ X = f (kT )e−kT s k=0

Since F ∗ (s) contains the term e−kT s , it is not a rational function of s. When terms with e−T s appear in a transfer function other than a multiplying factor, difficulties arise while taking the inverse Laplace. It is desirable to transfer the irrational function F ∗ (s) to a rational function for which one obvious choice is: z = eT s 1 ⇒ s = ln z T If, s = σ + jw, Re z = eT σ cos wT Im z = eT σ sin wT I. Kar

1

Digital Control

Module 2

Lecture 1

Z-transform: F





1 s = ln z T



= F (z) ∞ X

=

f (kT )z −k

k=0

F (z) is the Z-transform of f (t) at the sampling instants k. F (z) =

∞ X

f (kT )z −k

k=0

In general, we can say that if f (t) is Laplace transformable then it also has a Z-transform. Z

L[f (t)] =



f (t)e−st dt 0

∞ X

Z[f (t)] =

f (kT )z −k

k=0

2

Revisiting Z-Transforms

Z-transform is a powerful operation method to deal with discrete time systems. In considering Z-transform of a time function x(t), we consider only the sampled values of x(t), i.e., x(0), x(T ), x(2T )....... where T is the sampling period. X(z) = Z[x(t)] = Z[x(kT )] ∞ X = x(kT )z −k k=0

For a sequence of numbers x(k) X(z) = Z[x(k)] ∞ X = x(k)z −k k=0

The above transforms are referred to as one sided z-transform. In one sided z-transform, we assume that x(t) = 0 for t < 0 or x(k) = 0 for k < 0. In two sided z-transform, we assume that −∞ < t < ∞ or k =, ±1, ±2, ±3, ........ X(z) = Z[x(kT )] ∞ X = x(kT )z −k k=−∞

I. Kar

2

Digital Control

Module 2

Lecture 1

or for x(k) X(z) = Z[x(k)] ∞ X = x(k)z −k k=−∞

The one sided z-transform has a convenient closed form solution in its region of convergence (ROC) for most engineering applications. Whenever X(z), an infinite series in z −1 , converges outside the circle |z| = R, where R is the radius of absolute convergence, it is not needed each time to specify the values of z over which X(z) is convergent. |z| > R ⇒ convergent |z| < R ⇒ divergent. In one sided z-transform theory, while sampling a discontinuous function x(t), we assume that the function is continuous from the right, i.e., if discontinuity occurs at 0 we assume that x(0) = x(0+).

2.1

Z-Transforms of some elementary functions

Unit step function is defined as: us (t) = 1, for t ≥ 0 = 0, for t < 0 Assuming that the function is continuous from right X(z) =

∞ X

us (kT )z −k

k=0

=

∞ X

z −k

k=0

= 1 + z −1 + z −2 + z −3 + ......... 1 = 1 − z −1 z = z−1 The above series converges if |z| > 1. One should note that the Unit step sequence is defined as us (k) = 1, for k = 0, 1, 2 · · · = 0, for k < 0 with a same Z-transform.

I. Kar

3

Digital Control

Module 2

Lecture 1

Unit ramp function is defined as: ur (t) = t, for t ≥ 0 = 0, for t < 0 The Z-transform is: Tz (z − 1)2 z −1 = T (1 − z −1 )2

Ur (z) =

with ROC |z| > 1. For a polynomial function x(k) = ak , the Z-transform is: 1 1 − a.z −1 z = z−a

X(z) =

where ROC is |z| > a. Exponential function is defined as: x(t) = e−at , for t ≥ 0 = 0, for t < 0 We have x(kT ) = e−akT for k = 0, 1, 2 · · · . Thus, X(z) = =

1 1−

e−aT z −1

z z − e−aT

Similarly Z-transforms can be computed for sinusoidal and other compound functions. One should refer the Z-transform table provided in the appendix.

2.2

Properties of Z- transform

1. Multiplication by a constant: Z[ax(t)] = aX(z), where X(z) = Z[x(t)]. 2. Linearity: If x(k) = αf (k) ± βg(k), then X(z) = αF (z) ± βG(z). 3. Multiplication by ak : Z[ak x(k)] = X(a−1 z) 4. Real shifting: Z[x(t − nT )] = z −n X(z) and z[x(t + nT )] = z I. Kar

n

"

X(z) −

n−1 X k=0

x(kT )z

−k

# 4

Digital Control

Module 2

Lecture 1

5. Complex shifting: Z[e±at x(t)] = X(ze∓aT ) 6. Initial value theorem: x(0) = lim X(z) z→∞

7. Final value theorem: lim x(k) = lim [(1 − z −1 )X(z)] z→1

k→∞

2.3

Inverse Z-transforms

Single sided Laplace transform and its inverse make a unique pair,i.e. if F (s) is the Laplace transform of f (t), then f (t) is the inverse Laplace transform of F (s). But the same is not true for Z-transform. Say f (t) is the continuous time function whose Z-transform is F (z) then the inverse transform is not necessarily equal to f (t), rather it is equal to f (kT ) which is equal to f (t) only at the sampling instants. Once f (t) is sampled by an the ideal sampler, the information between the sampling instants is totally lost and we cannot recover actual f (t) from F (z), ⇒ f (kT ) = Z −1 [F (z)] The transform can be obtained by using → Partial fraction expansion → Power series → Inverse formula. Inverse Z-transform formula: 1 f (kT ) = 2πj

2.4

I

F (z)z k−1 dz Γ

Other Z-transform properties

Partial differentiation theorem:   ∂ ∂ [f (t, a)] = F (z, a) Z ∂a ∂a Real convolution theorem: If f1 (t) and f2 (t) have z-transforms F1 (z) and F2 (z) and f1 (t) = 0 = f2 (t) for t < 0, then # " k X f1 (nT )f2 (kT − nT ) F1 (z)F2 (z) = Z n=0

Complex convolution: 1 Z[f1 (t)f2 (t)] = 2πj

I

Γ

F1 (ξ)F2 (zξ −1 ) dξ ξ

Γ : circle / closed path in z-plane which lie in the region σ < |ξ| <

|z| σ2

σ1 : radius of convergence ofF1 (ξ) σ1 : radius of convergence of F2 (ξ) I. Kar

5

Digital Control

2.5

Module 2

Lecture 1

Limitation of Z-transform method

1. Ideal sampler assumption ⇒ z-transform represents the function only at sampling instants. 2. Non uniqueness of z-transform. 3. Accuracy depends on the magnitude of the sampling frequency ws relative to the highest frequency component contained in the function f (t). 4. A good approximation of f (t) can only be interpolated from f (kT ), the inverse z-transform of F (z) by connecting f (kT ) with a smooth curve.

2.6

Application of Z-transform in solving Difference Equation

One of the most important applications of Z-transform is in the solution of linear difference equations. Let us consider that a discrete time system is described by the following difference equation. y(k + 2) + 0.5y(k + 1) + 0.06y(k) = −(0.5)k+1 with the initial conditions y(0) = 0, y(1) = 0. We have to find the solution y(k) for k > 0. Taking z-transform on both sides of the above equation: z 2 Y (z) + 0.5zY (z) + 0.06Y (z) = −0.5

z z − 0.5

0.5z (z − + 0.5z + 0.06) 0.5z = − (z − 0.5)(z + 0.2)(z + 0.3)

or, Y (z) = −

0.5)(z 2

Using partial fraction expansion: 0.8937z 7.143z 6.25z + − z − 0.5 z + 0.2 z + 0.3 k Taking Inverse Laplace: y(k) = −0.893(0.5) + 7.143(−0.2)k − 6.25(−0.3)k Y (z) = −

To emphasize the fact that y(k) = 0 for k < 0, it is a common practice to write the solution as: y(k) = −0.893(0.5)k us (k) + 7.143(−0.2)k us (k) − 6.25(−0.3)k us (k) where us (k) is the unit step sequence.

I. Kar

6

Loading...

Module 2: Modeling Discrete Time Systems by Pulse Transfer - nptel

Digital Control Module 2 Lecture 1 Module 2: Modeling Discrete Time Systems by Pulse Transfer Function Lecture Note 1 1 Motivation for using Z-tr...

61KB Sizes 1 Downloads 0 Views

Recommend Documents

Module # 2 - nptel
Part 13 Baffles and support plates. Part 2 Types and nomenclature. Part 14 Floating heads. Part 3 Terminology. Part 15 C

Software Module - Pulse Mining Systems
Pulse Mining Systems offers the only ERP solution developed exclusively for the benefit of the Mining Industry. ... of a

Discrete Cosine Transforms - nptel
State the advantages of Discrete Cosine Transform (DCT) over Discrete. Fourier Transform (DFT). 2. ... DFT, application

Discrete Time Signal Processing - Circuits and Systems
14 Applications of the DFT and FFT. 298. 14.1 Block FIR ..... Advantages: • Robustness: - Signal levels can be regener

SIMULATION RELATIONS FOR DISCRETE-TIME LINEAR SYSTEMS
Abstract: Simulation relations of labeled transition systems are used in theoretical computer science in order to formal

EE265--Discrete-Time Signals and Systems
Lecture 3 [Complex Exponentials, Phasor Addition Theorem] - Updated Sept. 23/2013. Lectures 4-5 [Spectrum Representation

Module 3 Modeling and state-space formulation of nonlinear - nptel
writing down the state-space representation that is amenable for further analysis. In this module, models of pendulum-li

Module 8 - nptel
In the previous, i.e. fifth, lesson of this module, the direct-on-line (DOL) starter used in three-phase IM, along with

Module 11 - nptel
appreciate the staffing pattern of software projects, Norden's and Putnam's results must be understood. ... engineers (o

Module 1 Introduction - nptel
Table 1.1: Various elements of power system operation and control. Operation and control action. Time period. 1 Relaying

Популярные приложения за последние 24 часов | Watch movie | 3×03 ITA