BECE301L

DIGITAL SIGNAL PROCESSING

WINTER SEMESTER 2023-2024
Dr.S.KALAIVANI,
Professor,
Department of Communication Engineering,
School of Electronics Engineering (SENSE).

10-01-2024 Dr.S.KALAIVANI_Winter_2024 1
SIGNIFICANCE OF THIS COURSE
■ Signals and systems are areas that are used in every single field of technology,
■ All pieces of hardware that need to sense the world around them (robots, wearable technology
like fitbits, radar) need to be able to recognize signals and change their systems appropriately.
■ Signal processing involves converting or transforming data in a way that allows us to see things
in it that are not possible via direct observation.
■ Signal processing allows engineers and scientists to analyze, optimize, and correct signals,
including scientific data, audio streams, images, and video.
■ A signal is a function that conveys information about a phenomenon.

10-01-2024 Dr.S.KALAIVANI_Winter_2024 2
COURSE OBJECTIVES
1. To summarize and analyze the concepts of signals, systems in
time and frequency domain with the corresponding
transformations.
2. To inculcate the design concepts of analog, digital IIR, FIR filters.
3. To instill diverse structures for realizing digital filters.
4. To infuse the novice concepts of Multirate digital signal
processing

10-01-2024 Dr.S.KALAIVANI_Winter_2024 3
Course Outcomes:
■ Students will be able to
1. Classify and analyse Signals & Systems along with their time and
frequency domain transformations.
2. Simplify Fourier transform computations using swift algorithms.
3. Examine various analog filter design techniques and their
digitization.
4. Design FIR and IIR digital filters.
5. Realize digital filters using various system interconnections.
6. Design and formulate Multirate systems.

10-01-2024 Dr.S.KALAIVANI_Winter_2024 4
SYLLABUS
■ Module:1 Discrete Signals, Systems and frequency analysis 6 hours
– Review of Discrete-Time Signals & Systems and frequency analysis - Z-
transform: ROC stability / causality analysis, Frequency domain sampling -
Sampling rate conversion - Aperiodic correlation estimation - Cepstrum
processing - Band limited discrete time signals.
■ Module:2 Discrete Fourier Transform, Properties and its applications 6 hours
– DFT – Properties - Linear filtering methods - Frequency analysis of signals
using DFT - FFT Algorithm - Radix-2 FFT - Sparse FFT - Practical applications
■ Module:3 Design of Analog Filters 6 hours
– Design techniques for analog filter - Butterworth and Chebyshev
approximations - Frequency transformation, Properties - Constant group delay
and zero phase filters.

10-01-2024 Dr.S.KALAIVANI_Winter_2024 5
SYLLABUS
■ Module:4 Digital transformation of IIR filters 5 hours
– IIR filter design: Bilinear transformation, Impulse Invariance - Spectral
transformation of Digital filters
■ Module:5 Design of FIR filters 5 hours
– FIR Filter Design: Design characteristics of FIR filters with linear-phase –
Frequency response of linear phase FIR filters – Design of FIR filters using
windowing techniques: Rectangular, Bartlett Hamming, Hanning,
Blackmann, Kaiser - Phase delay, Group delay
■ Module:6 Realization structures for Discrete-Time Systems 7 hours
– Direct, Cascade, Parallel, Lattice and Lattice - Ladder Structures: All pass
filter - IIR tapped-cascaded structure. Parallel all pass realization of IIR
systems.

10-01-2024 Dr.S.KALAIVANI_Winter_2024 6
SYLLABUS
■ Module:7 Multirate digital signal processing 8 hours
– Introduction-Implementation of Sampling Rate Conversion: Polyphase Filter Structures
Interchange of Filters and Downsamplers / Upsamplers - Polyphase Structures for
Decimation and Interpolation Filters - Structures for Rational Sampling Rate Conversion.
Discrete Cosine Transform - Wavelet Transform
■ Module:8 Contemporary issue
■ Text Book(s)
■ 1. John G. Proakis, Dimitris G Manolakis, Digital Signal Processing: Principles, Algorithms and
Applications, 2022, 5th Edition, Pearson, USA
■ Reference Books
■ 1. A textbook of Digital Signal Processing, R.S.Kaler, M.Kulkarni, Umesh Gupta, 1st edition,
2019, Dream tech Press, Wiley, India
■ 2. James McClellan, Ronal Schaeffer, Mark Yoder, Digital Signal Processing first, 2016, 2nd
edition, Pearson, USA
■ 3. Lizhe Tan, Jean Jiang, Digital Signal Processing: Fundamentals and applications, 3rd
edition, 2018, Academic Press, USA
■ 4. S.K.Mitra, Digital Signal Processing, 2013, 4th edition, TMH, New Delhi, India
10-01-2024 Dr.S.KALAIVANI_Winter_2024 7
Mode of Evaluation:
■ Continuous Assessment Test –I (CAT-I) - 15 Marks
■ Continuous Assessment Test –II (CAT-II) -15 Marks
■ Digital Assignments/ Quiz - 30 Marks
– DIGITAL ASSIGNMENT _1 - CAT-1 PORTION
– DIGITAL ASSIGNMENT _2 - CAT-2 PORTION
– QUIZ_1 - Module 5 and 6 & 7
■ Final Assessment Test (FAT) - 40 Marks

