DSP1

Download as ppt, pdf, or txt
Download as ppt, pdf, or txt
You are on page 1of 24

Digital Signal Processing

Dr. Ahmad Salman

SEECS

Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, ©1999-2000 Prentice Hall Inc.
Course Objectives

• Objective :Develop intermediate and advanced


understanding of Digital Signal Processing Theory and
Applications

– A natural extension of Signals and Systems

– Know the fundamental signal processing tools

– Know how and where to use which tool

– Develop a mathematical foundation for advanced


signal processing techniques
Course Books
Required Text
Discrete-Time Signal Processing, 3rd or later Edition
Prentice Hall, Alan Oppenheim, Ronald Schafer
Lecture Notes

References
• Schaum’s Outlines: Digital Signal Processing
M. H. Hayes (Practice Problems)
• Understanding DSP-Lyons (2nd Edition)
• DSP-System analysis and design
Paulo S. R. Diniz et al.

MATLAB Exercises
• Signal Processing First J. H. McClellan et al.
• Digital Signal Processing-A computer based approach –Mitra
• Unlimited resources on internet
DSP Where !

DSP is Everywhere
DSP Where !
• Any information in nature exist in the form of some signal e.g.,
sound, purely electrical signal, EM signal, purely chemical
signal, purely mechanical signal OR combination of any of
these…

• Do you believe there must be some ONE and ONLY god


signal?

• Our aim is to visualize these signals and extract the


information of interest i.e., do some processing on these
signals.

• So, Signal Processing is Father of all Engineering Processing


as it tells you the basic structure and nature of a signal.
DSP Where !
• Remember this figure throughout your signal processing
life.

Input Output
Process
Signal Signal

• There are two side of mirror and hence the above figure
– Time side
– Frequency side
DSP Where !

• Communication – Signal Processing for Communication


– Equalization, Channel Estimation, Echo cancellation,
Detection, etc.
– Cellular phones, Satellite receivers, Modems, etc.

Courtesy : Lake of Soft


DSP Where !

• Speech (sound) Applications


– Speech compression, speaker identification, speech
enhancement in noisy environment, special effects
– Cell Phones, MP3 Players, Movies, Dictation, Text-to-
speech,…

Speaker Recognition

Speech enhancement
DSP Where !

• Speech (sound) Applications


– Speech compression, speaker identification, speech
enhancement in noisy environment, special effects
– Cell Phones, MP3 Players, Movies, Dictation, Text-to-
speech,…
DSP Where !

• Image Processing
– Image is after all a 2-D signal

Raw Image Filtered Image Pedestrian tracking

Vehicle tracking
DSP Where !

• Biomedical Signal Processing


– Magnetic Resonance, Tomography,
Electrocardiogram,…
DSP Where !
• Military
– Radar, Sonar, Space photographs, remote
sensing
DSP Where !

• Mechanical
– Motor control, process control, oil and mineral
prospecting,…
• Automotive
– ABS, GPS, Active Noise Cancellation, Cruise Control,
Parking,…
Course Outline

Review Should take no more than 2 sessions


– Discrete-Time Signals and System
• Discrete-Time Signals: Sequences
• Discrete-Time Systems
– Linear Time-Invariant Systems
• Properties of Linear Time-Invariant Systems
• Linear Constant-Coefficient Difference Equations
– Freq. Domain Representation of Discrete-Time Signals
• Representation of Sequences by Fourier Transforms
• Symmetry Properties of the Fourier Transform
• Fourier Transform Theorems
Z-Transform 1-2 sessions
• Properties of the Region of Convergence of the z-Transform
• The Inverse Z-Transform
• Z-Transform Properties
Course Outline
Sampling of Continuous-Time Signals
- Periodic (Uniform) Sampling / Frequency-Domain Representation
- Reconstruction of a Bandlimited Signal from Its Samples
- Discrete time processing of continuous time signals
- Continuous time processing of discrete time signals

Transform Analysis of Linear Time-Invariant Systems Optional


–The Frequency Response of LTI Systems
–Constant-Coefficient Difference Equations
–Frequency Response for Rational System Functions
–Relationship between Magnitude and Phase
–All-Pass Systems / Minimum-Phase Systems

Structures for Discrete-Time Systems


- Block Diagram Representation /Signal Flow Graph
Representation
- Basic Structures for IIR Systems / Transposed Forms
- Basic Structures for FIR Systems
Course Outline

Filter Design Techniques


- Design of Discrete-Time IIR Filters from Continuous-Time Filters
– Design of FIR Filters by Windowing

The Discrete-Fourier Transform & FFT


– Discrete Fourier Series
– The Fourier Transform of Periodic Signals
– The Discrete Fourier Transform
– FFT
Linear Prediction Analysis/Wavelet Transform/Signal
Enhancement
– Theory and applications

Power Spectrum Estimation


– Theory and applications
Course Weightages

Theory :

• Quizzes (5) 15%

• Assignments (1-2) : 5%
– Software

• Midterm 30%
– Written
– Software (Optional)

• Final Exam 40%

• Project 10%
Say Hello to DSP

• Signals in nature exist in continuous/analogue form. You can do


analogue signal processing.

• The aim of using computers for the ease of calculation is digital


signal processing.

• So, understand how to jump from analogue processing to digital


processing.

• Naturally standalone digital processing is extremely difficult: It


like defying nature.

How??
Say Hello to DSP
Say Hello to DSP
Say Hello to DSP
Discrete-Time Signals: Sequences
• Discrete-time signals are represented by sequence of numbers
– The nth number in the sequence is represented with x[n]
• Often times sequences are obtained by sampling of
continuous-time signals

10

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

-10
0 10 20 30 40 50 n (samples)
Basic Sequences
• Delaying (Shifting) a sequence

y[n]  x[n  no ]
1.5
• Unit sample (impulse) sequence
1
0 n  0
[n]   0.5
1 n  0 0
-10 -5 0 5 10
1.5
• Unit step sequence
0 n  0 1
u[n]  
1 n  0 0.5

0
-10 -5 0 5 10
• Exponential sequences 1

x[n]  An 0.5

0
-10 -5 0 5 10
Sinusoidal Sequences
• Important class of sequences

xn  coson  
jo
• An exponential sequence with complex    e and A  A e j

xn  An  A e j  e jon  A  e jon   


n n

xn  A  coson    j A  sinon  


n n

• x[n] is a sum of weighted sinusoids


• Different from continuous-time, the discrete-time sinusoids
– Have ambiguity of 2k in frequency
coso  2k n    coson  

2k
coson    coson  oN   only if N  is an integer
o

You might also like