Connexions module: m28741 1

∗
TYPES OF DISCRETE - TIME SYSTEMS

Nguyen Huu Phuong

This work is produced by The Connexions Project and licensed under the
†
Creative Commons Attribution License

Dicrete-time (digital) systems comprise of serveral basic types with dierent characteristics. The catego-
rization gives us a deeper understanding of systems and the choice of appropriate analysis method.

1 Memoryless systems, and systems with memory

A memoryless (or static) system does not need memory. It processes the input and output signals taking
place at the same instant. For example

y (n) = 2x (n)

y (n) = 2x (n) − x2 (n)

Actually there is a small delay between input and output due to the propagation delay of the system.
A system with memory (or dynamic) needs memory to store past and future values needed for the
processing. For example

y (n) = x (n) + 0.8x (n − 1) : one memory cell

1
y (n) = [x (n − 1) + x (n) + x (n + 1)]
3 : two memory cell
P+∞
y (n) = k=−∞ x (n − k) : inf inite memory

2 Causal and noncausal systems

In causal system the result comes after the cause, or, at the same time (simultaneously). This is to say
that the output at index n only depends on the input at n, n  1, n  2,. . ., and not on n + 1, n + 2,. . . In
noncausal systems, on the other hand the output also depends on future inputs. Following is a few examples.
(a) y (n) = 2x (n) − 3x2 (n) : noncausal
(b) y (n) = 1
[x (n − 1) + x (n) + x (n + 1)]
3 : noncausal due to the last term
P∞
(c) y (n) = k=0 x (n − k) : causal
P∞
(d) y (n) = n=−∞ x (n) : noncausal
P∞
(e) y (n) = k=−∞ x (n − k) : noncausal
(f ) y (n) = x (−n) : noncausal
∗ Version 1.1: Jul 9, 2009 5:01 am GMT-5
† http://creativecommons.org/licenses/by/3.0/

http://cnx.org/content/m28741/1.1/
Connexions module: m28741 2

(g) y (n) = x2 (n) : noncausal

: noncausal


(h) y (n) = x n2
In real-time processing (or on-line processing), systems must be causal, o-line processing (or
batch processing or block processing) systems can be noncausal since all samples have been stored in
memory, many of those will be future values with respect to the chosen time origin.
The concept of causality is also applied to signals but the denition is modied. A signal x(n) can be
classied as

• Causal (or right-sided) if x(n) = 0 for n < 0

• Anticausal (or left-sided) if x(n) = 0 for n ≥ 0

• Two-sided (or bilateral) if x(n) exists for all n (<0 and ≥ 0)

For example, the unit step u(n) is causal, u(-n-1) is anticausal, a|n| is two-sided. We can plot out these
signals to really see the dierence.

3 Time-invariant and time-variant systems

The characteristics of a system may change with time so that the output depends on the input as well as
the instant the input is applied. This is a time-variant system. On the other hand, many systems can be
assumed to be time-invariant, i.e. the output does not depend on the time the input is applied. The terms
shift-variant and shift- invariant can be used instead of time-variant and time-invariant respectively.
The time (shift) invariance is judged as follows.
If x (n) → y (n)
then x (n − k) → y (n − k)
This criterion is illustrated in Figure 1

Figure 1: Time (shift) invariant system

http://cnx.org/content/m28741/1.1/
Connexions module: m28741 3

