Digital Signal Processing (EE-471)

Lecture 01
Introduction

Dr. S M Wasif
[email protected]
October 12, 2023
Department of Electrical Engineering,
University of Gujrat
Table of contents

1. Course Break-Up Plan & Reference Books

2. Introduction

3. Applications of DSP

4. Discrete-time Signals

5. Elementary Discrete-time Signals

6. Important Transformations of Sequences

7. Energy and Power Signals

8. Discrete-time Systems

1
Course Break-Up Plan &
Reference Books
Marks Break-Up

• End Term Exam 50

• Mid Term Exam 25
• Unannounced Quiz (6) 10
• Assignments (3) 10
• Presentation/Design Course Work 05

2
Reference Books

1. John G. Proakis, Dimitris G. Manolakis, “Digital Signal

Processing Principles, Algorithms and Applications”,
Prentice Hall, (Latest Edition).
2. Alan V. Oppenheim, Ronald W. Schafer, John R. Buck, ”Discrete
Time Digital Signal Processing”, Prentice Hall, (Latest Edition).
3. Emmanuel C. Ifeachor, Barrie W. Jervis, “Digital Signal
Processing, A Practical Approach”, Prentice Hall, (Latest
Edition).
4. Manolakis, Dimitris G., and Vinay K. Ingle. “Applied Digital Signal
Processing: Theory and Practice”. Cambridge University Press,
2011.
5. Sanjit K. Mitra, “Digital Signal Processing A Computer Based
Approach”, McGraw Hill, (Latest Edition).
6. Monson H. Hayes, “Schaum’s Outline of Theory and Problems of
Digital Signal Processing”, McGraw Hill, (Latest Edition).

3
Introduction
Digital Signal Processing?

• Signal: information about the state or behaviour by means of a

pattern of variations/changes.
• Mathematically represented as function of one or more variables.
e.g., time, space etc.

s(x, y) = 3x + 2xy + 10y 2

s(t) = 20t 2
• Unknown, complex or highly complicated function relationship.

4
Digital Signal Processing?

5
Digital Signal Processing?

• Continuous-time signal:
defined for every value of time
t.

• Digital signal: discrete-time

signal with finite values of
amplitude.

6
Digital Signal Processing?

• Digital signal processing: is the discipline concerned with the

representation, transformation and manipulation of the digital
signal and the information they contain.
• System: “A regularly interacting or independent group of items
forming a unified whole”.
or
• “A physical device that performs an operation on a signal”.
or
• “Extract useful information from a signal”.
• Types:
- Continuous-time system: transforms a continuous-time input signal
into a continuous-time output signal.
- Discrete-time system: transforms a discrete-time input signal into a
discrete-time output signal.
• Digital system: where input and output both are digital signals.

7
Digital Signal Processing?

8
Applications of DSP
Applications of DSP

• Instrumentation and Control Position and rate control,

Spectrum Analysis etc.
• Communication Modulation and demodulation, Video
conferencing.
• Signal security Encryption and decryption, Multiplexing and
Demultiplexing.
• Data Compression Reduce space/computation required to
store/process data.
• Signal Denoising Filtering for noise reduction Speaker / system
identification.
• Audio processing Signal enhancement, equalization.
• Image processing Pattern Recognition, Robotic Vision,
Enhancement, Watermarking, Reconstruction.

9
Applications of DSP

• Data analysis and feature extraction Recognize structure in

data.
• Frequency / spectral analysis Alternate approach to time
domain analysis.
• Signal generation TOUCH-TONE dialing, Music.
• Military Radar and Sonar processing, Missile guidance.
• Biomedical EEG, ECG, X-rays etc.
• Consumer Products Computer, Mobile, Camera, Digital TV.

10
Discrete-time Signals
Sequences

• Represented mathematically
as sequence of numbers.

x = x[n] for −∞ < n < ∞

• Periodic sampling of
continuous-time signal.

x[n] = xa [nT ] for −∞ < n < ∞

11
Discrete-time Signal Representations

12
Elementary Discrete-time
Signals
Elementary Discrete-time Signals

• Unit Sample Sequence: also

