Digital Signal Processing

Lecture 1
Introduction & DSP is Everywhere
Source: Internet, Projects (from different Organizations)

Dr. Irum Nosheen

 Outline

 Basic Introduction of DSP

 Applications
 Projects
 DSP in Biomedical Engineering
 DSP in Radars
 DSP in Communication Systems
 DSP in AI and Data Analytics
 Course Outline, Text Book, Grading
 Signal & System Representation
 DIGITAL SIGNAL PROCESSING
(THEORY) EE-332
Pre-requisite: Signals & Systems (EE-230)
Credit Hours: 03
Contact Hours: 48

RECOMMENDED BOOKS
 Discrete-Time Signal Processing by Alan V. Oppenheim, Ronald
W. Schafer.Third Edition
REFERENCE BOOKS
 Digital Signal Processing by John G. Proakis And Dimitris G. Manolakis
 Introduction to Signal Processing by Sophocles J. Orfanidis
 Digital Signal Processing: A Computer-Based Approach by Mitra
Digital Signal Processing by Emmanuel C. Ifeachor and Barrie W. Jervisignals,
Systems, and Transforms by Charles L. Phillips
 OBJECTIVE OF COURSE
The objective of this course is to familiarize with
fundamental principles of digital signal processing. Overview
of Discrete-time systems including difference between
continuous, discrete and digital systems. Fundamental
concepts of Linear, discrete and LTI systems and their
properties. Review of linearity, stability, causality,
convolution, circular convolution and correlation. Discrete
time Fourier transform, discrete Fourier series and discrete
Fourier transform. z-transform, its properties, z-transform
of FIR and IIR systems, Application of z-transform for
analysis of Linear Shift Invariant systems, system stability,
effect of a pole and a zero on magnitude response of a FIR
and IIR system, min-phase and all-pass systems, pole-zero
location of linear phase FIR systems, Circular Convolution,
Discrete Fourier Transform, Fast Fourier Transform, Finite
Impulse Response (FIR) and Infinite Impulse Response (IIR)
filters.
 CLO/PLOs MAPPING
Sr.NO CLO/PLOs MAPPING Domain PLO
01 Apply the knowledge of C3 1
mathematics and engineering to
analyze discrete time signals.
02 Apply the principles to solve C3 2
discrete time convolution
problems, and perform time and
frequency domain conversion.
03 Analyze the digital systems using C4 2
z-transform and Discrete Time
Fourier transforms
04 Design FIR and IIR filters using a C5 3
variety of techniques
05 Use MATLAB tools to analyze and C3 5
process discrete time signals and
systems.
 COURSE CONTENTS

Introduction
Signals, Systems, and Signal Processing
Types of Signals
The concept of the frequency
Analog-to-Digital and Digital-to-Analog Conversion
Discrete Time Signals and Systems
Discrete-time Signals, Discrete-time Systems
Analysis of Discrete-time Linear and Time invariant systems
Linear Time-Invariant Systems and properties
Discrete-time systems described by Difference Equations
Implementation of the Discrete-time Systems
Correlation of Discrete-time Signals
 COURSE CONTENTS
The Z- and Fourier transform and its Application to the
Analysis of LTI Systems
The z-transform, graphical presentation and mathematical
modeling
Properties of the z-transform and pole zero maps
Rational z-transform
Inverse z-transform
Analysis of LTI Systems in the z-transform
The one sided z-transform, two sided Z-transform
Frequency Analysis of Signals
Frequency Analysis of Continuous –Time Signals
Frequency Analysis of Discrete-Time Signals
Frequency Domain and Time –Domain Signal Properties
Properties of the Fourier transform for Discrete-Time
Signals
 COURSE CONTENTS
Frequency-Domain Analysis of LTI Systems
Frequency -Domain Characteristics of LTI Systems
Frequency response of LTI Systems
Correlation Functions and Spectra at the Output of LTI
Systems
LTI Systems as Frequency-Selective Filters
Inverse Systems and Deconvolution
Sampling and Reconstruction of Signals
Ideal Sampling and Reconstruction of Continuous –Time
Signals
Discrete Time Processing of the Continuous –Time Signals
Analog-to-Digital and Digital-to-Analog Converters
Sampling and Reconstruction of Continuous –Time Signals
Oversampling A/D and D/A Converters
 COURSE CONTENTS
