Scribd
Upload
9 views19 pages

Convolution and DTFT in Discrete Systems

The document outlines key concepts related to convolution in discrete time systems, including the formulas for convolution of two signals and the resulting sample counts. It discusses cascade and parallel connections, impulse responses, and methods for determining system responses using convolution and deconvolution techniques. Additionally, it touches on the Discrete Time Fourier Transform (DTFT) and its applications in analyzing discrete-time sequences.

Uploaded by

maimoonaziz2003
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
9 views19 pages

Convolution and DTFT in Discrete Systems

The document outlines key concepts related to convolution in discrete time systems, including the formulas for convolution of two signals and the resulting sample counts. It discusses cascade and parallel connections, impulse responses, and methods for determining system responses using convolution and deconvolution techniques. Additionally, it touches on the Discrete Time Fourier Transform (DTFT) and its applications in analyzing discrete-time sequences.

Uploaded by

maimoonaziz2003
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

Points to remember:

Convolution x3(n)= x1(n)*x2(n)

If number of samples of x1(n) = N1, x2(n)= N2, then x3(n)=

N1+N2-1

If x1(n) starts at n1 and x2(n) at n2, then x3(n) starts at ?

n1+n2

Ends at n1+n2 + (N1+N2-1)-1


Interconnection of discrete time systems

Cascade and parallel connections


Determine the impulse response for the
cascaded connection

h1(n)= (2/5)nu(n), h2(n)=(1/5)nu(n)


Determine the response of the system

x(n)= {1,2,0.5,1}
↑
h(n)={1,2,1,-1}
↑
Convolution using Tabular Method
Determine the response of the system using matrix method

x(n)= {1,2,0.5,1}
↑
h(n)={1,2,1,-1}
↑
Linear and Circular Convolution

x(n)= {1,2,3,4}

h(n)={-3,2,1}
Convolution

x(n)= {1,1,-1}

y(n)={1,3,1,-2}
Deconvolution

y(n)= {3,8,17,25,26,23,10}

h(n)={1,2,3,2}
DTFT (Discrete Time Fourier Transform

Mathematically, if x(n) is a discrete-time sequence,


then its discrete-time Fourier transform is defined as −
Magnitude and phase
x(n)=1 for n =0 to 4 find DTFT
Find DTFT

a) x(n)=0.5nu(n)

b) x(n) = a|n|
Find IDTFT
jw
a)H(e )= ( 1+2cosw)
jw
b)H(e )=1 ; -w0

You might also like