DIGITAL SIGNAL PROCESSING

(DSP-8CC09)
L T P/D C
2 1 0 3

Unit I-Introduction
Faculty: V.RAJENDRA CHARY(VRC),
Assistant Professor,ECE,SNIST
Class: III B.Tech,I Semester, ECE
 Contents
• Syllabus
• Prerequisites
• Reference Textbooks and Video Lectures
• Course Objective and Course Outcomes
• Mapping of Course Outcomes with Program Outcomes
• Unit 1

RAJENDRA CHARY 2
 SYLLABUS
UNIT-
1. INTRODUCTION
2. DISCRETE FOURIER TRANSFORM
3. FAST FOURIER TRANSFORMS
…..mid 1
4. DIGITAL IIR FILTERS
5. DIGITAL FIR FILTERS
6. MULTIRATE DIGITAL SIGNAL PROCESSING
…..mid 2
RAJENDRA CHARY 3
 UNIT-I INTRODUCTION
• Introduction to Digital Signal Processing: Discrete time signals &
sequences, Periodicity, linear shift invariant systems, stability, and
causality, Linear constant coefficient difference equations, Block
diagram representation of linear constant-coefficient difference
equations, Frequency domain representation of discrete time
signals and systems.
• Applications: Contents form the foundation for DSP.

RAJENDRA CHARY 4
 UNIT- II DISCRETE FOURIER
TRANSFORM
• Discrete Fourier series representation of periodic sequences,
Discrete-Time Fourier Transform(DTFT), Discrete Fourier
transform (DFT): Properties of DFT, Relation between Z-transform
and DFT, Convolution: Linear and circular convolutions, Overlap
add and Overlap save methods, Computation of DFT.
• Applications: Analysis of DT signals-Periodic and Aperiodic.

RAJENDRA CHARY 5
 UNIT-III FAST FOURIER TRANSFORMS

• Fast Fourier transforms (FFT) - Radix-2 decimation in time and

decimation in frequency FFT Algorithms, Inverse FFT.
• Applications: Design of spectrally efficient system such as
OFDM system.

RAJENDRA CHARY 6
 UNIT-IV DIGITAL IIR FILTERS
• ANALOG FILTER APPROXIMATIONS – Butterworth and
Chebyshev Approximations.
• IIR DIGITAL FILTERS: Design of IIR Digital filters from analog
filters-Impulse Invariance, Step invariance and Bilinear
Transformation methods, Design Examples, Analog-Digital
transformations.Basic structures of IIR systems, Transposed forms,
• Applications: Design of IIR digital filter conforming to given
specifications.

RAJENDRA CHARY 7
 UNIT-V DIGITAL FIR FILTERS
• FIR DIGITAL FILTERS:Characteristics of FIR Digital Filters,
frequency response, Design of FIR Digital Filters using Fourier
series method, Windowing Techniques-Rectangular, Triangular,
Hamming, Hanning and Bartlett’s Windows, Steps in Kaiser
windowing method, Frequency Sampling technique, Comparison
of IIR and FIR filters.Basic structures of FIR systems
• Applications: Design of FIR digital filter conforming to given
specifications.

RAJENDRA CHARY 8
 UNIT-VI MULTIRATE DIGITAL SIGNAL
PROCESSING
• Decimation, interpolation, sampling rate conversion. Introduction
to DSP Processors.
• Applications of Multirate Digital Signal processing: Design of
digital filter banks and quadrature mirror filters etc.

RAJENDRA CHARY 9
 PREREQUISITES
• Signals and Systems
• Calculus
• Linear Algebra
• Complex variables

RAJENDRA CHARY 10
REFERENCE TEXTBOOKS(R1,R2,R3)

RAJENDRA CHARY 11
 REFERENCE TEXTBOOKS
• Digital Signal Processing – Alan V. Oppenheim, Ronald W.
Schafer, PHI Ed., 2006
• Digital Signal Processing, Principles, Algorithms and Applications:
John G. Proakis, Dimitris G. Manolakis, Pearson Education /
PHI, 2007.
• Digital Signal Processing: A Modern Introduction, Ashok
Ambardar, 9th Indian Reprint, 2012, Cengage Learning.

RAJENDRA CHARY 12
 REFERENCE TEXTBOOKS
• Digital Signal Processing: Andreas Antoniou, TATA McGraw
Hill , 2006
• Digital Signal Processing: MH Hayes, Schaum’s Outlines, TATA
Mc-Graw Hill, 2007.
• DSP Primer - C. Britton Rorabaugh, Tata McGraw Hill, 2005.
• Fundamentals of Digital Signal Processing using MatLab – Robert
J. Schilling, Sandra L. Harris, Thomson, 2007
• Discrete Time Signal Processing – A.V.Oppenheim
RAJENDRA CHARY 13
 Reference Video Lectures
• A video course on Digital Signal Processing by Prof S.C.Dutta
Roy, Department of Electrical engineering,
IITD.(https://www.youtube.com/watch?v=6dFnpz_AEyA&list=
PL9567DFCA3A66F299)
• Digital Signal Processing and its applications-NPTEL, IITB
• Digital Signal Processing -NPTEL, IITM
• VLSI for Signal Processing- NPTEL, IITM

RAJENDRA CHARY 14
 Course Objective
• To develop skills for analyzing and synthesizing algorithms and
systems that process discrete time signals, with emphasis on
realization and implementation.

RAJENDRA CHARY 15
 Course Outcomes
• Distinguish between CT and DT signals and systems and understand the
growing need of DSP and study the concepts of discrete time signals and
systems.
• Represent periodic DT signals as a Fourier series; non-periodic DT signals
as a Fourier Transform and use a powerful mathematical tool called DFT.
• Compute the Fourier Transform of DT signals using the FFT algorithms.
• Realize a digital IIR filter in several forms and structures for a given
transfer function H(z)and can design IIR filter as per specifications .
• Design of digital FIR filters by several methods as per the given
specifications and can realize FIR Filter
• Understand the need and implement the multirate sampling techniques.

