DIGITAL SIGNAL

PROCESSING
(DSP)

Digital Signal Processing

Course Code
Theory

4 Hours / week

Practical

2 Hours / week

Marks(Total)

125 Marks

Theory

80 Marks

IA Test

20 Marks

Term Work

25 Marks

DSP is everywhere

DSP is everywhere
Sound applications
Compression, enhancement, special effects, synthesis, recognition, echo
cancellation,
Cell Phones, MP3 Players, Movies, Dictation, Text-to-speech,
Communication
Modulation, coding, detection, equalization, echo cancellation,
Cell Phones, dial-up modem, DSL modem, Satellite Receiver,
Automotive
ABS, GPS, Active Noise Cancellation, Cruise Control, Parking,
Medical
Magnetic Resonance, Tomography, Electrocardiogram,
Military
Radar, Sonar, Space photographs, remote sensing,
Image and Video Applications
DVD, JPEG, Movie special effects, video conferencing,
Mechanical
Motor control, process control, oil and mineral prospecting,


Syllabus weightage: Marks and time required

Unit
No.
1

Details

Discrete Time Signal

1.1 Introduction to Digital Signal Processing, Discrete Time
Signals, Sampling and Reconstruction, Standard DT Signals,
Concept of Digital Frequency, Representation of DT signal
using Standard DT Signals, Signal Manipulations(shifting,
addition, subtraction, multiplication), Classification of
Signals,
Linear
Convolution
formulation(without
mathematical
proof),
Circular
Convolution
formulation(without
mathematical
proof),
Matrix
Representation of Circular Convolution, Linear by Circular
Convolution. Auto and Cross Correlation formula evaluation,
Discrete Time System
2.1 Introduction to Discrete Time System, Classification of DT
Systems (Linear/Non Linear, Causal/Non Causal, Time
Invariant/Time Variant Systems, Stable/ Unstable), BIBO Time
Domain Stability Criteria. LTI system, Concept of Impulse
Response and Step Response. 2.2 Concept of IIR System and
FIR System, Output of IIR and FIR DT system using Time
Domain Linear Convolution formula Method.

Teaching
Hours

Marks
Weight
By %

12

20%

15 %

Syllabus weightage: Marks and time required

3

Discrete Fourier Transform

Introduction to DTFT, DFT, Relation between DFT
and DTFT, Properties of DFT without mathematical
proof (Scaling and Linearity, Periodicity, Time Shift
and Frequency Shift, Time Reversal, Convolution
Property and Parsevals Energy Theorem). DFT
computation using DFT properties. 3.2 Transfer
function of DT System in frequency domain using
DFT. Linear and Circular Convolution using DFT.
Response of FIR system calculation in frequency
domain using DFT.

Fast Fourier Transform

4.1 Radix-2 DIT-FFT algorithm, DIT-FFT Flowgraph for
N=4, 6 & 8, Inverse 06 FFT algorithm. Spectral
Analysis using FFT, Comparison of complex and real,
multiplication and additions of DFT and FFT.

12

15 %

15 %

Syllabus weightage: Marks and time required

5

DSP Algorithms
5.1 Carls Correlation Coefficient Algorithm, Fast
Circular
Convolution
Algorithm,
Fast
Linear
Convolution Algorithm, Linear FIR filtering using Fast
Overlap Add Algorithm and Fast Overlap Save
Algorithm,

DSP Processors and Application of DSP

6.1 Need for Special architecture of DSP processor,
Difference
between
DSP
processor
&
microprocessor,
A
general
DSP
processor
TMS320C54XX series, Case study of Real Time DSP
applications to Speech Signal Processing and
Biomedical Signal Processing
Total

14

22 %

10

18 %

52

100 %

Signal Processing
Humans are the most advanced signal

processors
speech and pattern recognition, speech
synthesis,

We encounter many types of signals in various applications

Electrical signals: voltage, current, magnetic and electric fields,
Mechanical signals: velocity, force, displacement,
Acoustic signals: sound, vibration,
Other signals: pressure, temperature,

Most real-world signals are analog

They are continuous in time and amplitude
Convert to voltage or currents using sensors and transducers

Analog circuits process these signals using

Resistors, Capacitors, Inductors, Amplifiers,

Analog signal processing examples

Audio processing in FM radios
Video processing in traditional TV sets

Limitation of Analog signal

processing
Accuracy limitations due to
Component tolerances
Undesired nonlinearities
Limited repeatability due to
Tolerances
Changes in environmental conditions
Temperature
Vibration

Sensitivity to electrical noise

