Why DSP ?

•Difficult and expensive to perform

signal processing with Analog signal
processing systems or analog circuitry.
•Digital circuits using digital computers
are smaller, faster, cheaper and more
reliable.
•Digital processing hardware is flexible –
allows programmable operations
•Higher order of precision achievable
with digital hardware and software.
 Limitations of DSP
• Conversion of analog signal to digital forms
involve
– Sampling the signal
– Quantizing the samples
• This results in a distortion due to which the
original analog signal may not be
reconstructed
• This distortion can be controlled by proper
choice of sampling rate and the precision in
the quantization process
 Signals
• Definition: Any physical
quantity that varies
with time (speech),
space (image) or any
other independent
variable(s).
• Fig. RHS shows a speech
signal.
• An image=f(x,y)
• A video=f(x,y,t)
• ECG, EEG are natural
signals
Analog vs. Digital Signal Processing
Sampling of analog signals
Some basic discrete time signals
Some basic discrete time signals
Some basic discrete time signals
Some basic discrete time signals
Some basic discrete time signals
Some basic discrete time signals
Symmetric(even) and asymmetric(odd) signals
 Symmetric(even) and asymmetric(odd) signals

• Any arbitrary signal can be expressed as the

sum of two signal components, one even and
the other odd.

x(n)  xe (n)  xo (n)

1
xe (n)  [ x(n)  x( n)]
2
1
xo (n)  [ x(n)  x( n)]
2
Shifting of discrete time signals
Folding of discrete time signals
Shifting of discrete time signals
Some manipulations of discrete time signals
 Discrete time systems
• A discrete time system is a device or algorithm that
operates on a discrete time signal called the input
(excitation) to produce another discrete time signal
called the output (response).
• As if the input signal x(n) is being transformed by the
system into the output signal y(n) i.e.
y(n)  Γ[x(n)]
 Input-Output description of discrete time
systems

• The input-output description of a discrete

time system consists of a mathematical
expression or rule, which defines the
relationship between the input and the output
signals, e.g.
Input-Output description of discrete time
systems - Example
Input-Output description of discrete time
systems - Example
 Input-Output description of discrete time
systems – Example of accumulator

• The current output of the system depends on

the current input and the past output.
 Input-Output description of discrete time
systems –Block Diagram form

• Background: Delaying a signal by ‘k’ samples (k > 0)

i.e. x(n)  x(n-k) corresponds to multiplying all
terms of X(z) by z  k
 Input-Output description of discrete time
systems –Block Diagram form

• Background: Delaying a signal by ‘k’ samples (k > 0)

i.e. x(n)  x(n-k) corresponds to multiplying all
terms of X(z) by z  k
Input-Output description of discrete time
systems –Block Diagram form

• Adder

• Multiplier

• Unit advance
element
 Block Diagram representation of discrete
time systems- Example
• Example: Draw the block diagram representation of the
discrete time system described by the following input-
output relation
 Types of discrete time systems
• Static (memory less) and dynamic systems

• Time-invariant and time varying systems

 Types of discrete time systems
• Time-invariant and time varying systems
• Time-invariant and time varying systems-Example

• Ex: Determine if the system y(n)=x(n)-x(n-1) is

time invariant.
• Time-invariant and time varying systems-Example

• Ex: Determine if the system y(n) = nx(n) is time

invariant.
 • Time-invariant and time varying systems-Example
• Ex: Determine if the system y(n) = x(-n) is time
invariant.

n -5 -4 -3 -2 -1 0 1 2 3 4 5
x(n) 0 0 2 2 2 0 1 2 3 4 0
y=x(-n) 0 4 3 2 1 0 2 2 2 0 0
x(n-2) 0 0 0 0 2 2 2 0 1 2 3
T[x()] 3 2 1 0 2 2 2 0 0 0 0
y(n-2) 0 0 0 4 3 2 1 0 2 2 2
 • Linear and nonlinear systems
• Def: A discrete time system is linear if its response to a weighted sum of
signals is equal to the weighted sum of the responses (outputs) od the
system to each of the individual input signals
i.e. Ƭ = Ƭ Ƭ

Example
• Linear and nonlinear systems-Example Contd.
 • Linear and nonlinear systems-Example Contd.

(c)
 • Causal and noncausal systems

Example
 • Analysis of discrete time linear time invariant
(LTI) systems
• Discrete time linear time invariant (LTI) systems are
characterized by in the time domain by their response to
a unit sample sequence.
 • Resolution of a discrete time signal into unit
sample sequences

• Any arbitrary input

signal can be
represented as a
weighted sum of unit
sample sequences.
• Suppose we have an
arbitrary signal x(n).
• If we multiply two
sequences x(n) and
x(n-k), we get x(k). Let
k=8.
 • Analysis of discrete time linear time invariant
(LTI) systems

• Let y(n,k) be the response of the system to the unit sample

sequence at n=k. Thus, .
• So if the input is scaled by an amount x(k), the response of the
LTI system is .
• Now, if the input is the arbitrary signal x(n) that is expressed as

then the response of the system to x(n) is, by superposition,

=
• Since system is time invariant, if its response to
then its response to . So,
…….. Known as Convolution sum
 • Analysis of discrete time linear time invariant
(LTI) systems

• In convolution, it is irrelevant which of the sequences is folded

and shifted.

• Now,

• If a new variable is defined then .

• So,

• Since ‘m’ is a dummy variable, ‘m’ may be replaced by ‘k’.

• So, …. Convolution sum

Example1

𝑦 𝑛 =∑ 𝑥 𝑘 ℎ 𝑛−𝑘 =∑ 𝑣 𝑘 where 𝑣 𝑘 = 𝑥 𝑘 ℎ 𝑛 − 𝑘
Example1 Contd.
Example1 Contd.
Example2

=
Example2: contd.
Example2: contd.
Properties of convolution-Example
Properties of convolution-Solution Contd.
Systems with finite duration and infinite duration
impulse response

• LTI systems can be divided into two types – those

having a finite duration impulse response (FIR) and
those having an infinite duration impulse response
(IIR).
• A FIR system has an impulse response that is zero
outside some finite time interval. It has a finite
memory.
• For a causal FIR system, h(n)=0 if n<0 and n>=M.
So,
• An IIR system has infinite memory.
• For causal IIR system,
Recursive and nonrecursive discrete time systems
• The convolution formula expresses the output of an
LTI system only in terms of the input signal x(n).

• There are many discrete time systems where it is

desirable to express the output y(n) in terms of
– Present and past values of input
– Past values of the output

• Example: a discrete time system to compute the

cumulative average of a signal x(n)
Recursive and nonrecursive discrete time systems
Recursive and nonrecursive discrete time systems

• At time n=n0, the only information one needs is the past value
y(n0-1) and the new input sample x(n0).

• The term y(n0-1) is called the initial condition of the system and
contains all information needed to determine the output for
n>=n0 for the input x(n), independent of what occurred in the
past.
Recursive and nonrecursive discrete time systems
• In general, for complex causal recursive systems, the output y(n)
is a function of several past output values and present and past
inputs

• If y(n) depends only on present and past inputs, the system is

called nonrecursive
Recursive and nonrecursive discrete time systems
• If y(n) depends only on present and past inputs, the system is
called nonrecursive

• Causal linear time invariant (LTI) systems are nonrecursive

 LTI discrete time systems characterized by
constant coefficient difference equations
• Systems described by constant coefficient linear
difference equations are a subclass of recursive and
nonrecursive systems