RAJENDRA CHARY 16
 Mapping of Course Outcomes with Program
Outcomes
CO Digital Signal Processing (8CC09) PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO9 PO 10 PO 11 PO 12 PSO 1 PSO 2 PSO 3

Distinguish between CT and DT signals and

systems and understand the growing need of
CO1 2 2 1 3 2 2
DSP and study the concepts of discrete time
signals and systems.

Represent periodic DT signals as a Fourier

series; non-periodic DT signals as a Fourier
CO2 2 2 2 1 3 2 3
Transform and use a powerful mathematical
tool called DFT

Compute the Fourier Transform of DT signals

CO3 3 2 2 2 3 3 2 3
using the FFT algorithms.

Realize a digital filter in several forms and

CO4 2 2 2 3 3 2 3
structures for a given transfer function H(z).

Distinguish IIR and FIR filters; Design each type

CO5 by several methods once the desired 2 3 2 3 3 2 3
specifications are given.

Understand the need and implement the

CO6 2 2 2 3 3 2 3
multirate sampling techniques.

CO Overall 2 2 2 2 3 3 2 3

RAJENDRA CHARY 17
 Outline Of The Unit
• Introduction to Digital Signal Processing: slide20-43 (2)
• Discrete time signals & sequences,problems: slide44-78 (2)
• Periodicity, linear shift invariant systems ,Stability and
Causality,problems: slide79-101 (2)
• Impulse response & convolution sum, step response: slide102-107(1)
• Frequency domain representation of discrete time signals and
systems,problems:slide108-113 (1)
• Linear constant coefficient difference equations and block diagram
representation,problems:slide114-141(3)

RAJENDRA CHARY 18
RAJENDRA CHARY 19
 Signal
Signal:
• Definition
• Types

RAJENDRA CHARY 20
 Definition Of Signal
• Anything that carries information can be called a Signal.
• A signal in general is a dependent variable which depends on some
independent variables(time, space, volume etc…)containing some
information.
eg. (i)ECG(Electrocardiogram)-provides information regarding health of
a person’s heart.
(ii)EEG(Electroencephalogram)-provides information about brain
activity of a person
(iii)Human voice, (iv) chirping of birds, (v)gestures (sign language)

RAJENDRA CHARY 21
One-dimensional and Multi-dimensional Signal

• One-dimensional Signal: If a signal depends on only one

independent variable, it is called a one-dimensional signal.
eg. Speech signal, AC power supply
• Multi-dimensional Signal: If a signal depends on more than one
independent variable, it is called a multi-dimensional signal.
eg. Weather report, X-rays

RAJENDRA CHARY 22
 Continuous time, Discrete time and Digital
Signals
Continuous time Signal: The signal that is defined at every instant
of time is called a continuous-time signal.
• It is denoted by x(t).
Discrete time Signal: The signal that is defined at discrete instants
of time is called a discrete-time signal.
• The discrete time signals are continuous in amplitude and discrete
in time.
• It is denoted by x(n).

RAJENDRA CHARY 23
 Continuous time, Discrete time and Digital
Signals(contd.)
• Digital Signal: The signals that are discrete in time and quantized
in amplitude are called digital signals.

RAJENDRA CHARY 24
 Signal Processing
• Signal Processing is any operation that changes the characteristics
of a signal.
• These characteristics include amplitude, shape or frequency
content of the signal.
• Thus the signal processing is concerned with representing signals
in the mathematical terms and extracting information by carrying
out algorithmic operations on the signal.

RAJENDRA CHARY 25
 Need For Signal Processing
• We need signal processing to obtain signal in more desirable form
(transformation of signal) or for interpretation and manipulation of
signals.
eg.: Noise cancellation, Multiplexing and Demultiplexing,
Amplification of signals

RAJENDRA CHARY 26
 Types Of Signal Processing
• Analog Signal Processing
• Digital Signal Processing
• Mixed Signal Processing

RAJENDRA CHARY 27
 Analog Signal Processing System(contd.)

• The system that processes an analog signal is known as Analog

Signal processing.
• Analog signal processing was used in early 1970s.

RAJENDRA CHARY 28
 Digital Signal Processing(DSP) System
• Digital signal processing provides an alternative to process an
analog signal.
• The rapid evolution of digital computing technology which
started in the 1960s marked the transition from analog to digital
signal processing.
• The block diagram of a DSP system is as shown in figure(next
slide)

RAJENDRA CHARY 29
Digital Signal Processing(DSP) System(contd.)

Here, x(t)-analog input, y(t)-analog processed output

RAJENDRA CHARY 30
17-Oct-23 31
Digital Signal Processing(DSP) System(contd.)

• The source of the input signal is from a transducer or a

communication signal.
• The input signal is applied to an anti-aliasig filter. This is a LPF
used to remove the high frequency noise and to band limit the
signal.
• The sample & hold device provides the input to the ADC and will
be required if the input signal must remain relatively constant
during the conversion of the analog signal to digital format.

RAJENDRA CHARY 32
Digital Signal Processing(DSP) System(contd.)
• The output of the sample & hold circuit serves as input to
ADC.The output of ADC is an N-bit binary number depending on
the value of analog signal at its input. The ADC input signal is
limited to a range of either 0 to +10V if unipolar and -5V to +5V if
bipolar.
• Once converted to digital form, the signal can be processed using
digital techniques.
• The DSP may be a large programmable digital computer or a
microprocessor programmed to perform the desired operations on
the input signal
RAJENDRA CHARY 33
Digital Signal Processing(DSP) System(contd.)

• The digital signal from processor is applied to the input of

DAC,the output of DAC is continuous but not smooth.The signal
contains unwanted high frequency components.
• To eliminate high frequency components,the output of DAC is
applied to a reconstruction filter.the output of reconstruction filter
is a smooth continuous signal.

RAJENDRA CHARY 34
 Mixed Signal Processing System(contd.)
• It is a combination of ASP and DSP systems.

RAJENDRA CHARY 35
(Writeup)
RAJENDRA CHARY 36
 Advantages Of DSP