known as unit impulse signal.
(
0, n 6= 0
δ[n] =
1, n=0

• An arbitrary signal as a sum

of scaled, delayed impulses.
• In general
∞
X
x[n] = x[k]δ[n − k ]
k=−∞

13
Elementary Discrete-time Signals

• Unit Step Sequence:

(
1, n≥0
u[n] =
0, n<0
• Unit step related to unit impulse by:
∞
X
u[n] = δ[k ]
k=−∞
or
∞
X
u[n] = δ[n − k ]
k=−∞

14
Elementary Discrete-time Signals

• Exponential Sequences: x[n] = Aαn .

• For positive value of A i.e., 0 < α < 1, decreasing positive value
sequence with increase in n.

• if −1 < α < 0 decreasing and alternating sign sequence with

increase in n.

15
Elementary Discrete-time Signals

• If |α| > 1 growing in amplitude sequence as n increases.

• If both A and α are complex valued i.e.,

α = |α|ejω0

A = |A|ejφ
then x[n] = Aαn is a complex exponential sequence.

16
Elementary Discrete-time Signals

• Periodic and Aperiodic Sequences: a sequence x[n] is

periodic if:
x[n] = x[n + N] for all n
• Example discrete-time sinusoid:
A cos(ω0 n + φ) = A cos(ω0 n + ω0 N + φ)
if ω0 N = 2πk .
• Some examples:
πn
x1 [n] = cos( ) withN = 8
4
πn
x1 [n] = cos( ) withN = 8
4
• Some examples:
πn
x1 [n] = cos( ) with N=8
4
3πn
x2 [n] = cos( ) with N = 16
8 17
Important Transformations of
Sequences
Important Transformations of Sequences

18
Energy and Power Signals
Energy and Power Signals

• The energy E of a signal x[n] is defined as:

∞
X
E= |x[n]|2
n=−∞

• The average power of a discrete-time signal x[n] is defined as:

N
1 X
P = lim |x[n]|2
N→∞ 2N + 1
n=−N

• Some examples:
x[n] = 5(0.8)n u[n]

19
Discrete-time Systems
Discrete-time Systems

• A device or algorithm that performs some prescribed operation

on a discrete-time signal.
• Operates according to some well defined rule on input/excitation
to produce output/response.
• A transformation or operator for mapping an input x[n] into an
output y [n].
y[n] = Hx[n]

20
Classification of Discrete-time Systems

• Systems classes are defined based on the constraints on the

properties of transformations T {.}.
• Static or dynamic systems

y[n] = ax[n] is static

y [n] = nx[n] + bx 3 [n] is static

y[n] = x[n] + 3x[n − 1] is dynamic
n
X
y[n] = x[n − k] is dynamic
k=0

21
Classification of Discrete-time Systems

• Linear Systems: satisfies the Superposition Principle i.e.,

– Additivity property
T {x1 [n] + x2 [n]} = T {x1 [n]} + T {x2 [n]} = y1 [n] + y2 [n]
– Homogeneity/Scaling property
T {ax[n]} = aT {x[n]} = ay [n]
– The superposition principle after combining these two properties:
T {ax1 [n] + bx2 [n]} = aT {x1 [n]} + bT {x2 [n]}
– If inputs can be generalized as:
X
x[n] = ak xk [n]
k

then the output of a linear system will be:

X
y [n] = ak yk [n]
k
Pn 22
– Example: The Accumulator system: y[n] = k =−∞ x[k ]
Classification of Discrete-time Systems

• Time-Invariant Systems:
– A time shift or delay of the input sequence causes a
corresponding shift in the output sequence.
– If input-output characteristics of a system don’t change with time.
Pn
– The Accumulator system i.e., y [n] = k=−∞ x[k] is time
invariant.
– While Compressor system i.e., y[n] = x[Mn] is time variant.
• Causality: output depend upon present and past inputs
(i.e., x[n], x[n − 1], x[n − 2], . . . ).

y[n] = x[n] − x[n − 1] is causal

y[n] = x[n + 1] − x[n] is non − causal

23
Classification of Discrete-time Systems

• Stability: if every bounded input produces a bounded output.

|x[n]| ≤ Bx < ∞ for all n

|y [n]| ≤ By < ∞ for all n

• Summary of discrete-time system properties.

24