Scribd
Upload
72 views40 pages

Digital Signal Processing Digital Signal Processing: Dr. Shoab Khan

This document provides an overview of digital signal processing and discrete-time Fourier series and transforms. It discusses how discrete-time Fourier series can represent periodic signals using a finite number of complex exponentials. It also covers properties of the discrete Fourier transform such as linearity, duality, and how it can be used to analyze circular shifts and convolutions of sequences. Examples are provided to illustrate key concepts like representing impulse trains and rectangular pulses with discrete-time Fourier series and computing the discrete Fourier transform.

Uploaded by

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

Digital Signal Processing Digital Signal Processing: Dr. Shoab Khan

This document provides an overview of digital signal processing and discrete-time Fourier series and transforms. It discusses how discrete-time Fourier series can represent periodic signals using a finite number of complex exponentials. It also covers properties of the discrete Fourier transform such as linearity, duality, and how it can be used to analyze circular shifts and convolutions of sequences. Examples are provided to illustrate key concepts like representing impulse trains and rectangular pulses with discrete-time Fourier series and computing the discrete Fourier transform.

Uploaded by

Aisha Qamar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 40

Digital Signal Processing

Lecture

Dr. Shoab Khan


Discrete-Time Fourier Series
The conventional (continuous-time)
(continuous time) FS represent a
periodic signal using an infinite number of complex
exponentials, whereas the DFS represent such a
signal using a finite number of complex exponentials
Example 1
ƒ DFS of a periodic impulse train
~
∞
⎧1 n = rN
x[n] = ∑ δ[n − rN] = ⎨
r = −∞ ⎩0 else
ƒ Since the period of the signal is N
~ N −1 N −1
X[k ] = ∑ ~x[n]e− j(2π / N)kn =
n=0
∑ δ[n]e
n=0
− j(2 π / N )kn
= e − j(2 π / N)k 0 = 1

ƒ We can represent the signal with the DFS coefficients


as 1 N −1 j(2 π / N)kn
∞
~
x[n] = ∑ δ[n − rN] = ∑ e
r = −∞ N k =0
Example 2
ƒ DFS of an periodic rectangular pulse train

ƒ The DFS coefficients


~ 4
1 − e − j(2 π / 10 )k5 i (πk / 2)
− j(4 πk / 10 ) sin
X[k ] = ∑e − j(2 π / 10 )kn
= =e
n=0 1 − e − j(2 π / 10 )k sin(πk / 10)
Properties of DFS
ƒ Linearity
y
~ ~
x1 [n] DFS
←⎯ ⎯⎯→ X1 [k ]
~ ~
x [n]
2 ←⎯DFS
⎯⎯→ X2 [k ]
~ ~
a~
x1 [n] + b~
x2 [n] ⎯→ aX1 [k ] + bX2 [k ]
DFS
←⎯ ⎯

ƒ Shift of a Sequence
~ ~
x [n] ←⎯DFS
⎯⎯→ X[k ]
~ ~
x [n − m] ⎯→ e − j2 πkm / NX[k ]
←⎯DFS
⎯
j2 πnm / N~ ~
e x [n] ←⎯ ⎯
DFS
⎯→ X[k − m]
ƒ Duality

~ ~
x [n] ←⎯DFS
⎯⎯→ X[k ]
~
X[n] ←⎯DFS
⎯⎯→ N~
x [− k ]
Symmetry Properties
Symmetry Properties Cont’d
Periodic Convolution
ƒ Take two periodic sequences
~ ~
x1 [n] ←⎯DFS
⎯⎯→ X1 [k ]
~ ~
x [n] ←⎯DFS
2 ⎯⎯→ X2 [k ]
ƒ Let’s
L ’ fform the
h product
d
~ ~ ~
X3 [k ] = X1 [k ]X2 [k ]

ƒ The periodic sequence with given DFS can be written as


N −1
~
x [n] = ~
x [m]~
x [n − m]
3 ∑
m=0
1 2

ƒ Periodic convolution is commutative


N −1
~
x3 [n] = ~ ~
∑ 2 x1 [n − m]
x
m=0
[m]
Periodic Convolution Cont’d
N −1
~
x3 [n] = ~ ~
∑ 1 x2 [n − m]
x
m=0
[m]
ƒ Substitute periodic convolution into the DFS equation
~ N −1
⎛ N −1 ~ ~ ⎞ kn
X3 [k ] = ∑ ⎜∑ 1
⎜ x [m]x2 [n − m]⎟⎟WN
n=0 ⎝ m=0 ⎠
ƒ Interchange summations
~ ~ ⎛ N −1 ~
N −1
kn ⎞
X3 [k ] =
∑ x1[m]⎜∑ 2
⎜ x [n − m]WN ⎟⎟
m=0 ⎝ n=0 ⎠
ƒ The inner sum is the DFS of shifted sequence
q

km~
N −1
~
∑ x2[n − m]WN = WN X2 [k ]
n=0
kn

ƒ Substituting
~ N −1
~ ⎛ N −1 ~ kn ⎞
N −1
~ km~ ~ ~
X3 [k ] = ∑ x1 [m]⎜∑ 2
⎜ x [n − m]WN ⎟⎟= ∑ 1
x [m]WN X 2 [k ] =X1 [k ]X2 [k ]
m=0 ⎝ n=0 ⎠ m=0
Graphical Periodic Convolution
DTFT to DFT
Sampling the Fourier Transform
ƒ Consider an aperiodic
p sequence
q with a Fourier transform
x[n] ←⎯DTFT
⎯⎯→ X e jω ( )
ƒ Assume that a sequence is obtained by sampling the DTFT
~
( )
X[k ] = X e jω
ω = (2 π / N )k
(
= X e j(2 π / N)k )
ƒ Since the DTFT is periodic resulting sequence is also periodic
ƒ We can also write it in terms of the z-transform
~
(
X[k ] = X(z ) z = e(2 π / N )k = X e j(2 π / N)k )
ƒ The sampling points are shown in figure
~
ƒ X[k ]could be the DFS of a sequence
ƒ Write the corresponding sequence
~ 1 N −1 ~
x[n] = ∑ X[k ]e j(2 π / N)kn
N k =0
DFT Analysis and Synthesis
DFT
DFT is Periodic with period N
Example 1
Example 1 (cont.) N=5
Example 1 (cont.) N>M
Example 1 (cont.) N=10
DFT: Matrix Form
DFT from DFS
Properties of DFT
ƒ Linearity
y
x1 [n] ←⎯DFT
⎯⎯→ X1 [k ]
x2 [n] ←⎯DFT
⎯⎯→ X2 [k ]
ax1 [n] + bx2 [n] ←⎯DFT
⎯⎯→ aX1 [k ] + bX2 [k ]

ƒ Duality

x[n] ←⎯DFT
⎯⎯→ X[k ]
X[n] ←⎯DFT
⎯⎯→ Nx[((− k ))N ]

ƒ Circular Shift of a Sequence

x[n] ←⎯DFT
⎯⎯→ X[k ]
x[((n − m))N ] 0 ≤ n ≤ N - 1 ←⎯DFT
⎯⎯→ X[k ]e − j(2 πk / N)m
Symmetry Properties
DFT Properties
Example: Circular Shift
Example: Circular Shift
Example: Circular Shift
Duality
Circular Flip
Properties: Circular Convolution
Example: Circular Convolution
Example: Circular Convolution
Example (continued)
illustration of the circular convolution process
Illustration of circular convolution for N = 8:
•Example:
•Example (continued)
•Proof of circular convolution property:
•Multiplication:

You might also like