• Greater accuracy: The tolerance of the circuit components used to
design the analog filter affects accuracy, whereas the DSP provides
superior control of accuracy.
• Cheaper: The realization of digital systems is cheaper than analog
systems.
• Ease of data storage: Digital signals can be easily stored on magnetic
media without loss of fidelity and can be processed offline in a remote
laboratory.
• Applicability of VLF signals: The very low frequency signals such as
those occuring in seismic application can be easily processed using a
digital signal processor.
RAJENDRA CHARY 37
 Advantages Of DSP(contd.)
• Implementation of sophisticated algorithms: The DSP allows to
implement sophisticated algorithms when compared to its analog
counterpart.
• Flexibility in configuration: A DSP system can be easily
reconfigured by changing the program. Reconfiguration of an
analog system involves redesign of system hardware.
• Time sharing: DSP allows the sharing of a given processor among
a number of signals by time sharing and reduces the cost of
processing a signal.

RAJENDRA CHARY 38
 Limitations Of DSP
• Power consumption: The DSP chip consists of over 4 lakh
transistors, which will yield to dissipate high power (1 Watt),
whereas the analog signal processing includes only passive circuit
elements like resistors, capacitors and inductors, which will leads
to only low power dissipation.
• System complexity: System complexity increases in DSP because
of usage of A/D and D/A converters and their associated filters.

RAJENDRA CHARY 39
 Limitations Of DSP(contd.)
• Bandwidth limited by Sampling rate: Band-limited signals can
be sampled without information loss if the sampling rate is more
than twice the bandwidth. Therefore, signals having extremely
wide bandwidths require fast sampling rate A/D converters and fast
digital signal processors, but there is a practical limitation in the
speed of operation of A/D converters and digital signal processors.

RAJENDRA CHARY 40
 Limitations Of DSP(contd.)
• Processing of signals beyond higher frequencies (beyond GHz) and
below lower frequencies (a few Hz) involves limitations.

• Information is lost because we only take samples of the signal at

intervals .

• Speed is limited due to A/D and D/A Converters.

• Frequency range of operation is limited due to sampling.

RAJENDRA CHARY 41
 Applications Of DSP
• Telecommunication: Echo cancellation in telephone networks,
telephone dialing application, modems, line repeaters, channel
multiplexing, data encryption, video conferencing, cellular phones,
FAX
• Image Processing: Image compression, image enhancement, image
analysis and recognition
• Speech Processing: Automatic speech recognition, speaker
verification and speaker identification, speech synthesis techniques.
• Consumer electronics: Digital audio/TV, electronic music
synthesizer, FM stereo applications, Sound recording applications.
RAJENDRA CHARY 42
 Applications Of DSP(contd.)
• Instrumentation and Control: Digital filter, PLL, spectrum
analysis, servo control, robot control, process control
• Medicine: Computerized Tomography(CT), X-ray scanning,
Magnetic resonance imaging, spectrum analysis of ECG and EEG
signals, patient monitoring
• Seismology: Geophysical exploration for oil and gas, detection of
underground nuclear explosion and earthquake monitoring.
• Military: Radar signal processing, sonar signal processing,
navigation, secure communication.
RAJENDRA CHARY 43
 Representation of Discrete-time Signals
• Graphical representation
• Functional representation
• Tabular representation
• Sequence representation

RAJENDRA CHARY 44
 Graphical Representation
• Consider a sequence x(n) with values:
x(-2)=-3, x(-1)=2, x(0)=0, x(1)=3, x(2)=1 and x(3)=2.The discrete-
time signal can be represented using graphical representation as:

RAJENDRA CHARY 45
 Functional Representation
• Consider a sequence x(n) with values:
x(-2)=-3, x(-1)=2, x(0)=0, x(1)=3, x(2)=1 and x(3)=2 .The discrete-
time sequence is represented using functional representation as:

RAJENDRA CHARY 46
 Tabular Representation
•Consider a sequence x(n) with values:
x(-2)=-3, x(-1)=2, x(0)=0, x(1)=3, x(2)=1 and x(3)=2.The discrete-
time signal can be represented using tabular representation as:

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

RAJENDRA CHARY 47
 Sequence Representation
• Consider a sequence x(n) with values:
x(-2)=-3, x(-1)=2, x(0)=0, x(1)=3,x(2)=1 and x(3)=2. The discrete-
time signal can be represented using sequence representation as:

• The arrow mark ↑ indicates n=0 term, when no arrow mark is

indicated, the first term corresponds to n=0.
RAJENDRA CHARY 48
 Elementary Discrete-time Signals
• Unit Step sequence
• Unit Ramp sequence
• Unit Impulse/Sample sequence
• Parabolic sequence
• Exponential sequence
• Sinusoidal sequence

RAJENDRA CHARY 49
Elementary Discrete-time Signals(contd.)
• Unit Step Sequence:

• Unit Ramp Sequence:

RAJENDRA CHARY 50
Elementary Discrete-time Signals(contd.)
• Unit Impulse/Sample Sequence:

• The unit impulse in terms of unit step sequence can be written as:

RAJENDRA CHARY 51
Elementary Discrete-time Signals(contd.)
• Parabolic Sequence:

• In terms of unit step function, it can be written as:

RAJENDRA CHARY 52
Elementary Discrete-time Signals(contd.)
• Exponential Sequence:

RAJENDRA CHARY 53
Elementary Discrete-time Signals(contd.)
• Sinusoidal Sequence:

RAJENDRA CHARY 54
 Operation on Signals
• Time shifting
• Time reversal
• Time scaling
• Amplitude scaling
• Scalar multiplication
• Signal multiplier
• Signal addition

RAJENDRA CHARY 55
 Time Shifting
• The time shifting operation of a discrete-time signal x(n) can be
represented by: y(n)=x(n-k)
• If k is positive, it is delay and the shift is to right.
• If k is negative, it is advance and shift is to left.

RAJENDRA CHARY 56
 Time Reversal/Folding
