RAJALAKSHMI INSTITUTE OF TECHNOLOGY

Department of Electronics & Communication Engineering

Regulation-2017
EC8553-DISCRETE TIME SIGNAL PROCESSING
(Academic Year:2020-21:: ODD Semester)
III-Year/ECE-5th Semester

Welcome You ALL…

1
 R-2017
EC8553-DISCRETE TIME SIGNAL PROCESSING

Course Handling Faculties:

1. K.Senthil Kumar, Associate Professor/ECE

2. S.Sheela, Assistant Professor(SS)/ECE

3. K.Sivakumar, Assistant Professor(SS)/ECE

2
EC8553-DTSP Academic Year : 2020-21
COURSE OBJECTIVES AND OUTCOMES
CO OBJECTIVE

CO1 To introduce Discrete Fourier Transform and its applications.

To teach the design of Infinite Impulse Response Filters for filtering undesired
CO2
signals.

CO3 To teach the design of Finite Impulse Response Filters for filtering undesired signals.

CO4 To introduce the students with the concept of Fixed and Floating Point Processors

To understand the architecture and addressing modes of different processors to

CO5
develop programming skills. 3
EC8553-DTSP Academic Year : 2020-21
COURSE OBJECTIVES AND OUTCOMES
CO OUTCOME
Student can understand and compute discrete Fourier transform and convolution of
CO1
discrete signals.
Students will be able to synthesize the IIR digital filters for the desired specifications
CO2
and analyze its characteristics.
Student will able to synthesize the FIR filters and analyze its coefficient word length
CO3
effects.
Learners can analyze and evaluate different errors occur due to finite world length
CO4
effects.
Students will be able to understand the architecture and addressing modes of DSP
CO5 Processor and can develop skills in simple program writing for its applications.

Students will be able to simulate to remove the noises from 1D and 2D signals.
CO6 4
EC8553-DTSP Academic Year : 2020-21
PROGRAMME OUTCOMES(POs)
PO OUTCOME
1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering
PO1 fundamentals, and an engineering specialization to the solution of complex engineering
problems.
2. Problem analysis: Identify, formulate, review research literature, and analyze
PO2 complex engineering problems reaching substantiated conclusions using first principles
of mathematics, natural sciences, and engineering sciences.
3. Design/development of solutions: Design solutions for complex engineering
problems and design system components or processes that meet the specified needs with
PO3
appropriate consideration for the public health and safety, and the cultural, societal, and
environmental considerations.
4. Conduct investigations of complex problems: Use research-based knowledge and
PO4 research methods, including design of experiments, analysis and interpretation of 5
data,
and synthesis of the information to provide valid conclusions.
EC8553-DTSP Academic Year : 2020-21
PROGRAMME OUTCOMES(POs)
PO OUTCOME
5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and
PO5 modern engineering and IT tools including prediction and modeling to complex
engineering activities with an understanding of the limitations.
6. The engineer and society: Apply reasoning informed by the contextual knowledge to
PO6 assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.

7. Environment and Sustainability: Understand the impact of the professional

PO7 engineering solutions to societal and environmental contexts, and demonstrate the
knowledge of, and need for sustainable development.
8. Ethics: Apply ethical principles and commit to professional ethics and
PO8 6
responsibilities and norms of the engineering practice.
EC8553-DTSP Academic Year : 2020-21
PROGRAMME OUTCOMES(POs)
PO OUTCOME
9. Individual and team work: Function effectively as an individual, and as a member
PO9
or leader in diverse teams, and in multidisciplinary settings.
10. Communication: Communicate effectively on complex engineering activities with
the engineering community and with society at large, such as, being able to comprehend
PO10
and write effective reports and design documentation, make effective presentations, and
give and receive clear instructions.
11. Project management and finance: Demonstrate knowledge and understanding of
PO11 the engineering and management principles and apply these to one’s own work, as a
member and leader in a team, to manage projects and in multidisciplinary environments.

12. Lifelong learning: Recognize the need for, and have the preparation and ability to
PO12 engage in independent and lifelong learning in the broadest context of technological
7
change.
EC8553-DTSP Academic Year : 2020-21
PROGRAMME SPECIFIC OUTCOMES (PSOs)

PSO OUTCOME

To analyze, design and develop solutions by applying foundational concepts of

PSO1
electronics and communication engineering.

To apply design principles and best practices for developing quality products for
PSO2
scientific and business applications.

To adapt to emerging information and communication technologies (ICT) to

PSO3
innovate ideas and solutions to existing/novel problems.
8
EC8553-DTSP::Syllabus

9
EC8553-DTSP::Syllabus

10
 Course Nature and Prerequisites

