CHAPTER 1

Introduction to Digital Signal

Processing
 Engr. Zeeshan Habib
Assistant Professor
Department of Electrical Engineering

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
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.
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
A/D Converter

Band Pass
Filter Sampler Quantizer Coding

010110..

Input Analog Discrete- Time Quantized Signal Digital Signal

Signal Signal
Digital Signal Processing
D/A Converter

Band Pass
Decoding Quantizer Sampler
Filter
010110..
Digital Signal Decoded Signal Quantized Signal

Analog
Discrete- Time 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
Analog/continuous time Discrete Time Signal is
Signal is represented as a represented as function of
function of time n (number of samples)
Mathematically, X1(t) =cos𝜋𝑡
-infinity < t < infinity

x(t) x(n)

t n
Representation Of Discrete Time Signal

A discrete signal can be represented as:

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

Graphical
f (n)  f [n]  f (nT )
x(n)

4
3
2
1
0 n
-1
-2
-3
-4
Representation Of Discrete Time Signal

Functional 1 for n  1,3


x ( n)  4 for n  4
0 elsewhere

x(n)

0 n
-1 0 1 2 3 4
Representation Of Discrete Time Signal

Tabular
n -2 -1 0 1 2 3
x(n) 0 0 0 1 4 1
x(n)
4

0 n
-2 -1 0 1 2 3
Representation Of Discrete Time Signal

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

Origin x(n)

1
n
0
-3 -2 -1 0 1 1
Elementary Discrete Time Signal

Unit Impulse Sequence

1 for n 0
 ( n)  
0 for n  0
x(n)

0 n
-1 0 1 2
Elementary Discrete Time Signal

Unit Step Sequence

1 for n  0
U ( n)  
0 for n  0
x(n)

0 n
-3 -2 -1 0 1 2 3 4
Elementary Discrete Time Signal

Unit Ramp n for n  0

U r ( n)  r ( n)  
0 for n  0
x(n)

n
-3 -2 -1 0 1 2 3 4
Elementary Discrete Time Signal

Exponential When a=Real n

x ( n)  a
n 0 1 2 3 4
For 0<a<1
Let a=0.5 x(n) 1 0.5 0.25 0.125 0.0625

x(n)
3

0 n
0 1 2 3 4
Elementary Discrete Time Signal

Exponential j n
x(n)  (re)  r n (cos n  j sin n)
When a=Complex  x (n)  r n cos n , x (n)  r n sin n
R C

For a>1 n 0 1 2 3 4
Let a=2 x(n) 1 2 4 8 12
x(n)
12
11
10
9
8
7
6
5
4
3
2
1
0 n
0 1 2 3 4
Comparison Between Continuous Time &
Discrete Time Frequencies
 Continuous Time
x(t )  A cos( t   ) ,    t  

  2F , F 

Where,
A  Amplitude
  Frequency (radian / second )
  Phase
Comparison Between Continuous Time &
Discrete Time
 Discrete Time

x(n)  A cos(n   ) ,    n  
   2f
x(n)  A cos( 2fn   )
Where
A = Amplitude
 = Frequency (radian/sample)
 = Phase
Relation Between ,F & ,f
x( n)  x( nT )
T  Sampling Period
Fs  1 / T  Sampling Rate( Samples / Sec)
Sampling Frequency( Hz )
t  nT  n / Fs
x(t )  A cos( 2Ft   )
x(nT )  x(n)  A cos( 2nFT   )
When sampled at sampling rate Fs  1 / T
x(nT )  x(n)  A cos( 2nF / Fs   )
Relation Between ,F & ,f

Compare the above signal with the following

x(n)  A cos( 2nf   )
 f  F / Fs
  2F / Fs
   / Fs  T || F   / 2
Sampling 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( - )
= 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
Example 1 x (t )  3 cos 100t
Let Fs=100Hz, evaluate the signal at n=0, 1, 2, 3, 4, 5.
Also draw the sampled signal.
Solution:
x (t )  3 cos 2(50)t
where f  F / Fs  50 / 100
x (t )  3 cos 2 (50 / 100)t
x ( n)  3 cos n
Examples
Graphical representation of sampled signal.
n 0 1 2 3 4 5
x(n) 3 -3 3 -3 3 -3
x(n)
4
3
2
1
0 n
-1
-2
-3
-4
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.
Aliasing
Examples
Example 2
Consider the following two signals which are
sampled at 40 Hz.
x (t )  cos 2 10t
1
x (t )  cos 2 50t
2

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
Solution :

x (t )  cos 2 10t
1
  2F
1
2 10  2F
1
x (t )  cos 2 10t
1
Examples
Solution Contd. :
Since,
f  F / Fs
So,
x ( n)  cos 2 (10 / 40)t
1
x ( n)  cos(n / 2)
1
Similarly ,
x ( n)  cos 2 (50 / 40)t
2
x ( n)  cos( 5n / 2)
2
 cos( 2n  n / 2) || cos(   )
 cos n / 2
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
the original signal.

 Fs  100 Hz || F  50 Hz
2
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)?