# The Zeta transform: definition, theorems, examples

## Definition of Z transform and first examples

The Z transform of a sequence f(n) with n=0,1,2.. is defined by:

If the series converges, the convergence region, which is the set of values of z in the complex plane for which the series converges, is different for each f(n). The transform is defined by n≥0 so as to allow a two-way correspondence between the function in time and its transform. Consequently, the time function will also have to be defined for n≥0, otherwise, its transform would ignore all the function for n<0.

Example 1. Consider f(n)=1, constant for any n≥0 (the so-called unit step):

As you can see, this is the geometric series of reason 1/z that converges to:

The convergence region is therefore made up of all complex z-s outside the circle of unit radius.

Example 2. Consider the Z transform of :

The series of reason d/z converges to:

per

and the convergence region consists of all complex z values outside the circle of radius |d|.

## Fundamental theorems related to the zeta transform

Linearity. Assumed Z[f1(n)]=F1(z) and Z[f2(n)]=F2(z) with c1, c2 constants:

Translation over time. Assumed , then:

In particular, if the initial conditions are null, you will have:

and, similarly:

Translation in z. Assumed , then placing a=constant:

Final value. If converges by |z|>1 and all poles of (1-z)F(z) are within the circle of unit radius, then:

Initial value. If and there exists the , then:

Partial derivative. If Z[f(n,a)]=F(z,a), then:

Convolution over time. If and , then:

## Applying the Z transform in solving equations to finite differences

The most common application of the Z transform is the one in which it is used to analytically solve finite difference equations. It allows to transform these equations into an algebraic equation that, once solved in z, will allow to obtain the solution in time y(n) by operating the inverse transform and calculating it for each n.

Example. Have the following equation at finite differences of the second order:

y(n+2)-y(n+1)+0,21y(n)=3x(n+1)+1,2x(n)

and suppose we want to find the answer to the unit step in the case of null initial conditions.

Applying the zeta transform to the equation, remembering that we are in the hypothesis of null initial conditions:

from here we can get the discrete transfer function (ratio of output to input in the variable z:)

We can see that the function G(z) has a zero in 0.4 and two poles in p1=0.3 and p2=0.7.

To obtain the output in response to a unit step, we will now have to multiply the G(z) by X(z). The latter is nothing more than the zeta transform of the unit step which, as can be seen from the table, holds:

Thus, the answer to the unit step in the z domain will be:

For the calculation of the y(n), we now proceed with the inverse transform, first applying the decomposition into partial fractions:

Using the table already seen, we can now calculate y(n) through the inverse transform:

y(n)=20+7,5(0,3)n-27,5(0,7)n