10-01-2024 Dr.S.KALAIVANI_Winter_2024 8
Introduction
 Need for DSP: To Process real world analog signals -Analog-to-digital conversion
 Signal Processing - Operations on Signals

■ Advantages of DSP:
■ Digital circuits are less sensitive to temperature, ageing & other external parameters.
■ Digital processing is stable, reliable, flexible and repeatable.
■ Easy storage, Accuracy, Less processing cost and maintenance.
■ Covers wide range of frequencies.
■ No loading problems and Multi rate processing is possible
■ Highly suitable for processing low frequency signal also.
■ Disadvantages of DSP:
■ Pre and Post processing devices – Increases the complexity of the system
■ High power consumption
■ Frequency limitations
10-01-2024 Dr.S.KALAIVANI_Winter_2024 9
Module:1 Discrete Signals, Systems
and frequency analysis
 Review of Discrete-Time Signals & Systems and frequency
analysis
 Z- transform: ROC stability / causality analysis,
 Frequency domain sampling - Sampling rate conversion
 Aperiodic correlation estimation
 Cepstrum processing
 Band limited discrete time signals.

10-01-2024 Dr.S.KALAIVANI_Winter_2024 10
Module:1 Discrete Signals, Systems
and frequency analysis
 Review of Discrete-Time Signals & Systems and frequency
analysis
 Z- transform: ROC stability / causality analysis,
 Frequency domain sampling - Sampling rate conversion
 Aperiodic correlation estimation
 Cepstrum processing
 Band limited discrete time signals.

10-01-2024 Dr.S.KALAIVANI_Winter_2024 11
Introduction to Signals
 A Detectable physical quantity by which messages or information can be
transmitted - signal
 “A signal is a function of independent variable/s that carry some information”.

10-01-2024 Dr.S.KALAIVANI_Winter_2024 12
 REPRESENTATION OF DT SIGNALS
Graphical Representation Functional Representation
x(2)  3, x(1)  2, x(0)  0, x(1)  3, x(2)  1, x(3)  2

Tabular Representation
Sequence Representation

10-01-2024 Dr.S.KALAIVANI_Winter_2024 13
BASIC SIGNALS
1. Unit Impulse Signal
2. Unit Step Signal
3. Unit Ramp Signal
4. Sinusoidal Signal
5. Exponential Signal

10-01-2024 Dr.S.KALAIVANI_Winter_2024 14
  [n]  1 for n  0 u[n]  1 for n  0
BASIC SIGNALS 0 for n  0 0 for n  0

1. Unit Impulse Signal

2. Unit Step Signal
3. Unit Ramp Signal
4. Sinusoidal Signal
5. Exponential Signal
x[n]  A cos(n   ) x[n]  a n ; n
    2 F  2
T
r[n]  n for n  0
0 for n  0

10-01-2024 Dr.S.KALAIVANI_Winter_2024 15
 ■ CT and DT signals are further classified as,

Classification of Signals –
–
Deterministic and Random
Periodic and Non-periodic
– Causal and Non Causal
– Even and Odd
– Energy and Power

10-01-2024 Dr.S.KALAIVANI_Winter_2024 16
 Power and Energy
■ Example :
x  n

The signal x  n  is given below is energy or power signal. 3

Explain.
n
0 1 2

10-01-2024 Dr.S.KALAIVANI_Winter_2024 17
Discrete Time Even and Odd Signals
g  n  g  n g  n   g  n

g  n  g  n g  n  g  n
ge  n  go  n 
2 2

10-01-2024 Dr.S.KALAIVANI_Winter_2024 18
 Periodicity for Discrete Time Signals
