Scribd
Upload
13 views

Lecture 01

This document discusses key topics in signal processing including causality, convolution, and properties of the unit sample function. It defines analog and digital signals, the Nyquist sampling theorem, linear and time-invariant systems, and properties of convolution including how the unit sample function affects convolution.

Uploaded by

Mortuza
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

Lecture 01

This document discusses key topics in signal processing including causality, convolution, and properties of the unit sample function. It defines analog and digital signals, the Nyquist sampling theorem, linear and time-invariant systems, and properties of convolution including how the unit sample function affects convolution.

Uploaded by

Mortuza
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 49

Naqib Sad Pathan

Assistant Professor
Department of Electrical and Electronic Engineering
Chittagong University of Engineering and Technology
Authors: Alan V.
Oppenheim and others
Three most important
topics in this chapter:

1. Causality of a system
2.Convolution operation
3. Convolutional
properties of unit sample
function(δ[n]).
Signal is a physical quantities that varies with time or other
independent variables.
A signal is a function that conveys information about a
phenomenon.
Example: Examples of signals include as temperature over time or
space, sound (speech, music, etc) over time, images over space, etc.
A signal carries information and contains energy.
Analog Signal Digital Signal
CT Signal DT Signal
CT- Analog CT- Digital
Signal Signal

DT- Analog DT-Digital


Signal Signal
The Nyquist Sampling Theorem states that:
A bandlimited continuous-time signal can be sampled and perfectly
reconstructed from its samples if the waveform is sampled over
twice as fast as it's highest frequency component.
Nyquist limit:
the highest frequency component that can be accurately represented:
Nyquist frequency: sampling rate required to accurately represent up
to :

No information is lost if sampling above

No information is gained by sampling much faster than


For Signal 1,
1, 𝑛 ≤ 0
𝑥𝑛 =
−1, 𝑛 > 0

For Signal 2,
1, 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛
𝑥𝑛 =

Functional representation
Graphical representation
Linear or Non-linear?
Time variant
Systems:
Upsampling/downsampling
System.
See later
Output of an LTI
system can be
described as,
y[n]=x[n]*h[n]
Where h[n] is the
response of the system
δ[n] is an even function:
δ[n] = δ[-n]

Convolution Properties:
x[n]*δ[n] = x[n]
The output of a system with response δ[n] is
same as input.
Convolution Properties:
x[n]*δ[n- nd] = x[n- nd]
x[n-nd1]* δ[n- nd2]= x[n- (nd1+nd2)]
y[n]= x[n] * h[n]
Multiplication with δ[n]:
x[n] δ[n]=x[0] δ[n]
x[n] δ[n- 1] = x[1] δ[n- nd]
Convolution Properties:
δ[n]*δ[n- nd] = δ[n- nd]
δ[n-nd1]* δ[n- nd2]= δ[n- (nd1+nd2)]
Examples:
δ[n]* δ[n]= δ[n]
δ[n]* δ[-n]= δ[n]* δ[n]=δ[n]
δ[n]* δ[n-3]= δ[n-3]
δ[n-1]* δ[n-3]= δ[n-4]
Examples:
δ[n+1]* δ[n]= δ[n+1]
δ[n+1]* δ[n-3]= δ[n-2]
δ[n+3]* δ[n-2]= δ[n+1]
δ[n+3]* δ[n+2]= δ[n+5]
Examples:
δ[n+1]* δ[-n]= δ[n+1]
δ[n+1]* δ[-n-3]= δ[n+1]* δ[-(n+3)]=
δ[n+1]* δ[n+3]= δ[n+4]
Exercise:
Given that, x1[n]=δ[n+1]-2δ[n]+3δ[n-1]
And
x2[n]=-2δ[n+1]+δ[n]+2δ[n-1]
Plot x1[n] and x2[n] and then
Find y[n]= x1[n]*x2[n]

You might also like