Example 1
Are the following systems time-invariant?
(a) y (n) = 13 [x (n − 1) + x (n) + x (n + 1)]
(b) y (n) = nx (n)
(c) y (n) = x (−n)
Solution
(a) For the system
y (n) = 13 [x (n − 1) + x (n) + x (n + 1)]
If the present input is delayed by k (i.e. by replacing x(n) by x(n  k). . .) then the output is
y (n − k) = 13 [x (n − 1 − k) + x (n − k) + x (n + 1 + k)]
and if the present output is delayed by k (i.e. by replacing n by n  k)
y ' (n − k) = 31 [x (n − 1 − k) + x (n − k) + x (n + 1 + k)]
Since
y ' (n − k) = y (n − k)
the system is time-invariant.
(b) For the system
y (n) = nx (n)
if the present input is delayed by k then the output is
y (n − k) = nx (n − k)
and if the present output is delayed by k then the output is
y ' (n − k) = (n − k) x (n − k)
Since
y ' (n − k) 6= y (n − k)
the system is time-variant.
(c) For the system
y (n) = x (−n)
we have
y (n − k) = x (−n − k)
y ' (n − k) = x [− (n − k)] = x (−n + k) 6= y (n − k)
So the system is time-variant.

4 Linear and nonlinear systems

The signicance of linearity and nonlinearity for discrete-time systems is about the same as for analog
systems. Suppose two input signals x1 (n) and x2 (n) when applied separately to a system give corresponding
outputs y1 (n) and y2 (n) . Now if a linear combination of the two inputs give the same linear combination
of the outputs then the system is linear, otherwise the system is nonlinear. Thus linearity implies both
scalability (proportionality) and superposition. The denition of linearity is illustrated in Figure 2.

http://cnx.org/content/m28741/1.1/
Connexions module: m28741 4

Figure 2: Linear systems

Example 2
Consider the linearity of the following systems:
(a) y (n) = n2 x (n)
y (n) = nx n2


(b)
(c) y (n) = nx2 (n)
(d) y (n) = Ax (n) + B, A, B constants
Solution
(a) The system is

y (n) = n2 x (n)
The two separate inputs and corresponding outputs are

y1 (n) = n2 x1 (n)

y2 (n) = n2 x2 (n)
Now for the combined input

x (n) = a1 x1 (n) + a2 x2 (n)

the output is

y (n) = n2 [a1 x1 (n) + a2 x2 (n)] = a1 n21 (n) + a2 n22 (n) = a1 y1 (n) + a2 y2 (n)
   

So the system is linear.

(b) The system is

http://cnx.org/content/m28741/1.1/
Connexions module: m28741 5

y (n) = nx n2

The procedure is summarized as follows

x1 (n) → y1 (n) = nx1 n2

x2 (n) → y2 (n) = nx2 n2

x (n) = a1 x1 (n) + a2 x2 (n)

then

y (n) = a1 nx1 n2 + a2 nx2 n2 = a1 y1 (n) + a2 y2 (n)

So the system is linear.

(c) The system is

y (n) = x2 (n)
The reasoning is

x1 (n) → y1 (n) = x21 (n)

x2 (n) → y2 (n) = x22 (n)

x (n) = a1 x1 (n) + a2 x2 (n)

then
2
y (n) = [a1 x1 (n) + a2 x2 (n) ] = a21 y12 (n) + a22 y22 (n) + 2a1 a2 x1 (n) x2 (n)
So the system is nonlinear
(d) The system is

y (n) = Ax (n) + B, A, B
The reasoning is

x1 (n) → y1 (n) = Ax1 (n) + B

x2 (n) → y2 (n) = Ax2 (n) + B

x (n) = a1 x1 (n) + a2 x2 (n)

y (n) = A [a1 x1 (n) + a2 x2 (n)] + B

= a1 Ax1 (n) + a2 Ax2 (n) + B
= a1 [Ax1 (n) + B] + a2 [Ax2 (n) + B] + B − a1 B − a2 B
= a1 y1 (n) + a2 y2 (n) + (1 − a1 − a2 ) B

http://cnx.org/content/m28741/1.1/
Connexions module: m28741 6

Due to the presence of the last term the system is nonlinear. When B = 0 (the system is said relaxed)
the system becomes linear.
Hereafter, all systems are assumed to be linear and time (shift) invariant (LTI or LSI), otherwise
stated.
Still, there is an important characteristic of systems, i.e. the stability. Systems are either stable or
nonstable (astable). Stability will be discussed in next chapter (Section 2.4).

http://cnx.org/content/m28741/1.1/