CHAPTER 1

Introduction to Digital Signal Processing

Dr. Zeeshan Habib
Assistant Professor
Department of Computer Science

HITEC University Taxila Cantt

Contents
• Introduction
• Digital Signal Processing
• Representation Of a Discrete Signal
• Elementary Discrete Time Signals
• Comparison Between Continuous-Time & Discrete-Time Sinusoids
• Sampling of Analog Signal
• Relation Between Ω,F & ω,f
• Examples
Introduction (Signal, System and Signal Processing)

A signal is any physical quantity that varies with time, space or any other
independent variable or variables.
S1(t)=5t
S2(t) = 20t^2
s(x, y) = 3x + 2xy + 10y^2
However, there are cases where such a functional relationship is unknown or too
highly complicated to be of any practical use.
For example, a speech signal (see Fig. 1.1.1) cannot be described functionally by
expressions.
Speech Signal
• Deterministic Signals:
Definition: Signals completely specified by a mathematical equation;
future values can be exactly predicted.

𝑥(𝑡)=5cos⁡(2𝜋𝑓𝑡+𝜙)
Examples: Continuous Time:

𝑥[𝑛]=𝑒−0.2𝑛sin⁡(0.5𝜋𝑛)
Discrete-Time:
• Non-Deterministic (Random) Signals:
Definition: Signals that exhibit randomness; future values cannot be
exactly predicted and are described using probability and statistics.

White Gaussian Noise: 𝑥(𝑡)∼𝑁(0,𝜎2) a Random Process

Examples:

Example:𝑥[𝑛]=𝐴cos⁡(2𝜋𝑓𝑛+Θ) (where Θ is a random variable)

Introduction
• In real life all signals are continuous time signals or analog signals,
such as heart beat, speech, ECG (electrocardiogram), EEG
(electroencephalogram) etc.
• But signals used by mobiles, TV, microwave and multimedia
applications are digital signals.
• Digital signals are not continuous in nature.
• Conversion of signal is required from analog to digital, in order to
store them on computers or for transmission.
System
• A system may also be defined as a physical device that performs an
operation on a signal.
For example, a filter used to reduce the noise and interference
corrupting a desired information-bearing signal is called a system.
• In general, the system is characterized by the type of operation that
it performs on the signal.
For example, if the operation is linear, the system is called linear. If the
operation on the signal is nonlinear, the system is said to be nonlinear.
Such operations are usually referred to as signal processing.

Input X(t)--🡪[system]--🡪output y(t)

Algorithm
• The method or set of rules for implementing the system by a program
that performs the corresponding mathematical operations is called an
algorithm.
Usually, there are many ways or algorithms by which a system can be
implemented, either in software or in hardware, to perform the desired
operations and computations.
• Algorithm should be computationally efficient, fast and easy to
implement.
Analog Signal Processing(ASP)
• Fig. 1.1.2. Both the input signal and the output signal are in analog
form.
Digital Signal Processing(DSP)
• DSP or Digital Signal Processing as the term suggest is the processing
of signal by digital means.
• There are three basic processes involved in Digital Signal Processing
• Sampling
• Quantization
• Coding
Digital Signal Processing
Conversion Of Analog to Digital & Digital to Analog
Digital Signal Processing
Analogue to digital (A/D) Converter

Band Pass
Sampler Quantizer Coding
Filter

010110.
.
Quantized
Input Digital Signal
Analog Discrete- Signal
Signal Time Signal
Digital Signal Processing
D/A Converter

Band Pass
Decodin Quantize Sampler
Filter
g r
010110.
.
Digital Signal Decoded Signal Quantized
Signal
Analo
Discrete- Time g
Signal Signal
Types of Signals
Pros and cons of DSP

Pros
• Easy to duplicate
• Stable and robust: not varying with temperature, storage without deterioration
• Flexibility and upgrade: use a general computer or
microprocessor
Cons
• Limitations of ADC and DAC
• High power consumption and complexity of a DSP Implementation, unsuitable for simple,
low-power applications
• Limited to signals with relatively low bandwidths
Applications of DSP

❑Speech processing
• Enhancement – noise filtering
• Coding
• Text-to-speech (synthesis)
• Recognition
❑ Image processing
• Enhancement, coding, pattern recognition (e.g. OCR)
❑ Multimedia processing
• Media transmission, digital TV, video conferencing
❑ Communications
❑ Biomedical engineering
❑ Navigation, radar, GPS
❑ Control, robotics, machine vision
Classification of Signals
Continuous-Time Versus Discrete-Time Signals