■ A discrete time signal is periodic if
x(n) = x(n+N)
■ N – fundamental period
2𝜋
■𝑁= ,
𝜔
■ For satisfying the above condition the frequency
of the discrete time signal should be ratio of two
integers.
10-01-2024 Dr.S.KALAIVANI_Winter_2024 19
10-01-2024 Dr.S.KALAIVANI_Winter_2024 20
10-01-2024 Dr.S.KALAIVANI_Winter_2024 21
10-01-2024 Dr.S.KALAIVANI_Winter_2024 22
10-01-2024 Dr.S.KALAIVANI_Winter_2024 23
 Classification of Systems
• Systems process input signals to produce output signals
– Continuous/Discrete
– Linear/Non linear
– Causal/Non Causal
– Stable/Unstable
– Dynamic/Static
– Time variance/Time invariant
 Causal: a system is causal if the output at a time, only depends on input values up to that time.
 Linear: a system is linear if the output of the scaled sum of two input signals is the equivalent scaled
sum of outputs
 Time-invariance: a system is time invariant if the system’s output is the same, given the same input
signal, regardless of time.
 A system is called stable in the bounded-input bounded-output (BIBO) sense if every bounded input
sequence produces a bounded output sequence
 A system is called memoryless /Static if the output y[n] at every value of n depends only on the
present input values of n
10-01-2024 Dr.S.KALAIVANI_Winter_2024 24
Ex. Y[n]=x[-n]

10-01-2024 Dr.S.KALAIVANI_Winter_2024 25
 1.2 Basic operations on signals
■ Operations performed on dependent
variables
– Amplitude scaling, Addition, Multiplication,
differentiation
■ Operations performed on independent
variables
– Time scaling
– Reflection
– Time shifting
10-01-2024 Dr.S.KALAIVANI_Winter_2024 26
 Basic operations on signals

10-01-2024 Dr.S.KALAIVANI_Winter_2024 27
 ■ X(n+k)- Left Shift
■ X(n-k)- Right Shift
■ X(-n+k)- Right Shift
■ X(-n-k)- Left Shift

10-01-2024 Dr.S.KALAIVANI_Winter_2024 28
■ X(n+k)- Left Shift
■ X(n-k)- Right Shift
■ X(-n+k)- Right Shift
■ X(-n-k)- Left Shift

10-01-2024 Dr.S.KALAIVANI_Winter_2024 29
Precedence rule for discrete-time signal

10-01-2024 Dr.S.KALAIVANI_Winter_2024 30
Module:1 Discrete Signals, Systems
and frequency analysis
 Review of Discrete-Time Signals & Systems and frequency
analysis
 Z- transform: ROC stability / causality analysis,
 Frequency domain sampling - Sampling rate conversion
 Aperiodic correlation estimation
 Cepstrum processing
 Band limited discrete time signals.

10-01-2024 Dr.S.KALAIVANI_Winter_2024 31
z-transform Im

z = ej
*A generalization of Fourier transform

■ The z-transform of sequence x(n) is defined by Re

X ( z)   x (
n  
n ) z n

■ Give a sequence, the set of values of z for which the z-transform

converges, i.e., |X(z)|<, is called the region of convergence.

 
| X ( z ) | 
n  
x ( n) z  n   | x
n  
( n ) || z | n


ROC is centered on origin and consists of a set of rings.

10-01-2024 Dr.S.KALAIVANI_Winter_2024 32
 Stable Systems
■ A stable system requires that its Fourier transform is uniformly
convergent.
Fact: Fourier transform is to evaluate z-
transform on a unit circle.
Im
A stable system requires the ROC of z-
transform to include the unit circle.

Re

10-01-2024 Dr.S.KALAIVANI_Winter_2024 33
 Example: A right sided Sequence

For convergence of X(z), we require that

x ( n)  a u ( n)
n

 |
 1
| az 1 | 1
X ( z)   a u(n)z
n  
n n | az
n 0

 | z || a |
  a n z n 
1 z
n 0 X ( z )   (az ) 
1 n
1

 n 0 1  az za
  (az 1 ) n
| z || a |
n 0
10-01-2024 Dr.S.KALAIVANI_Winter_2024 34
 Example: A right sided Sequence ROC
for x(n)=anu(n)
z
X ( z)  , | z || a | Which one is stable?
za
Im Im

1 1
a a a a
Re Re

10-01-2024 Dr.S.KALAIVANI_Winter_2024 35
 Example: A left sided Sequence

For convergence of X(z), we require that