The Discrete-time Fourier transform
Frequency-Domain Sampling: The Discrete
Fourier Transform
Properties of the DFT
Linear Filtering Methods Based on the DFT
Frequency Analysis of Signals Using the DFT
Efficient Computation of the DFT: Fast Fourier
Transform Algorithms
Digital Filters Design
Design of FIR Filters
Design of IIR Digital Filter
Frequency Transformations
 COURSE CONTENTS

Multi-rate Signal Processing

Decimation by a Factor M
Interpolation by a Factor L
Sampling Rate Conversion by a Rational Factor M/L
Application of the Multi rate Signals Processing
Digital Filter Banks
 DSP

Application of mathematical operations (linear

and non-linear) to digitally represented signals

IN OUT
A/D DSP D/A

x[1]
x[0]

n
-3 -2 -1 0 1 2 3 4
 Discrete Time Signal
General Introduction

sequence x[n]

- as opposed to continuous-time signals x(t)

- “time” = independent variable
 Example- 1D Signal
Sampled continuous-time (analog) signals
- Speech
Example: 2D Digital Images
2-D arrays (matrices) of numbers
 Software Implementation of Analog Systems
R

C
x(t) y(t)

x[n] y[n]
-1
z
a
 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,…
 Financial Sector
18
19
 DSP in Real Time Embedded Systems
Data Storage Web wireless
Digital & Transmission technology Ultrasound
Radiographic Medical
Imaging Imaging

Spy
Video Satellite
Communications Real- Time DSP Imaging
Military
Space Appls
Imaging
Appls

Real-Time
Optical – Video-Camera
Speech
Car Awake Wearable Cell-Phones
Recognition
warning system Computers
 Digital Signal Processing
• Represent signals by a sequence of numbers
– Sampling or analog-to-digital conversions
• Perform processing on these numbers with a program or HW
– Digital signal processing
• Reconstruct analog signal from processed numbers
– Reconstruction or digital-to-analog conversion
digital digital
signal signal
analog analog
signal A/D DSP D/A signal

• Analog input – analog output

– Speech in Mobile Phone
• Analog input – digital output
– Speech to text
• Digital input – analog output
– Text to speech
• Digital input – digital output
– Compression of a file on computer
– Data minning
EEG electroencephalogram signal
Records the electrical activity of the brain obtained from
electrodes placed on the scalp.
A computer aided system capable of processing biological signals of learners in real-time to
monitor their level of attention, cognition and engagement.
Intra-cardiac Signals
 fMRI

fMRI measures brain activity by detecting associated changes in

blood flow
 3-D Accelerometers

Powergloves: body pose estimation using a network of 3D

accelerometers
Thallium scans
 Fundus Image

The fundus of the eye is the interior surface of the eye, opposite the lens, and
includes the retina, optic disc, macula and fovea,
 Sensing: OCT Image

Optical coherence tomography (OCT) uses light to capture 

micrometer-resolution, three-dimensional images from within
optical scattering media (e.g., biological tissue). 
 • Intelligent Medical Equipment based Unified Networked
Hospital
– Digitization and net-enabling of medical equipment
– Incorporation of intelligent diagnostics
• Image and signal processing & artificial intelligence
– The virtual hospital and workflows in SW
• Need to add payment system in the SW
– National Storage for Decision Aiding

Diabetic
Cardiac ECG Nuclear National
Retinopathy, Hess
Intra Cardiac Cardiac & CT Gastroenterology Repository &
Holter Monitor Angiography
Maculopathy, Charting
Analytics
OCT

i-Hospital
Use ICT as a Catalyst
 Eye Care
• Diabetic Retinopathy (DR)
• Diabetic Maculopathy (DM)
• Detection of AMD using OCT
• Glaucoma Detection
• Diagnosis of Paralytic Strabismus using Hess
Screening • Funded by
• AFIO
• Dr Mazhar Ishaq
• Dr Ubaidullah Yasin
• Dr Yasir
• CASE/College of EME
• Dr Shafaat A Bazaz
• Dr Usman Akram
• Dr Waheed
• Dr Shahzad
 Human Retina and Fundus Image
The retina is the layer of tissue at the back of the inner eye
Optic Disc - brightest circular spot

Macula - main central part of retina responsible for fine details

and sharp vision
 Blood Vessels
Feature Feature Selection
Extraction

Retinal Image Candidate Lesions

Feature Set

Optic Disc

Microaneurysms
Normal

Haemorrhage
Mild

Moderate Hard Exudates

Severe Soft Exudates

A Tele-Cardiac &
i-Diagnostic System
Corporate Social Responsibility