• The time reversal of a discrete-time signal x(n) can be obtained by
folding the sequence about n=0.
• It is represented by x(-n).

RAJENDRA CHARY 57
 Time Scaling
• The time scaling operation can be expressed as: y(n)=x(an)
a>1-time compression,a<1-time expansion

RAJENDRA CHARY 58
 Amplitude Scaling
• The amplitude scaling of a discrete time signal can be represented
by: y(n)=ax(n) here a=constant, a>1-amplification,a<1-attenuation

RAJENDRA CHARY 59
 Scalar Multiplication
• Here the signal x(n) is multiplied by a scaling factor ‘a’.
eg. Let x(n)={1,2,1,-1},a=2
Then y(n)=ax(n)={2,4,2,-2}
• This is similar to amplitude scaling.

RAJENDRA CHARY 60
 Signal Multiplier
• The signal multiplier can be represented by:

Let x1(n)={-1,2,-3,-2} and x2(n)={1,-1,-2,1}

Then,
y(n)= x1(n).x2(n)={-1.1,2.-1,-3.-2,-2.1}
={-1,-2,6,-2}

RAJENDRA CHARY 61
 Signal Addition
• The signal addition can be represented by:

Let x1(n)={1,2,3,4}
x2(n)={5,6,7,8}
Then,
y(n)= x1(n)+x2(n)={ 1+5,2+6,3+7,4+8}
={6,8,10,12}

RAJENDRA CHARY 62
 Classification Of Discrete-time Signals
• Energy and Power Signals
• Periodic and Aperiodic Signals
• Even and Odd Signals
• Causal and Non-causal Signals
• Deterministic and Random Signals

RAJENDRA CHARY 63
 Energy and Power Signals
• For a discrete-time signal x(n),the energy Ex is given by:

• For a discrete-time signal x(n), the average power Px is given by:

RAJENDRA CHARY 64
 Energy and Power Signals(contd.)
• The average power Pavg of a periodic sequence with period N is
given by:

If E is finite, [0 ≤ E < ꝏ ] and P = 0 then x(n) is called an energy

signal

If E is infinite and P is finite and nonzero, then x(n) is called a

power signal.
RAJENDRA CHARY 65
 Periodic and Aperiodic Signals
• A discrete-time signal x(n) is said to be periodic with period N if
and only if: x(n + N)=x(n) , n
The smallest value of N which satisfies the above equation is
known as fundamental period.
• If the above equation is not satisfied even for one value of n, then
the discrete-time signal is known as Aperiodic signal.
• Sometimes Aperiodic signals are said to have a period equal to
infinite.
• The fundamental period is given by 2π/ω.

RAJENDRA CHARY 66
 Even and Odd Signals
• A discrete-time signal x(n) is said to be even signal if it satisfies
the condition: x(n)=x(-n) for all n
• Even signals are also called symmetric signals since they are
symmetric about time origin.
• A discrete-time signal x(n) is said to be odd signal if it satisfies the
condition: x(-n)=-x(n) for all n
• Odd signals are also called anti-symmetric signals since they are
anti symmetric about vertical axis..

RAJENDRA CHARY 67
 Even and Odd Signals(contd.)
• Every signal need not be either purely even or purely odd but can
be composed into sum of even and odd parts which are given by:

RAJENDRA CHARY 68
 Causal and Non-Causal Signals
• A discrete-time signal is said to be causal if x(n)=0 for
n<0,otherwise the signal is non-causal.

RAJENDRA CHARY 69
 Deterministic and Random Signals
• A signal exhibiting no uncertainity of its magnitude and phase at
any instant of time is called deterministic signal
• A deterministic signal can be completely represented by
mathematical equation at any time and its nature and amplitude at
any time can be predicted.
eg. Sinusoidal sequence,exponential sequence,ramp sequence

RAJENDRA CHARY 70
Deterministic and Random Signals(contd.)
• A signal characterized by uncertainity about its occurrence is called
a non-deterministic or random signal.
• A random signal cannot be represented by any mathematical
equation.
eg. Thermal noise

RAJENDRA CHARY 71
(Discussion on lecture-2 followed
by problems)
RAJENDRA CHARY 72
 Problems
• Find the even and odd part of the following signals. (R2 eg 1.11)

• Determine the even and odd part of the following signals.

(R3eg2.5)

RAJENDRA CHARY 73
RAJENDRA CHARY 74
 Problems
• Determine the values of power & energy, check whether the
following signals are energy or power signals: (R1 eg 1.4)

• Find which of the following signals are energy signals, power

signals, neither energy nor power signals. (R2 eg1.8)

RAJENDRA CHARY 75
 Problems
• Determine whether the following signals are energy or power
signals (R3 eg2.6)

• Determine whether the following discrete-time signals are periodic

or not, determine the fundamental period (R2 eg 1.7)

RAJENDRA CHARY 76
 Problems
• Determine whether the following signals are periodic or not. If
periodic find the fundamental period.
(R3 eg2.4)

• Determine whether or not each of the following signals is periodic.

If periodic, specify its fundamental period. (R1 eg1.5)

RAJENDRA CHARY 77
 Problem
• Find which of the following signals are causal or non-causal
a) x(n)=u(n+4)-u(n-2)
b) x(n)=(1/2)n u(n+2)-(1/2)nu(n-4)
c) x(n)=u(-n)
d) x(n)=u(n) (R2 eg1.10)

RAJENDRA CHARY 78
RAJENDRA CHARY 79
 System
• A system is defined as an entity that acts on an input signal and
transforms it into an output signal.
• It is cause and effect relation between two or more signals.
• Systems are broadly classified into continuous time and discrete
time systems.

RAJENDRA CHARY 80
 Continuous-time System & Discrete-time
System
Continuous-time System: A continuous-time system is one which
transforms continuous-time input signals into continuous-time
output signals.
eg. Amplifiers, filters, integrators, differentiators
Discrete-time System: A discrete-time system is one which
transforms discrete-time input signals into discrete-time output
signals.
eg. Microprocessors, shift registers, semiconductor memories