x(n)

x(t)

n
t
Representation Of Discrete Time Signal

A discrete signal can be represented as:

• Graphical
• Functional
• Tabular
• Sequence
Representation Of Discrete Time Signal

Graphical
 Representation Of Discrete Time Signal

Functional
 Representation Of Discrete Time Signal

Tabular
n -2 -1 0 1 2 3
x(n 0 0 0 1 4 1
)
 Representation Of Discrete Time Signal

Sequence
x(n) = {0,0,1, 4 ,1,0}

Origin
 Elementary Discrete Time Signal

Unit Impulse Sequence

 Elementary Discrete Time Signal

Unit Step Sequence

 Elementary Discrete Time Signal

Unit Ramp

x(
n)
4

n
- - - 0 1 2 3 4
3 2 1
 Elementary Discrete Time Signal
Exponential When a=Real

For 0<a<1 n 0 1 2 3 4
Let a=0.5 x(n) 1 0.5 0.25 0.125 0.062
5
 Elementary Discrete Time Signal

Exponential
When a=Complex

For a>1 n 0 1 2 3 4
Let a=2 x(n) 1 2 4 8 12
Comparison Between Continuous Time & Discrete Time Frequencies

• Continuous Time
Comparison Between Continuous Time & Discrete Time

• Discrete Time

Where
A = Amplitude
ω = Frequency (radian/sample)
θ = Phase
Relation Between Ω,F & ω,f
Relation Between Ω,F & ω,f
Sampling and Aliasing Of Analog Signal
Let,
ω0 = ω1 & ω2 = 2π − ω0

Therefore,
x1(n) = Acosω0 n =Acosω1 n

Similarly,
x2(n) = Acosω2 n
= Acos(2π − ω0)n || cos(α - β) = {cos(A−B)= cosAcosB + sinAsinB}
= Acos(− ω0)n
= Acosω0n
Sampling Of Analog Signal
If ω0 is greater than π, then the original signal will repeat itself as seen in the above calculations.
Also x2(n) is called the alias of x1(n). Due to this property(uniqueness) it is difficult to
distinguish between signals. Range for discrete-time signal will become:

-π ≤ ω ≤ π
ω = 2πƒ
⇒ ƒ = ω /2π
⇒ ƒ = ± π / 2π
⇒ ƒ=±1/2
⇒ -1/2 ≤ ƒ ≤ 1/2
Examples
Examp
le 1
Let Fs=100Hz, evaluate the signal at n=0, 1, 2, 3, 4, 5.
Also draw the sampled signal.
Soluti
on:
Examples
Graphical representation of sampled signal.
n 0 1 2 3 4 5
x(n) 3 -3 3 -3 3 -3
Sampling Theorem

Nyquist Theorem:
If the highest frequency contained in an analog signal xa(t) is
Fmax = B, and the signal is sampled at a rate Fs > 2Fmax = 2B,
then xa(t) can be exactly recovered from its sample values using the interpolation
function without the loss of any information.
Minimum Sampling Rate (Nyquist Rate):
•The minimum required sampling frequency to avoid aliasing is Fs=2B, known as
the Nyquist rate.
•If the sampling rate Fs is lower than 2B, aliasing occurs, meaning different
frequency components overlap and cause distortion.
Aliasing
Examples
Consider the following two signals which are sampled at 40 Hz.

Then find,
1) Discrete-Time signal.
2) Is there any aliasing , if so find Alias signal.
3) Find the minimum Sampling rate to avoid aliasing.
Examples
Soluti
on :
Examples
Solution
Contd. :
Examples
Solution Contd. :
Since both signals are same, so we can say that x2(n) is an alias signal of x1(n).
To avoid aliasing we apply Nyquist Criteria which states that the sampling frequency
should be double of the highest frequency component of original signal.
Examples
EXAMPLE 1.4.2
Consider the analog signal

(a) Determine the minimum sampling rate required to avoid aliasing..

(b) Suppose that the signal is sampled at the rate Fs= 200 Hz.. What is the discrete-time signal
obtained after sampling?
(c) Suppose that the signal is sampled at the rate Fs= 75 Hz. What is the discrete-time signal
obtained after sampling?
(d) What is the frequency 0 < F < Fs/2 of a sinusoid that yields samples identical to those obtained in
part (c)?