AFIC / NIHD
National ICT R&D Fund
 Doctor on the move Tele-cardiac node at
Deployed System in AFIC
District hospital

Wireless
Internet
ONT

Ambulance
WebSerices ONT
and NMS
Server

Local Area Network

PDA

WiFi Router

Patient Doctor’s Operator

Terminal

51
ECG Wave

52
ECG View

54
Advanced ECG View

55
Advanced ECG View

56
ECG Streaming View

57
Doctor’s Comment View

58
Software Defined Radio
 The Technology From Other
Channels

1010010 10110 01101

Analog to Source Encrypted
Encrypt Multiplex
Digital Encode Data
Analog Converter Bits Encoded
input Bits Multiplexed Data
Pulse Channel Scrambled 01101
Digital Bandpass modulated Encoded data
waveform 01010
waveform Data
Bandpass Bit to Sym. Channel 10101
modulate & Pulse Encode Scrambler
Modulate
1001101 10001

Digital Digital Channel

Bandpass Baseband Bits Decoded
waveform waveform Equalizer, Data
De-modulate Channel De-
Timing and
Decode scramble
Sym. to Bits 01101
Source Descrambled Bits
Decrypted De-
Decoded multiplexed
Bits
Bits Bits
Source 10001
D/A De-
Analog Decode Decrypt
10110 Multiplex
output 1010010 To other
Channels
Software Defined Radio (Frequency
Hopping)

61
Software Defined Radio (Equilizer)

62
SDR (Equalizer)

63
Speaker Identification System: Speech Playback

Selected Speech File

for Playback and
Spectrum Analysis

Speech playback with

Spectrum Analysis
Digitized Network Centric System for Air Defense
(in Deployment)
ADIG Architecture

 Smart Routers
 Ground based Bandwidth wire, fiber, point
to point wireless
 AD Tactical Radio System (ADTRS)
 ADIG Enterprise Services (ADES)/Net-Centric
Enterprise Services (NCES)
 Information Assurance (IA)
 IPV4/IPV6 Implementation

65
RDX for Chinese, Sweden & American Radars

LAADS RDX
Giraffe RDX

66
Air Defence Tactical Radios
ADTR Man Pack Version

ADTR Vehicle Version

67
  KLT (PCA)
Eigenimages – examples:

Facial
image
set

Corresponding
“eigenfaces”

3 eigenimages and the individual variations on those components Face

aproximation,
from rough to
detailed, as more
coefficients are
added
Learning how to learn
Barriers to Study
 Barriers to Study

 The Lack of Mass

 Do assignments yourself
 Code C/Matlab assignments yourself
 Contribution in the project
 The Skipped Gradients
 Don’t miss a class/assignment
 The Misunderstood Word
 Work on your concepts
 Course Objectives
 To establish the idea of using computing
techniques to alter the properties of a signal
for desired effects, via understanding of
 Fundamentals of discrete-time, linear, shift-
invariant signals and systems in
 Representation and Analysis: sampling, quantization,
Fourier and z-transform;
 Adv Topic: Multirate DSP, Bandpass Sampling
 Implementation: filtering and transform techniques;
 Adv Topic: Digital Design Concepts
 System Design: filter & processing algorithm design.
 Adv Topic: Non Linear Systems
 Efficient computational algorithms and their
implementation.
Course Outline
Course Outline
 Prerequisite

 A fundamental course in signal &

systems
 Liner System analysis and transform
analysis
 convolution and filtering
 Fourier transforms
 Laplace and z transforms
 Textbook
 Oppenheim, Schafer and
Buck, Discrete-Time
Signal Processing, 2nd
edition, 3rd edition
(Prentice-Hall)
 References:
 Hayes, Digital Signal
Processing (Schaum’s
Outlines Series), 1999
 McClellan, Schafer, &
Yoder, DSP First
 Marks Distribution
• Objective
– Establish a background in designing Digital Signal Processing algorithm
• Required Text
– Discrete-Time Signal Processing, Prentice Hall, 2nd Edition, Alan Oppenheim, Ronald
Schafer, John Buck
• Grading
– Mid-term 25%
– Quizzes 10%
– Assignments 5%
– Term Project: 10%
– Final: 50%
• Homework: Due to beginning of next week class from the assignment
– Problems from the book / previous exams
– MATLAB simulations
 Signals

Basic Types
 Discrete-Time Signals: Sequences
• Discrete-time signals are represented by sequence of numbers
– The nth number in the sequence is represented with x[n]
• Sampling of continuous time signal
– x[n] is value of the analog signal at xc(nT)
– Where T is the sampling period
10

