EMT488/3

DIGITAL SIGNAL PROCESSING

WEEK 1

Discrete Time Signals &

Systems
 Recall:

A Signal is any variable that carries or contains information

Can be extracted, modified so that it:
can be conveyed, displayed and manipulated.
A discrete signal or discrete-time signal is a time series consisting
of a sequence of quantities. In other words, it is a time series that is a
function over a domain of integers.
TYPE OF SIGNALS
 Even and Odd Signals
A continuous-time signal x(t) is said to be an even signal if
xt xt for all t

The signal x(t) is said to be an odd signal if

xt xt for all t

In summary, an even signal are symmetric about the vertical axis

(time origin) whereas an odd signal are antisymetric about the
origin.

Even Signal Odd Signal.

4
 Periodic and Non-Periodic Signals
A periodic signal x(t) is a function of time that satisfies the
condition

xt xt T for all t ,

where T is a positive constant.

The smallest value of T that satisfy the definition is called a period.

Non-periodic Signal. Periodic

5 Signal.
Definition & Introduction

DISCRETE TIME SIGNAL

 Discrete-Time Signals

Discrete-Time Signals are function of discrete variable,

i.e. they are defined only at discrete instants of time.
xn xnTs , n 0,1,2,....

It is often derived from continuous-time signal by sampling at uniform rate.

Ts denotes sampling period and n denotes integer.
The symbol n denotes time for discrete time signal and [ ] is used to denote
discrete-value quantities. n
n being an integer in the range
A sample value of a typical signal or sequence is denoted as x[n]. x[n] is defined
only for integer values of n and is undefined for non-integer values of n
 Discrete-Time Signals (contd)

Discrete-time signal may also be written as a

sequence of numbers inside braces:

x[n]={,-0.2, 2.2,1.1,0.2,-0.7,2.9,}

In the above, x[-1]=-0.2, x[0]=2.2 x[1]=1.1 etc.

The arrow is placed under the sample at

time index n = 0
 Discrete-Time Signals (contd)

The graphical representation of a discrete time

signal with real-valued samples is as shown below:
 Discrete-Time Signals (contd)

In some applications, a discrete-time sequence x[n]

may be generated by periodically sampling a
continuous-time signal xa(t) at uniform time
intervals
Real & complex sequence

DISCRETE TIME SIGNAL

Discrete-Time Signals (contd)

x[n] is a real sequence, if the n-th sample

is real for all values of n
Otherwise, x[n] is a complex sequence
 Discrete-Time Signals (contd)

A complex sequence x[n] can be written

as {x[n]}={xre[n]+jxim[n]} where xre[n] and
xim[n] are the real and imaginary parts of x[n]
The complex conjugate sequence of {x[n]}
is given by {x*[n]}={xre[n]- jxim[n]}
Often the braces are ignored to denote a
sequence if there is no ambiguity
Finite & Infinite Length

DISCRETE TIME SIGNAL

 Discrete-Time Signals (contd)

- A discrete-time signal may be a finite length

or an infinite-length sequence
- Finite-length (also called finite-duration or
finite-extent) sequence is defined only for a
finite time interval: N1 n N 2 where: N
N 2 with N1 N 2
 Discrete-Time Signals (contd)

Examples:
x[n]= n2, 3 n 4
is a finite-length sequence of length 8

y[n]=cos(0.4n)
is an infinite-length sequence

is a finite-length sequence of length-12

Causal & Anti-causal sequence

DISCRETE TIME SIGNAL

 Discrete-Time Signals (contd)

A right-sided sequence x[n] has zero valued

samples for n N1

If N1 0 a right-sided sequence is called a causal

sequence Past
 Discrete-Time Signals (contd)

A left-sided sequence x[n] has zero-valued

samples for n N 2

If N 2 0 a left-sided sequence is called a

anti-causal sequence Future
BASIC OPERATION
 Arithmetic Operation

Addition, subtraction, multiplication and division

Example:
Given 2 discrete signals as shown below. Calculate:

(a) x1[n] x2[n]

(b) x1[n] x2[n]
(c) x1[n]/ x2[n]
(d) x1[n] x2[n]
 Folding Operation

This operation is a process to fold the signal at y-

Axis and at n=0.
The n(sequence) will change the place, positive
value will become negative and vice versa.
Mathematically it can be written as x[n]

y[n] x[n]
 Delay/Advance Operation

This operation is a process to move the sequence or

sample in X-Axis based on determined value.
Mathematically it can be written as x[n nd ]
If nd is positive value, then the sequence will move to
positive and vice versa.

Present Delay Advance

 Delay/Advance Operation (cont)

Time-shifting operation: y[n] = x[n N] , where N is

an integer
If N > 0, it is delaying operation
e.g. unit delay: y[n] = x[n 1]

If N < 0, it is an advance operation,

e.g. unit advance: y[n] = x[n +1]
 Time Scaling.
Time scaling refers to the multiplication of the variable by a real
yn xan,
positive constant.

If a > 1 the signal y[n] is a compressed version of x[n].

If 0 < a < 1 the signal y[n] is an expanded version of x[n].
Example:

Effect of time scaling on a discrete-time signal:

(a) discrete-time signal x[n] and (b) version of x[n] compressed by a factor of 2,
with some values of the original x[n] lost as a result of the compression.
25
 Branching Operation

Branching operation: Used to provide

multiple copies of a sequence
 Branching Operation (cont)

y[n] = x[n]+ x[n 1]+ x[n 2]+ x[n 3]

1 2 3 4
Thank you