RAJENDRA CHARY 81
 Classification of Discrete-time Systems
• Linear and Non-linear systems
• Time variant and Time invariant systems
• Linear time variant and Linear time invariant systems
• Causal and Non-causal systems
• Static/memoryless and Dynamic/memory systems
• Stable and Unstable systems
• FIR and IIR systems
• Invertible and non invertible systems

RAJENDRA CHARY 82
 Linear and Non-Linear Systems
• A system which obeys the principle of superposition and
homogenity is called a linear system and a system which does not
obey the principle of superposition and homogenity is called a
non-linear system.
• Mathematically, a system is said to be linear if and only if:
T[a1x1(n)+a2x2(n)]=a1T[x1(n)]+a2T[x2(n)]

RAJENDRA CHARY 83
 Linear and Non-Linear Systems(contd.)
• Superposition principle: A system which produces an output
y1(n) for an input x1(n) and output y2(n) for an input x2(n) must
produce an output y1(n) + y2(n) for an input x1(n) + x2(n) .

• Homogenity principle: A system which produces an output y(n)

for an input x(n) must produce an output ay(n) for an input ax(n)

RAJENDRA CHARY 84
Time variant and Time invariant Systems
• A system is said to be Time or Shift Invariant System if input-
output characteristics doesnot change with time.
• The condition for time-invariance is:
y(n,k)=y(n-k),where y(n,k)=T[x(n-k)] i.e. delayed output is equal to
the output due to delayed input for all values of k.
• A system is said to be Time or shift variant System if input-
output characteristics changes with time.
• The condition for time-variance is:
y(n,k) ≠ y(n-k),where y(n,k)=T[x(n-k)] i.e. delayed output is not
equal to the output due to delayed input for all values of k
RAJENDRA CHARY 85
Linear time variant and Linear time invariant
Systems
• The systems satisfying both linearity and time-invariance are
called Linear time invariant systems or simply LTI systems.
• The systems satisfying both linearity and time-variance are
called Linear time variant(LTV) systems.

RAJENDRA CHARY 86
Linear time variant and Linear time invariant
Systems(contd.)
• Interconnection of LTI Systems:
1)Parallel connection
2)Cascade connection

RAJENDRA CHARY 87
 Parallel Connection
• Consider two LTI systems with impulse responses h1(n) and h2(n)
connected in parallel as shown in figure:

• In this case, the overall impulse response is equal to sum of two

impulse responses.
RAJENDRA CHARY 88
 Cascade Connection
• Consider two LTI systems with impulse responses h1(n) and h2(n)
connected in cascade as shown in figure:

• In this case, the overall impulse response is equal to convolution of

two impulse responses
RAJENDRA CHARY 89
 Causal and Non-causal Systems
• A system is said to be causal or non-anticipative if the output of
the system at any instant n depends only on present and past
values of input but not on future inputs.
• The causal systems are real time systems which are physically
realizable.
• The impulse response of a causal system is zero for n <0
i.e h(n)=0,for n <0

RAJENDRA CHARY 90
 Causal and Non-causal Systems(contd.)
• A system is said to be non-causal or anticipative if the output of
the system at any instant n depends on future inputs.
• Non-causal systems produce an output even before the input is
given.
• They do not exist in real time and are not physically realizable.

RAJENDRA CHARY 91
 Static and Dynamic Systems
• A system is said to be static or memoryless system if the response
is due to present input alone.
• A system is said to be dynamic or memory system if the response
depends upon past or future inputs or past outputs.

RAJENDRA CHARY 92
 Stable and Unstable Systems
• An LTI system is said to be stable if it produces a bounded output
sequence for every bounded input sequence.
• If, for some bounded input sequence x(n),the output is
unbounded(infinite),then the system is said to be Unstable system.

RAJENDRA CHARY 93
 BIBO stability criterion
• The necessary and sufficient condition for a discrete-time system
to be BIBO stable is given by:

∑ |h(n)| <∞
Where h(n) is impulse response, summation limits are from n=-∞ to
+∞

RAJENDRA CHARY 94
 FIR and IIR Systems
• If the impulse response of the system is of finite duration, then
the system is called FIR system.
• If the impulse response of the system is of infinite duration, then
the system is called IIR system.

RAJENDRA CHARY 95
 Invertible and Non-Invertible Systems
• A system is said to be invertible system only if an inverse system
exists which when cascaded with the original system produces an
output equal to the input of the first system. A system which does
not satisfy this criterion is called non-invertible system.

RAJENDRA CHARY 96
 Problems
• Determine whether the following systems are causal or non-causal:
a)y(n)=x(n)+x(n-2) b)y(n)=x(2n)
c)y(n)=sin[x(n)] d)y(n)=x(-n) (R2 eg 1.13)
• Determine whether the following systems are causal or non-causal
a)y(n)=x(n)+1/x(n-1), b) y(n)=x(n2) (R1 eg 1.7)
• Find whether the following systems are static or dynamic
a)y(n)=x(n)x(n-1), b)y(n)=x2(n)+x(n), c)y(n)=x(n+2)
d)y(n)= x2(n), e)y(n)=x(n+2)+x(n) (R1 eg 1.6,R2 eg1.12)
RAJENDRA CHARY 97
 Problems
• Test the stability of the system whose impulse response is given by
h(n)=(1/2)nu(n) (R1 eg.1.11)
• Check the stability of the system defined by: (R2 eg1.18)

RAJENDRA CHARY 98
RAJENDRA CHARY 99
 Problems
• Check whether the following systems are linear or not:
a)y(n)=x2(n) b)y(n)=nx(n) c)y(n)=n2x(n)
d)y(n)=x(n)+1/(x(n-1)) (R1 eg1.8, R2 eg1.14)
• Check whether the following systems are time-invariant or not:
a)y(n)=x(n) b)x(n/2) c)y(n)=x2(n-2) d)y(n)=x(n)+nx(n-2)
e)y(n)=x(-n) f)y(n)=x(n)+x(n-1) (R1 eg1.9, R2 eg1.15)

