Procesamiento Digital de Señales

Rodolfo Gordillo

ESPE

Dec 1st, 2020

Rodolfo Gordillo (ESPE) 202051 Dec 1st, 2020 1 / 12

Outline

1 Digital Signal Processing

2 Time Discrete Systems

Rodolfo Gordillo (ESPE) 202051 Dec 1st, 2020 2 / 12

Outline

1 Digital Signal Processing

2 Time Discrete Systems

Rodolfo Gordillo (ESPE) 202051 Dec 1st, 2020 3 / 12

Why is it that most filters are now implemented using
digital systems?

In analog circuits, noise is a serious problem in all signal

transmissions. In contrast, the digital signals refer to a range of
values and hence it is possible to provide good noise margins.
For example, in transistor transistor logic (TTL), there is a noise
margin of 0.4 V in both high and low levels. The basic ability of
digital systems to reject noise in a fundamental way has resulted
in these systems becoming extremely popular.
It is easy to implement and modify digital controllers – we just
have to change the coefficients!
We can achieve the desired accuracy by using a sufficient number
of bits. It is possible to implement error checking protocols in
digital systems.

Rodolfo Gordillo (ESPE) 202051 Dec 1st, 2020 4 / 12

Another facts

Because of the advances in the manufacturing processes of digital

circuits, the components can be produced in large volumes. Large
digital circuits can be fully integrated through VLSI.
Through a multiplexer, a single processor can handle a large
number of digital signals. Digital circuits pose no loading
problems, unlike analog circuits.
Because of these reasons, digital devices became popular, which
formed an important impetus for the advancement of digital
systems. Digital devices have become rugged, compact, flexible
and inexpensive.

Rodolfo Gordillo (ESPE) 202051 Dec 1st, 2020 5 / 12

Advantages of Digital Processing over Analog
Processing

For some naturally occurring discrete time process, a continuous time

version may not even exist. For example, consider a scalar state space
equation,
ẋ = f x(t) + gu(t) (1)
where f and g are constants. Under uniform sampling, the ZOH
equivalent of this plant is

x(k + 1) = ax(k) + bu(k) (2)

where a = ef T and T is the sampling time. Note that a > 0. Thus, if a

turns out to be negative in an identification exercise applied to plan
data, no continuous control design technique may be suitable.

Rodolfo Gordillo (ESPE) 202051 Dec 1st, 2020 6 / 12

Outline

1 Digital Signal Processing

2 Time Discrete Systems

Rodolfo Gordillo (ESPE) 202051 Dec 1st, 2020 7 / 12

Z-Transform

In particular, the output at any instant is obtained as a convolution

sum involving an infinite number of products of impulse response and
input. If the output has to be evaluated at another time instant, the
convolution sum has to be recalculated.

Z-transforms are used to simplify the operations involving

difference equations. For example, the convolution of two discrete
time signals gets reduced to the product of two algebraic
expressions with the use of Z-transforms.

The Z-transform makes easy the task of analysis and design of

useful devices, such as filters and controllers.

Rodolfo Gordillo (ESPE) 202051 Dec 1st, 2020 8 / 12

Convolution

Consider the convolution sum

∞
X
y(n) = u(k)g(n − k) (3)
k=−∞

and let {u(n)} = {u(0), u(1), u(2)}, {g(n)} = {g(0), g(1), g(2)}. Let
these sequences be zero at all other times. We obtain the following y
values:
y(0) = u(0)g(0)
y(1) = u(0)g(1) + u(1)g(0)
y(2) = u(0)g(2) + u(1)g(1) + u(2)g(0)
y(3) = u(1)g(2) + u(2)g(1)
y(4) = u(2)g(2)

Rodolfo Gordillo (ESPE) 202051 Dec 1st, 2020 9 / 12

Result with the product of functions
The same result will be obtained from the coefficients of the resultant
series, if we define two functions U (z) and G(z)

U (z) = u(0) + u(1)z −1 + u(2)z −2

G(z) = g(0) + g(1)z −1 + g(2)z −2

and multiply them: Let V (z) denote the product of U and G:

V (z) = G(z)U (z) (4)

Substituting for G and U from above and multiplying out, V is

obtained as a fourth degree polynomial in z −1 , of the following form:

V (z) = y(0) + y(1)z −1 + y(2)z −2 + y(3)z −3 + y(4)z −4 (5)

where, y(i), i = 1 to 4, are identical to the ones obtained by Eq. 3.

Rodolfo Gordillo (ESPE) 202051 Dec 1st, 2020 10 / 12
Definition of Z-transform

The Z-transform of a sequence {u(n)} is denoted by U (z) and it is

calculated using the formula
∞
X
U (z) = u(n)z −n (6)
n=−∞
P∞ −n |
where z is chosen such that n=−∞ |u(n)z < ∞.

The main advantage in taking the Z-transform is that cumbersome

convolution calculations can be done easier. Moreover, issues such as
stability, causality and oscillatory behaviour of an infinite signal can
easily be established by analyzing the closed form expression involving
the Z-transform.

Rodolfo Gordillo (ESPE) 202051 Dec 1st, 2020 11 / 12

Bibliography

Rodolfo Gordillo (ESPE) 202051 Dec 1st, 2020 12 / 12