• DTSP covers: 80% Problematic and 20% Theoretical concepts.

• Basics of signals and System and some mathematical representations

are required(LT,DTFT,ZT).

• Scientific Calculator(From Unit-1 to Unit-4).

11
 Overview

• What is DSP/DTSP?

• Converting Analog into Digital

• Electronically
• Computationally

• How Does It Work?

• Faithful Duplication
• Resolution Trade-offs

12
13
 What is DSP/DTSP?

Digital Signal Processing(DSP) or Discrete-Time signal

Processing(DTSP):

• The performance of a digital system or digital computer for any signal

operations that are changes the characteristics of the signal(Amplitude,
Shape, Frequency and Phase).

• The DSP based technology has been developed rapidly over the past 6-
decades.DSP system can perform complex signal analysis and solutions.

14
 Advantages and Limitations of DSP
• Accuracy • Requirement of fast sampling rate
• Flexibility ADCs.
• Efficiency
• Storage Capacity/Data Storage • Unnecessary power consumption.
• Repeating the Analytical Operations
• Cost Effectiveness • System complexity-Due to associate
filters in A/D and D/A.
• Speed of Operation
• Reliability
• Size Reduction
• Universal Compatibility
• Higher Bandwidth
• Time-Sharing Process 15
 Applications of DSP
• Telecommunication systems
• Image and Video Processing
• Voice and Speech Processing
• Consumer Applications
• Military and Defense Applications
• Industrial Automations
• Medicine and Biometrics
• Instrumentations and Control Applications
• Seismology-study of earthquakes and the propagation of elastic waves through the Earth.
• Geo-Physics-subject of natural science and physical properties of the Earth and quantitative
methods for their analysis.
• Nuclear Systems-contains and controls sustained nuclear chain reactions.
• And many others… 16
 INTRODUCTION
• DSP – Discrete Time Signal Processing
• Algorithmic
• Computational
• FFT, Fast Convolution
• Programming
• C, MATLAB, LabVIEW, SciLAB
• Assembly Language
• Hardware Implementation
• Digital Signal Processors
• Applications
• System Properties
• Linearity, Time Invariance, Causality, Stability, Invertible, Memory
• Transforms
• LT, CTFT, CTFS, DFS, DTFT, DFT, ZT 17
 Introduction…

Input, x(n) Output, y(n)

System with
Impulse Response h(n)

Three problems:
1. Given x(n) and h(n), find y(n). Analysis
2. Given h(n) and y(n), find x(n). Control
3. Given x(n) and y(n), find h(n). Design

18
 Introduction…
• Equivalent Description of Digital Filters

Impulse Response I/O Convolutional Block

h(n) Equation Processing

I/O Difference Pole/zero

Equation(s) Transfer Function H(z) Pattern

Filter Design
methods

Filter Design Frequency Response Block-Diagram Sample

Specifications H(ω) Realization Processing

19
 TRANSFORM AND IT’S NEED
• Transform: A mathematical operation that takes a function or sequence and maps it into another
one.
• Transforms are useful because…
• The transform of a function may give additional /hidden information about the original
function, which may not be available /obvious otherwise – frequency information from
Fourier transform.

• The transform of an equation may be easier to solve than the original equation - solving
differential equations.

• The transform of a function/sequence may require less storage, hence provide data
compression / reduction – compressed domain processing.

• An operation may be easier to apply on the transformed function, rather than the original
20
function – Convolution operation.
 TIME-FREQUENCY ANALYSIS OF FOURIER SERIES AND FOURIER
TRANSFORMS
Time
Frequency Domain
Domain
Continuous-Time Continuous & Discrete &
Fourier Series (CTFS) Periodic Aperiodic
Continuous-Time Continuous & Continuous &
Fourier Transform (CTFT) Aperiodic Periodic
Discrete & Discrete &
Discrete –Time Fourier Series (DTFS)
Periodic Aperiodic
Discrete-Time Discrete & Continuous &
Fourier Transform (DTFT) Aperiodic Periodic
Discrete & Discrete &
Discrete Fourier Transform (DFT)
Periodic Periodic21
 FOURIER SERIES AND DEFINITIONS

 The Fourier series is a mathematical tool used for analyzing periodic functions by decomposing
such a function into a weighted sum of simple sinusoidal component functions.

 A Fourier series is an expansion of a periodic function f(t) or x(t) in terms of an infinite sum
of sines and cosines. The computation of the Fourier series is based on the integral identities

22
 FOURIER ANALYSIS

A linear combination of sinc functions, where the sinc functions are weighted by the sample
values.
23
24
25
26
Animation of the additive synthesis of a square wave with an increasing number of harmonics.
The Gibbs phenomenon is visible especially when the number of harmonics is large.
27
 FOURIER SERIES AND DEFINITIONS