-10
0 20 40 60 80 100 t (ms)
10

-10
0 10 20 30 40 50 n (samples)
 Signals

Signals

Continuous-time Discrete-time

Continuous-value Continuous-value Discrete-value

Analog Discrete Digital

79
 Basic Signals
1.5

1
•Unit sample (impulse) sequence
0.5
0 n  0
[n]   0
1 n  0 -10 -5 0 5 10
1.5

1
•Unit step sequence
0 n  0 0.5
u[n]  
1 n  0 0
-10 -5 0 5 10
1

•Exponential sequences 0.5

x[n ]  a n
0
-10 -5 0 5 10
 Special Types of Discrete Signals

• Note: The unit impulse/sample  takes the

value of 1 whenever its argument (contained
in []) becomes zero.
• Example:

1 n  2
  3n  6  
0 n  2

81
 Special Types of Discrete Signals

• Note: The unit step u takes the value of 1 whenever its

argument (contained in []) is greater then zero.
• Example:

1 n  3
u  2n  6  
0 n  3
• Unit step sequence and unit sample can be expressed as a
function of the other:
n
u[n]    [k ]
k  
 [n]  u[n]  u[n  1]
 Special Types of Discrete Signals

• Unit Ramp
n n  0
r  n  
0 n  0 r[n]

-3 -2 -1 0 1 2 3 n
 Special Types of Discrete Signals
x[n]
x[n]
1

1
-3 -2 -1 0 1 2 3 n -3 -2 -1 0 1 2 3 n

x[n ]  a n
 Special Types of Discrete Signals

x[n] x[n]
1

1
-3 -2 -1 0 1 2 3 n -3 -2 -1 0 1 2 3 n
 Sinusoidal Sequences
xn  cos on  

• Sinusoid x[n ]  Ae jon 

x n   A cos on     jA sin o n   

• A complex exponential

sindemo
Sine and Exp Using Matlab
% sine generation: A*sin(omega*n+theta)
% exponential generation: A^n
n = 0: 1: 50;
% amplitude
A = 0.87;
% phase
theta = 0.4;
% frequency
omega = 2*pi / 20;
% sin generation
xn1 = A*sin(omega*n+theta);
% exp generation
xn2 = A.^n;
Periodic Discrete-Time Signals
 Periodicity of Discrete-Time Signals vs. Continuous
Signals:
 Continuous Signals:
2
A cos  0t    , P R
f0
 Discrete-Time Signals: A signal x is said to be periodic
with period of N≠0 (we assume that N>0)if only if

x n  x n  N , for all n & N  Z

 Basic Operations

operations
Operations in Matlab

xn1 = [1 0 3 2 -1 0 0 0 0 0];
xn2 = [1 3 -1 1 0 0 1 2 0 0];
yn = xn1 + xn2;
x[n] via impulse functions
Input: sum of weighted shifted impulses
Time Domain Analysis
Linear Time-Invariant Systems
 Linear

linearity
Principle of Superposition (cont.)
 Another way of stating principle of superposition:

 Additive Property

T{x1[n] + x2[n]} = T{x1[n]} + T{x2[n]}

 Scaling (Homogeneity) Property

T{ax[n]} = a T{x[n]} = ay[n]

LinearLinear
Time-Invariant
Time-Invariant Systems System
Linear Time-Invariant System
Input: sum of weighted shifted impulses
Using Linearity and Time-Invariance for the impulses
Sum of wt. Shifted impulses – sum of wt. Shifted impulse responses
Convolution Example

Representation of the output of a linear time-invariant system as the

superposition of responses to individual samples of the input.
105
LTI System
Properties of LTI Systems

h1[n]
x[n] h1[n] h2[n] y[n]
x[n] y[n]
x[n] h2[n] h1[n] y[n]
h2[n]

x[n] h1[n]*h2[n] y[n]

x[n] h1[n]+h2[n] y[n]

x[n] h2[n]*h1[n] y[n]

x[n] h2[n]+h1[n] y[n]
Principle of Superposition.
T{ax1[n] + bx2[n]} = aT{x1[n]} + bT{x2[n]}
a
x1
ax1[n] + bx2[n]
T{} y= T{ax1[n] + bx2[n]}
x2
b
a
aT{x1[n]}
x1 T{}
y= aT{x1[n]}+bT{x2[n]}
x2 T{}
bT{x2[n]}
b