RAJENDRA CHARY 100

 Problems
• Check whether the following systems are linear shift-invariant
systems or not (R2 eg1.16)
a) y(n)=x(n/2)
b) y(n)=x(n)+x(n-2), for n ≥ 0
=0 ,for n <0

RAJENDRA CHARY 101

 Impulse Response & Convolution Sum
• In general, any system is represented by:

x(n) y(n)=T[x(n)]
• If the input to the system is a unit impulse,i.e x(n)=δ(n),then the
output of the system is known as impulse response denoted by h(n)
where h(n)=T[δ(n)].
• The system has zero initial conditions.

RAJENDRA CHARY 102

 Impulse Response & Convolution Sum(contd.)
• We know that, any arbitrary sequence x(n) can be represented as a
weighted sum of discrete impulses as:

• So the system response y(n) is given by:

• For a linear system ,the above equation reduces to

RAJENDRA CHARY 103

 Impulse Response & Convolution Sum(contd.)
• The response due to shifted impulse response δ(n-k) can be
denoted by h(n,k). i.e h(n,k)=T[δ(n-k)]
• For a shift-invariant system,
delayed output= output due to delayed input
i.e h(n-k) = h(n,k)
Therefore T[h(n-k)] = h(n,k)
Therefore the equation for y(n) reduces to

RAJENDRA CHARY 104

 Impulse Response & Convolution Sum(contd.)

• So we can conclude that for a LTI system, if the input sequence

x(n) and impulse response h(n) are given, the output sequence y(n)
can be found using the equation:

• This is known as convolution sum and is represented as:

y(n)=x(n)*h(n)=h(n)*x(n)

RAJENDRA CHARY 105

 Step Response
• The step response can be easily expressed in terms of the impulse
response using convolution sum.
• Let a discrete time system have impulse response h(n) and denote
step response as s(n).
• Then, s(n)= h(n) * u(n)
=

RAJENDRA CHARY 106

 Step Response(contd.)
Since u(n-k)=0 for k > n and u(n-k)=1 for k ≤ n , we have

i.e The step response is the running sum of impulse response.

• For a causal system,

RAJENDRA CHARY 107

Frequency Response of discrete time System
• The frequency response gives the gain and phase response of the
system to the input sinusoids at all frequencies.
• The frequency response of LTI discrete time system can be
obtained by applying a spectrum of input sinusoids to the system.
• Let h(n) be the impulse response of LTI discrete time system and
let the input x(n) to the system be a complex exponential ejωn
• The output of the system y(n) can be obtained by using
convolution sum as:

RAJENDRA CHARY 108

Frequency Response of discrete time
System(contd.)

RAJENDRA CHARY 109

 Frequency Response of discrete time
System(contd.)
• The frequency response H(ω) is complex and can be expressed in
polar form as:

Where |H(ω)|- magnitude response, H(ω) -phase response

• The plot of |H(ω)| v/s ω is called magnitude response plot and
the plot of H(ω) v/s ω is called phase response plot.

RAJENDRA CHARY 110

 Properties of Frequency Response
• H(ω) takes values for all ω.
• H(ω) is periodic in ω with period 2π.
• The magnitude response is an even function of ω and symmetrical
about π.
• The phase response is an odd function of ω and anti-symmetrical
about π.

RAJENDRA CHARY 111

 Problems
• Write a difference equation that characterizes a system whose
frequency response is
(R2 eg 5.15)

• Find the frequency response of the following causal systems

(R2 eg 5.16)

RAJENDRA CHARY 112

 Problems
• A discrete time system is given by the following difference
equation:y(n)-5y(n-1)=x(n)+4x(n-1),where x(n) is the input and y(n)
is the output.Determine its magnitude and phase response.
(R2 eg5.17)
• Determine and sketch the magnitude and phase response of
y(n)=1/2[x(n)+x(n-2)] (R1 eg1.35)
• A discrete time system has a unit sample response h(n) given by:
h(n)=(1/2)δ(n)+δ(n-1)+(1/2)δ(n-2).Find the system response H(ejω).Plot
the magnitude and phase response. (R1 eg1.36)

RAJENDRA CHARY 113

RAJENDRA CHARY 114
 Time Response Analysis of Discrete-time
Systems
• There are 2 methods for analyzing the time response of a discrete-
time system viz..
(i) Input signal is resolved into sum of impulses and then response of
system to elementary signal is added to obtain total response i.e.
y(n)= x(n) * h(n)
(ii)Difference equation

RAJENDRA CHARY 115

 Linear Constant Coefficient Difference
Equations(LCCDE)
• The general form of difference equation of an Nth order LTI discrete-
time system is:
ak, bk are constants

• The difference equation of Nth order discrete time system can also be
written as:

Where N is called the order of the difference equation. If the coefficient

a0 ≠ 1,we can divide above equation throughout by a0 to normalize the
equation. RAJENDRA CHARY 116
 Linear Constant Coefficient Difference
Equations(LCCDE)(contd.)
• The response of any discrete-time system can be decomposed as:
Total response=zero state response + zero input response
• Zero state response/forced response: The zero state response is
the response of the system due to input alone when the initial state
of the system is zero.
• Zero input response/natural response: It is the response which
depends only on initial state of the system.(i.e input is zero)

RAJENDRA CHARY 117

 Linear Constant Coefficient Difference
Equations (contd.)
eg. Consider a first order discrete-time system with difference
equation
y(n)=ay(n-1)+x(n)
Where x(n)=input, y(n)=output
• Let the input sequence x(n) be zero for n<0 and the initial
condition of y(n) for n=-1 exists i.e y(-1) ≠ 0.

RAJENDRA CHARY 118

 Linear Constant Coefficient Difference
Equations (contd.)
• The successive values of y(n) for n ≥ 0 are as follows:

RAJENDRA CHARY 119

 Linear Constant Coefficient Difference