x(n)  a u (n  1)n

 
X ( z )    a u (n  1)z
 z|
1
n
| a 1 z | 1
n

n  
| a
1
n 0
   a n z n
n  
| z || a |

  a  n z n 
1 z
n 1 X ( z )  1   (a z )  1 
1 n
1

 n 0 1 a z z  a
 1   a n z n
n 0 | z || a |
10-01-2024 Dr.S.KALAIVANI_Winter_2024 36
 Example: A left sided Sequence ROC
for x(n)=anu( n1)
z
X ( z)  , | z || a | Which one is stable?
za
Im Im

1 1
a a a a
Re Re

10-01-2024 Dr.S.KALAIVANI_Winter_2024 37
Represent z-transform as a Rational Function

P( z ) where P(z) and Q(z) are

X ( z)  polynomials in z.
Q( z )

Zeros: The values of z’s such that X(z) = 0

Poles: The values of z’s such that X(z) = 

10-01-2024 Dr.S.KALAIVANI_Winter_2024 38
 Example: A right sided Sequence

z
x ( n)  a n u ( n) X ( z)  , | z || a |
za
Im

ROC is bounded by
the pole and is the
a
Re exterior of a circle.

10-01-2024 Dr.S.KALAIVANI_Winter_2024 39
 Example: A left sided Sequence

z
x(n)  a nu (n  1) X ( z)  , | z || a |
za
Im

ROC is bounded by
the pole and is the
a
Re interior of a circle.

10-01-2024 Dr.S.KALAIVANI_Winter_2024 40
 Example: Sum of Two Right Sided Sequences

x(n)  ( 12 ) n u (n)  ( 13 ) n u (n)

z z 2 z ( z  121 )
X ( z)   
z  2 z  13
1
( z  12 )( z  13 )

Im ROC is bounded by poles

and is the exterior of a
circle.
1/12
1/3 Re
1/2

ROC does not include any pole.

10-01-2024 Dr.S.KALAIVANI_Winter_2024 41
 Example: A Two Sided Sequence

x(n)  ( 13 ) n u(n)  ( 12 ) n u(n  1)

z z 2 z ( z  121 )
X ( z)   
z3 z2
1 1
( z  13 )( z  12 )
Im
ROC is bounded by poles
and is a ring.
1/12
1/3 Re
1/2

ROC does not include any pole.

10-01-2024 Dr.S.KALAIVANI_Winter_2024 42
 Example: A Finite Sequence
x ( n)  a n , 0  n  N 1
N 1 N 1 1 N
1  (az ) 1 zN  aN
X ( z)   a z n n
  ( az )1 n
  N 1
n 0 n 0 1  az 1 z za

ROC: 0 < z < 

Im ROC does not include any pole.
N-1 zeros

N-1 poles Always Stable

Re

10-01-2024 Dr.S.KALAIVANI_Winter_2024 43
 Properties of ROC
■ A ring or disk in the z-plane centered at the origin.
■ The Fourier Transform of x(n) is converge absolutely if the ROC
includes the unit circle.
■ The ROC cannot include any poles
■ Finite Duration Sequences: The ROC is the entire z-plane except
possibly z=0 or z=.
■ Right sided sequences: The ROC extends outward from the outermost
finite pole in X(z) to z=.
■ Left sided sequences: The ROC extends inward from the innermost
nonzero pole in X(z) to z=0.
10-01-2024 Dr.S.KALAIVANI_Winter_2024 44
Properties of z-Transform
Ex.1 Find the z-transform and ROC of the given sequence
 INVERSE Z-TRANSFORM
Partial Fraction Method

10-01-2024 Dr.S.KALAIVANI_Winter_2024 48
 Example: 2nd Order Z-Transform
1 1
Xz  ROC : z 
 1 1  1 1  2
1  z 1  z 
 4  2 

A1 A2
Xz   
 1 1   1 1 
 1  z  1  z 
 4   2 

 1 1  1
A1  1  z Xz    1
 4  1  1  1  
1
z
4  1  
 2  4  
 

 1  1
A 2  1  z 1 Xz   2
 2  1  1  1  
1
z
2  1  
 4  2  

10-01-2024 Dr.S.KALAIVANI_Winter_2024 49
 Example Continued

1 2 1
Xz    z 
 1 1   1 1  2
1  z  1  z 
 4   2 

■ ROC extends to infinity

– Indicates right sided sequence