There are three forms of the Fourier series.
1.Sine-Cosine Form
(Trigonometric FS)

2.Amplitude-Phase Form
(Polar or Cosine FS)

3.Complex-Exponential Form
(Exponential FS)
• Example:
Approximating a Square Wave using Fourier Series expression as…….
C:\Program Files\MATLAB\R2018a\Demo-Examples\fs.m 28
 DISCRETE FOURIER TRANSFORM (DFT)
 The Discrete-Time Fourier Transform provided the frequency domain (ω) representation for
absolutely summable sequences. The transforms (DTFT and ZT) have two features in common.
1. The Transforms are defined for infinite-length sequences(ie. Numerical
computation viewpoint or from MatLab’s viewpoint)
2. They are functions of continuous variables (ω or z).

 These two features are troublesome because one has to evaluate infinite sums at uncountable
infinite frequencies.

 To compute these transforms using software(MatLab, Scilab) the sequence have to truncated
and then evaluate the expressions at finitely many points.(Evaluations approximated to the exact
calculations).

 Therefore the DTFT and the ZT are not numerically computable transforms. 29
 DISCRETE FOURIER TRANSFORM (DFT)…

Possibility of numerically computable Fourier representation for such signals?

 From the theoretical conclusion, define a periodic signal whose primary shape is that of the
finite-duration signal and then using the DFS on this periodic signal.

 In Practical, define a new transform called the Discrete Fourier Transform (DFT), which is the
primary period of the DFS.

 This DFT is the ultimate numerically computable Fourier Transform for arbitrary finite-
duration sequences.

30
 DISCRETE FOURIER TRANSFORM (DFT)…
 For Numerically computable transform,
by sampling the DTFT in the frequency domain (or the z-transform on the unit circle).

 This transform is developed by analyzing periodic sequences.

 In Fourier analysis, a periodic function (or sequence) represented by a linear combination of

harmonically related complex exponentials (which is a form of sampling). This gives us the
discrete Fourier series (DFS) representation.

 The extension of DFS to finite-duration sequences, which leads to a new transform, called
the discrete Fourier transform (DFT).

 The DFT avoids the TWO PROBLEMS mentioned and is a numerically computable
31
transform that is suitable for computer implementation.
DISCRETE FOURIER TRANSFORM PAIRS

N 1
X k    xnW
Analysis Equation kn
N
n 0

N 1
xn   
1
Synthesis Equation
N
 X
k 0
k W  kn
N

DFT
DFT-Pair
xn  X k 

32
 DISCRETE FOURIER TRANSFORM (DFT)
 The DFT provides uniformly spaced samples of the Discrete-Time Fourier Transform
(DTFT).

Discrete Fourier transform (DFT) of a discrete-time signal x[n] with finite extent n  [0, N-1]

2nk N 1 2nk
N 1 1
 X [k ]e
j j
X [k ]   x[n]e x[n] 
N N

n 0
N n 0

Twiddle factor:

331
 DISCRETE FOURIER TRANSFORM (DFT)

With these definitions, the N-point DFT may be

expressed in matrix form as,

The inverse DFT

Or

IN is an NxN identity matrix.

341
 DISCRETE FOURIER TRANSFORM (DFT)

Let N-point vector xN of the signal sequence x(n) , n = 0, 1, 2, ….(N-1) and N-point vector XN of
frequency samples and NxN matrix WN as

35
 COMPUTATIONAL COMPLEXITY

• How ever its implementation in so easy for

N 1  j 2 kn
X (k )   x(n).e for...k  0,1,..., N  1
.
N

n 0

An implementation of DFT involves TWO basic functional blocks,

1. ADDITION

2. MULTIPLICATION
 COMPUTATIONAL COMPLEXITY
DFT-Complex Function DFT-Real Function
Length of the No.of Real
Sequence (N) No.of Complex No.of Complex No.of Real ADDs
MULs
MULs (N*N) ADDs (N*N-1) 4(N*N-1)
4(N*N)
2 4 2 16 8
3 9 6 36 24
4 16 12 64 48
: : : : :
8 64 56 256 224
: : : : :
16 256 240 1024 960
: : : : :
 LIMITATIONS OF DFT

When DFTs are used to process a CT-Signal by sampling, several potential error sources
may be important

• Aliasing, Spectral Leakage and Picket Fence Effect

• Under suitable restrictions, the DFT closely approximates the spectrum of CT-signal
at a Discrete set of Frequencies.
42
INTERACTIVE, DYNAMIC VIRTUAL LAB
MULTIMEDIA
45
Thanking You

for
Your Patience…

46