Equations (contd.)
• The response y(n) includes two parts.
• The first part depends on the initial condition of the system and the
second term depends on the input.
• When y(-1)=0,the output y(n) depends only on the input applied.
Hence y(n) is known as zero state response or forced response of
the system given by:

RAJENDRA CHARY 120

 Linear Constant Coefficient Difference
Equations (contd.)
• If the system is initially non relaxed i.e y(-1) ≠0 and the input
x(n)=0 for all n, the output of the system depends only on the
initial state of the system. Then the response of the system is called
the zero input response or natural response and is given by:

RAJENDRA CHARY 121

 Linear Constant Coefficient Difference
Equations(LCCDE) (contd.)
• The solution of the difference equation can be expressed as sum of
two parts given by:
y(n)=yh(n)+yp(n)
yh(n)-homogenous or complimentary solution
yp(n)-particular solution

RAJENDRA CHARY 122

 LCCDE-Natural Response(zero input
response)
• The natural response yn(n) is the solution of Nth order difference
equation with x(n)=0.
We get,
-------(1)
The solution to above equation is of the form yh(n)= λn ----(2)
Substituting equ(2) in equ(1),we get

RAJENDRA CHARY 123

 LCCDE-Natural Response(zero input
response) (contd.)
λn + a1 λn-1 +……+ aN-1 λn-N+1 + aNλn-N =0
λn-N[λN+ a1 λN-1 +……+ aN-1 λ + aNλ ]=0
λN+ a1 λN-1 +……+ aN-1 λ + aNλ =0
• The polynomial of above equation is called the characteristic
equation of the system.
• The Nth order characteristic equation can be expressed in the factorized
form assuming all roots are distinct as:
(λ- λ1) (λ- λ2) (λ- λ3)….. (λ- λN)=0
Where λ1, λ2 ,.. λN are called roots of characteristic equation

RAJENDRA CHARY 124

 LCCDE-Natural Response(zero input
response) (contd.)
• Distinct roots:
If the roots λ1, λ2 ,.. λN are distinct, then it has N solutions C1λ1n,
C2λ2n,……..,. CNλNn, then the general solution is of the form:
yh(n)=C1 λ1n + C2 λ2n +……+ CN λNn
Where C1,C2,…,CN are constants, these are determined by applying
initial conditions
For eg. If roots are λ1 =2 and λ2 =3,then yh(n)=C1(2)n + C2 (3)n

RAJENDRA CHARY 125

 LCCDE-Natural Response(zero input
response) (contd.)
• Repeated roots: If the roots λ1 is repeated m times and remaining
(N-m) roots are distinct, then the characteristic equation of the
system is: (λ- λ1)m (λ- λm+1) (λ- λm+2)….. (λ- λN)=0
• The general solution is:
yh(n)=(C1+C2n+C3n2+….+Cmnm-1)(λ1)n+Cm+1(λm+1)n+
Cm+2(λm+2)n+…..+CN λN
For eg., if the roots of the characteristic equation are λ1 =-2, λ2 =-2, λ3
=2 ,then the solution is
yh(n)=[C1+C2n](-2)n +C3(2)n
RAJENDRA CHARY 126
 LCCDE-Natural Response(zero input
response) (contd.)
• Complex roots:
If the roots are complex, then we can write
λ1 = λ = a+jb λ2 = λ *= a-jb
Then the homogenous solution is of the form
yh(n)=rn[A1cos nθ+A2 sin nθ]
Where A1, A2 are constants

RAJENDRA CHARY 127

LCCDE-Forced response(zero state response)

• The forced response is the solution of the difference equation for

the given input when the initial conditions are zero. It consists of
two parts-homogenous solution and particular solution.
• The homogenous solution can be obtained from the roots of
characteristic equation.
• The particular solution yp(n) is a solution satisfying:

RAJENDRA CHARY 128

LCCDE-Forced response(zero state response)
(contd.)
• If the input applied to the system and one of the components of the
homogenous solution are same, then multiply the particular
solution by lower power of n that will give a response component
not included in the homogenous solution.
• For example, if the homogenous solution contain the term C1(λ1)n
and the input is x(n)= (λ1)n then we assume a particular solution of
the form yp(n)=C2n(λ1)n .

RAJENDRA CHARY 129

 LCCDE-Forced response (contd.)
• The forced response of the system is obtained by summing the
particular solution and homogenous solution and finding the
coefficients in the homogenous solution so that the combined response
yh(n)+yp(n) satisfies the zero initial conditions.
• General form of particular solution for type of input:

RAJENDRA CHARY 130

 LCCDE-Total Response
• The total response is obtained by adding the natural response and
forced response
y(n)=yn(n)+yf(n)
• If there is no need to find the forced response and natural response
separately, the total response can be found in the same way as
forced response, by using the actual initial conditions instead of
zero initial conditions.

RAJENDRA CHARY 131

 Problems
• Find the natural response of the system described by difference
equation y(n)+2y(n-1)+y(n-2)=x(n)+x(n-1) with initial conditions
y(-1)=y(-2)=1 (R1 eg.1.20)
• Find the natural response of the system described by difference
equation y(n)+4y(n-1)+4y(n-2)=x(n)+x(n-1) with initial conditions
y(-1)=y(-2)=1 (R1 practice problem1.13)

RAJENDRA CHARY 132

RAJENDRA CHARY 133
 Problems
• Find the forced response of the system described by the difference
equation y(n)+2y(n-1)+y(n-2)=x(n)+x(n-1) for the input
x(n)=(1/2)n u(n) (R1 eg1.21)
• Find the forced response of the system described by the difference
equation y(n)-4y(n-1)+4y(n-2)=x(n)-x(n-1) for the input x(n)=(-1)n
u(n) (R1 practice problem1.14)

RAJENDRA CHARY 134

 Problems
• Find the response of the system described by the difference
equation y(n)+2y(n-1)+y(n-2)=x(n)+x(n-1) for the input
x(n)=(1/2)n u(n) with initial conditions y(-1)=y(-2)=1 (R1 eg1.22)
• Find the response of the system described by the difference
equation y(n)-4y(n-1)+4y(n-2)=x(n)-x(n-1) for the input x(n)=(-1)n
u(n) with initial conditions y(-1)=y(-2)=1(R1 practice
problem1.15)