Limited dynamic range for voltage and currents
Inflexibility to changes
Difficulty of implementing certain operations
Nonlinear operations
Time-varying operations

Difficulty of storing information

Introduction

Advantages of DSP
Flexibility
Reliability
Easy storage
Precision

Applications of DSP
Biomedical
Speech processing
Image processing

Signals
Continuous
Signal

Discrete
Signal

Discrete Time Signals

x(t )
t=nT

x(nT )

Representation of Discrete
Time
signals
n
-4 -3 -2 -1 0
1
2
3
x(n
)

-1

-1

Tabular representation

Graphical representation

x( n) {1,2,1,1,0,2,1,1,1}
Sequence representation

x(n) = 1 ; n = -4
=2;n=
-3
= -1 ; n =
-2
=1;n=
-1
=0;n=0
=2; n=
1
Functional=representation
1;n=2
= -1 ; n =

4
1

Sampling and Reconstruction

Nyquist rate:
Fs = 2 x Fmax

Digitizing the Sound

We want to reconstruct the sound digitally
How often must we obtain a sample to

faithfully reproduce the sound?

Poor Sampling
1.5
1
0.5
0
-0.5

10

-1
-1.5

Sampling Frequency = 1/2 X Wave Frequency

12

Even Worse
1.5
1
0.5
0
-0.5

10

-1
-1.5

Sampling Frequency = 1/3 X Wave Frequency

12

Higher Sampling
Frequency
1.5
1
0.5
0
0

-0.5

10

-1
-1.5

Sampling Frequency = 2/3 Wave Frequency

12

Getting Better
1.5
1
0.5
0
-0.5

10

-1
-1.5
Sampling Frequency = Wave Frequency

12

Good Sampling
1.5

0.5

0
0

10

12

-0.5

-1

-1.5

Sampling Frequency = 2 X Wave Frequency

Sampling and Reconstruction

Sampling and Reconstruction

Nyquist-Shannon
Sampling Theorem
A bandlimited signal can be reconstructed

exactly if it is sampled at a rate atleast twice

the maximum frequency component in it

Fs >= 2 x Fmax
The highest frequency which can be

accurately represented is one-half of the

sampling rate

Sums
Consider analog signal,

xa(t) = 6 cos 50 t + 3 sin 200 t 3 cos 100 t

Determine minimum sampling frequency and sampled
version of analog signal at this frequency.

Sums
Consider analog signal,

xa(t) = 3 cos 100 t

a) Determine minimum required sampling rate to avoid
aliasing.
b) Suppose signal is sampled at Fs = 200Hz. What is the
discrete time signal obtained after sampling?
c) Suppose that signal is sampled at rate
Fs =
75Hz. What is discrete time signal obtained after
sampling?

Sums

Consider analog signal,

x(t) = 3 cos 2000 t + 5 sin 6000 t +

10 cos 12000 t
a) What is Nyquist rate for this signal?
b) If sampling rate is 5000 samples/sec, what is discrete
time signal obtained after sampling?
c) What is analog signal that we reconstruct from samples
if we use ideal interpolation?

Standard discrete time signals

Standard discrete time signals

Ramp signal

Exponential signal

x(n) = an ; n 0
=0 ;n<0

0<a<1

a>1

Important Sequences
Real exponential sequence

x ( n) a

x(n)
...
...
-8 -7 -6 -5 -4 -3 -2 -1

1 2 3 4 5 6 7 8 9 10

Important Sequences
Real exponential sequence

x ( n) a

x(n)
...
...
-8 -7 -6 -5 -4 -3 -2 -1

1 2 3 4 5 6 7 8 9 10

Important Sequences
Sinusoidal sequence

x(n) A cos(n0 )
x(n)
n

Important Sequences
A sequence x(n) is defined to be periodic with

period N if

x(n) x(n N ) for all N

Example:

consider x ( n) e

j 0 n

x ( n ) e j 0 n e j 0 ( n N ) e j 0 N e j 0 n x ( n N )
0 N 2 k

2 k
N
0

2
0

must be a rational
number

Energy of a Sequence
Energy of a sequence is defined by

| x ( n) |

Operations on Sequences
Sum
Product

x y {x(n) y (n)}
x y {x(n) y (n)}

Multiplication
Shift

x {x(n)}
y (n) x(n n0 )

Sequence Representation
Using delay unit
x ( n)

x ( k )( n k )

x(n)
a-3

a1
2

-8 -7 -6 -5 -4 -3 -2 -1

3 4 5 6

a2

7
8 9 10

a7

x(n) a3(n 3) a1(n 1) a2 (n 3) a7 (n 7)