1
a u (n) 
n
1
, | z || a
1  az
n n
1 1
xn  2  un -   un
2  4
10-01-2024 Dr.S.KALAIVANI_Winter_2024 50
 Example #2
Xz  
1  2z 1  z 2

1  z 1  
2

z 1
3 1 1 2 
1 z  z
2 2
 1 
1 1 
2
z  1  z 1  
 
*Long division to obtain Bo
 1  5z 1
Xz   2 
1 2 3 1
2  1 1 
1  z  1  z
2

1

2
z  z  1 z  2z
1
1  
2 2
z 2  3z 1  2 A1 A2
Xz  2  
1 1 1  z 1
5z 1  1 1 z
2

 1 
A1  1  z 1 Xz
 2  1
 9 
A2  1  z1 Xz z 1
8
z
2

10-01-2024 Dr.S.KALAIVANI_Winter_2024 51
 Example #2 Continued
A1 A2
Xz  2  
1 1 1  z 1
1 z
2
9 8
Xz  2   z 1
1 1 1  z 1
1 z
2
*ROC extends to infinity
Indicates right-sides sequence

n
1
xn  2 n  9  un  8u n 
2

10-01-2024 Dr.S.KALAIVANI_Winter_2024 52
Example 3: Find the signal corresponding to the z-transform

z 3
X( z ) 
2  3z 1  z  2
z 3 0.5 0.5
X(z )   
Solution: 2  3z 1  z 2 z 3  1.5z 2  0.5z zz  1z  0.5

X(z ) 0.5 3 1 1 4
 2   2 
z z z  1z  0.5 z z z  1 z  0.5

1 z z
X(z )  3    (4)
z z 1 z  0.5
1 1
or X( z )  3  z 1   4
1  z 1 1  0.5z 1
 x[n]  3[n]  [n  1]  u[n]  40.5 u[n]
n

10-01-2024 Dr.S.KALAIVANI_Winter_2024 53
 Partial Fraction Method:
Example 4: Find the signal corresponding to the z-transform

1
Y( z ) 
1  0.2z 1  0.2z 
1 1 2

Solution: z3
Y( z ) 
z  0.2 z  0.2 2
Y( z ) z2 0.25 0.75 0.1
   
z z  0.2z  0.2 z  0.2 z  0.2 z  0.22
2

0.25z 0.75z 0.1z

Y( z )   
z 1 z  0.2 z  0.2 2
1 1 0.2z 1
 0.25  0.75  0.1
1  0.2z 1
1  0.2z 1
1  0.2z 
0.2 1 2

 y[n]  0.25 0.2 u[n]  0.750.2 u[n]  0.5n0.2 u[n]

n n n
10-01-2024 Dr.S.KALAIVANI_Winter_2024 54
10-01-2024 Dr S KALAIVANI_FALL 2023 55
10-01-2024 Dr S KALAIVANI_FALL 2023 56
10-01-2024 Dr S KALAIVANI_FALL 2023 57
10-01-2024 Dr S KALAIVANI_FALL 2023 58
10-01-2024 Dr S KALAIVANI_FALL 2023 59
10-01-2024 Dr S KALAIVANI_FALL 2023 60
10-01-2024 Dr S KALAIVANI_FALL 2023 61
10-01-2024 Dr S KALAIVANI_FALL 2023 62
10-01-2024 Dr S KALAIVANI_FALL 2023 63
10-01-2024 Dr S KALAIVANI_FALL 2023 64
10-01-2024 Dr S KALAIVANI_FALL 2023 65
10-01-2024 Dr S KALAIVANI_FALL 2023 66
10-01-2024 Dr S KALAIVANI_FALL 2023 67
10-01-2024 Dr S KALAIVANI_FALL 2023 68
10-01-2024 Dr S KALAIVANI_FALL 2023 69
10-01-2024 Dr S KALAIVANI_FALL 2023 70
10-01-2024 Dr S KALAIVANI_FALL 2023 71
10-01-2024 Dr S KALAIVANI_FALL 2023 72
10-01-2024 Dr S KALAIVANI_FALL 2023 73
10-01-2024 Dr S KALAIVANI_FALL 2023 74
10-01-2024 Dr S KALAIVANI_FALL 2023 75
10-01-2024 Dr S KALAIVANI_FALL 2023 76
10-01-2024 Dr S KALAIVANI_FALL 2023 77
10-01-2024 Dr S KALAIVANI_FALL 2023 78
10-01-2024 Dr S KALAIVANI_FALL 2023 79
10-01-2024 Dr S KALAIVANI_FALL 2023 80