RAJENDRA CHARY 135

 Problem
• A linear shift invariant system is described by the difference
equation

with y(-1)=0,y(-2)=-1.Find a)natural response of the system b)forced

response of the system for step input c)frequency response of the
system.(R2 eg3.61)

RAJENDRA CHARY 136

 Problem
• Determine the free response(natural response) of the system
described by (R2 eg3.62)

RAJENDRA CHARY 137

RAJENDRA CHARY 138
Block diagram representation of Linear Constant-
coefficient Difference Equations(LCCDE)
• To realize a discrete-time system, the given difference equation in
time domain is to be converted into an algebraic equation in z-
domain and each term of that equation is to be represented by a
suitable element.
• The symbols of the basic elements used for constructing the block
diagram of a discrete time system are tabulated below

(contd..in next slide)

RAJENDRA CHARY 139

Block diagram representation of LCCDE
(contd.)

RAJENDRA CHARY 140

 Problems
• Construct the block diagram for the discrete-time systems whose
input-output relations are described by the following difference
equations: a)y(n)=0.7x(n)+0.3x(n-1)
b)y(n)=0.5y(n-1)+0.8x(n)+0.4x(n-1) (R2 eg4.1)
• Construct a block diagram of the discrete time systems whose
input-output relations are described by the following difference
equations.
a)y(n)=0.7x(n)+0.7x(n-1) b)y(n)=0.4y(n-1)+x(n)-3x(n-2)
c)y(n)=0.2y(n-1)+0.7x(n)+0.9x(n-1) (R3 eg2.7)
RAJENDRA CHARY 141
 Application
• Contents form the foundation for DSP.

RAJENDRA CHARY 142

 Lecture Plan
Lecture no. Date&period no. Lecture no. Date&period no.
1 13/09/2023,P-3 7 07/10/2023,P-1
2 20/09/2023,P-3 8 07/10/2023,P-2
3 23/09/2023,P-1 9 11/10/2023,P-3
4 23/09/2023,P-2 10 17/10/2023,P-6
5 27/09/2023,P-3 11 19/10/2023,P-4
6 04/10/2023,P-3

RAJENDRA CHARY 143

 Online Assignment Links
• 1.1-
https://docs.google.com/forms/d/16M1Te9AovF__C7b6NJkGZy5
GKZOZ6_MbCttMvsMHadk/edit
• 1.2-
https://docs.google.com/forms/d/1oZ1XQ18GQ75MCLw0SeOuG
NMZSmQ9t7a93Ksato5N3Ak/edit
• 1.3-
https://docs.google.com/forms/d/1PqcAIlS-
RYSm6ppUw7tnNIe9jiSv6lm-Qoz-eED1mP4/edit
RAJENDRA CHARY 144
RAJENDRA CHARY 145
 Previous Year Problems(A20 Reg Jan2023)

• What is the difference between analog signal and discrete time

signal?
• a)Explain various operations on discrete time signals.
b)Classify various types of discrete time systems.
• Classify various type of discrete time signals.

RAJENDRA CHARY 146

 Previous Year Problems(A18 Reg July2022)

• a)Explain the following terms with examples i)time shifting,ii)time

scaling,iii)amplitude scaling,iv)amplitude scaling,v)signal addition
b)How are discrete time signals classified?Differentiate between
them.

RAJENDRA CHARY 147

 Previous Year Problems(A18 Reg Aug2021)

• a)Define an LTI System and show that the output of an LTI system
is given by the convolution of input sequence and impulse
response of the system.
b)Check the following systems for time invariance, linearity,
stability and causality. (i) y[n] = (n-1) x[n+1]
(ii) y[n] = x[n-2]

RAJENDRA CHARY 148

 Previous Year Problems(A17 Supply Feb
2022)
• a)Identify whether the system y[n]=log10|x[n]| is (i) Linear (ii)
Causal (iii) Time Invariant (iv)Static .
b)Determine the impulse response of the system described by the
difference equation y[n]=0.7y[n-1]-0.1y[n-2]+2x[n]-x[n-2].

RAJENDRA CHARY 149

 Previous Year Problems
• Determine the following system y[n] = x[-n] is time variant or time-
invariant. (A17 Reg Dec 2019)
• What is linear constant coefficient difference equation? Explain in
detail how to obtain the total solution. (A14 Supply Nov2017)
• a)Find whether the following systems are Causal and Linear. i) y(n) =
x(2n) ii) y(n) = n2x(n) iii) y(n) = x(-n)
b)Determine the impulse response of a system described by the difference
equation.
y(n) + y(n-1) – 2y(n-2) = x(n-1) + 2x(n-2) (A14 Supply Nov2017)

RAJENDRA CHARY 150

Gate-2017

RAJENDRA CHARY 151

Gate-2017

RAJENDRA CHARY 152

Gate-2015

RAJENDRA CHARY 153

Gate-2014

RAJENDRA CHARY 154

Gate-2013

RAJENDRA CHARY 155

Gate-2013

RAJENDRA CHARY 156

Gate-2011

RAJENDRA CHARY 157

Gate-2008

RAJENDRA CHARY 158

Appendix

RAJENDRA CHARY 159

Appendix

RAJENDRA CHARY 160

Appendix

RAJENDRA CHARY 161

Appendix

RAJENDRA CHARY 162

Appendix

RAJENDRA CHARY 163

Appendix

RAJENDRA CHARY 164

 Conclusion of the Unit
In this unit we studied about:
• Introduction to Digital Signal Processing
• Discrete time signals & sequences, Periodicity
• Linear shift invariant systems, Stability and causality
• Frequency domain representation of discrete time signals and systems
• Linear constant coefficient difference equations and block diagram
representation
• Applications,Tutorial/Assignment problems
• Appendix
RAJENDRA CHARY 165
 Thank you
For Your Attention !
Any Questions
RAJENDRA CHARY 166