Unit – I

Introduction to Digital Signal

Processing

Dr Chaitanya Duggineni
Department of ECE, GRIET

Digital Signal Processors and Architectures

1
 Discrete Time Sequences
• Consider an analog signal x(t) = A cos 2πft
• If this signal is sampled using T as sampling interval, it
yields the samples as
x(n) = x(nT) = A cos 2πfnT where n = 0, 1, 2, 3, … etc.

• As sampling frequency fs = 1/T and substituting θ for 2πfT

x(n) = A cos 2πfnT = A cos 2πfn/fs = A cos θn

Where θ = 2πfT = 2πf/fs is called as digital frequency.

Digital Signal Processors and Architectures 2

Discrete Fourier Transform (DFT) and Fast
Fourier Transform (FFT)
• DFT is used to transform a time domain sequence x(n) to a
frequency domain sequence X(k).
• The equations that relate the time domain sequence x(n)
and the corresponding frequency domain sequence X(k)
are called DFT Pair and are given by,

Digital Signal Processors and Architectures 3

Discrete Fourier Transform (DFT) and
Fast Fourier Transform (FFT)

Digital Signal Processors and Architectures 4

 Relationship between DFT and Frequency
Response

• From the above expressions, it is clear that we can use DFT to find
the frequency response of a discrete signal.
• Spacing between the elements of X(k) is given as,

Δf = fs/N = 1/NT = 1/T0

Digital Signal Processors and Architectures 5
 DFT and FFT
• Although DFT is an efficient technique of obtaining the
frequency response of a sequence, it requires more number of
complex operations like additions and multiplications.
• Thus many improvements over DFT were proposed. One such
technique is to use the periodicity property of the twiddle factor
ej2πnk/N .
• Those algorithms were called as Fast Fourier Transform
Algorithms.

Digital Signal Processors and Architectures 6

 DFT and FFT
• The following table depicts the complexity involved in the
computation using DFT algorithms.
N Direct DFT FFT based
Computation Computation
2 4 1
4 16 4
16 256 32
64 4096 192
256 65536 1024
512 5122 512/log2512
. . .
. . .
. . .

Digital Signal Processors and Architectures 7

 Linear Time-Invariant Systems
• A system which satisfies superposition theorem is called as a linear
system and a system that has same input output relation at all times is
called a Time Invariant System. Systems, which satisfy both the
properties, are called LTI systems.

• LTI systems are characterized by its impulse response or unit sample

response in time domain whereas it is characterized by the system
function in frequency domain.

Digital Signal Processors and Architectures 8

 Linear Time-Invariant Systems
• Convolution
– Convolution is an operation that relates the input/output of an LTI system
to its unit sample response.
– It is given as,

Where x(n) is the input of the system,

h(k) is the impulse response of the system,

y(n) is the output of the system.

Digital Signal Processors and Architectures 9

 Z - Transform

• Z - Transforms are used to find the frequency response of

the system.
• The Z Transform for a discrete sequence x(n) is given by,

X(z)= Σ x(n) z-n

Digital Signal Processors and Architectures 10

 System Function
• An LTI system is characterized by its system function or the transfer
function.
• The system function H(z) characterizes the system in the frequency
domain and is given as
H(z) = Y(z)/ X(z)
• The magnitude and phase of H(z) gives the frequency response of the
system.
• From the transfer function we can also get the poles and zeros of the
system by solving its numerator and denominator respectively.

Digital Signal Processors and Architectures 11