DSP Lecture 13-14

Lectures 13-14 EE-802 ADSP SEECS-NUST
EE 802-Advanced Digital Signal

Processing
Dr. Amir A. Khan
Office : A-218, SEECS
9085-2162; amir.ali@seecs.edu.pk
Lecture Outline
Discrete Fourier Transform (DFT)
Discrete Fourier Transform
Discrete Fourier Transform (DFT) not same as DTFT
DFT results from sampling of DTFT (at pre-defined frequencies),
generally for an aperiodic finite duration discrete sequence
Extension of Discrete Fourier Series (DFS)

Aperiodic Discrete
Why DFT? Efficient algorithms exist for DFT computation (Fast Fourier Transform)
be a periodic sequence with period N so that
Discrete Fourier Series-Revisit
[ ] x n
[ ] [ ] x n x n rN = +
| |
( )
| |
( )
1
2 / 2 /
0
1 1
[ ]
N
j N kn j N kn
k N k
x n X k e X k e
N N
t t
=< > =
= =

Fourier Series : representation of signal as sum of complex exponentials
Periodicity of discrete time exponentials implies sum is finite duration
For convenience we define :
( ) 2 / j N
N
W e
t
=
Analysis equation

Synthesis equation
| |
1
0
1
[ ]
N
kn
N
k
x n X k W
N
=
=

| |
1
0
[ ]
N
kn
N
n
X k x n W
=
=
DFS Pair
] [
~
] [
~
k X n x
DFS

Discrete Fourier Series-Examples
| |
1
[ ]
0
r
n rN
x n n rN
else
o
=
=
= =
| |
( )
1
2 /
0
1
[ ]
N
j N kn
r k
x n n rN e
N
t
o

= =
= =

[ ] [ ]
r
Y k N k rN o
+
=
=
1
0
0
1
[ ] [ ] 1
N
kn
N N
k
y n N k W W
N
o
=
= = =
Periodic impulse train

Coefficients form periodic impulse train
Coefficients constant
Sequence constant
DUALITY
Refer to your DSP Oppenheim Book for Summary of DFS properties
Relationship between DTFT/DFS
Periodic /Finite Duration signals
Relationship between DTFT and DFS for periodic sequences
Periodic impulse train : strength proportional to DFS coefficients

( ) | |
2 2
j
k
k
X e X k
N N
e
t t
o e
=
| |
=
|
\ .
Consider a finite length signal x[n] spanning from 0 to N-1

Convolve with periodic impulse train
| | | |
[ ] [ ] [ ] [ ]
r r
x n x n p n x n n rN x n rN o

= =
= - = - =

( ) ( ) ( ) ( )
( )
2
2 2
2 2
j j j j
k
k
j
j
N
k
k
X e X e P e X e
N N
k
X e X e
N N
e e e e
t
e
t t
o e
t t
o e
=
| |
= =
|
\ .
| |
| |
=
|
|
\ .
\ .
| | ( )
2
2
k
j
j
N
k
N
X k X e X e
t
e
t
e=
| |
= =
|
\ .
Fourier Transform
DFS coeffs. correspond to sampling of
DTFT (in freq. domain) @ every 2t/N
Relationship between DTFT/DFS
Periodic /Finite Duration signals (Ex.)
| |
1, 0 4
0 , otherwise
n
x n
s s
( )
( )
( )
4
2
0
sin 5 / 2
sin / 2
j j n j
n
X e e e
e e e
e
e

=
= =
| |
1, 0 4
0 , otherwise
n
x n
s s
represents one cycle of the following periodic signal

| |
( )
4 4
2 /10
10
0 0
j kn kn
n n
X k W e
t
= =
= =

| |
( )
( )
( )
5
4 /10
10
10
sin / 2 1
sin / 10 1
k
j k
k
k W
X k e
k W
t
t
t
= =
2 / 10 k e t = Substitute
( )
( )
(4 /10)
sin / 2
[ ]
sin / 10
j k
k
X k e
k
t
t
t
=
DFS coeffs.
Sampling the Fourier Transform
Time Domain : Periodic signal from finite duration sequence

Frequency-domain: Performing the sampling operation
Performing reverse operation : sampling of DTFT
| |
( )
( )
( )
( )
2 /
2 /
j N k j
N k
X k X e X e
t e
e t =
= =
| | ( )
( )
( )
( ) 2 /
2 /
j N k
j N k
z e
X k X z X e
t
t
=
= =
Sampling the z-transform
1
0
1
[ ] [ ]
N
kn
N
k
x n X k W
N
=
=

Inverse DFS
| | | | | | | |
*
r r
x n x n n rN x n rN o

= =
= =

Sampling of DTFT (aperiodic sequence) in frequency domain
generates a periodic repetition of the aperiodic sequence with period N
Periodicity of sequence evident from moving around unit circle
Sampling the Fourier Transform-Time Aliasing
=
=
r
rN n x n x ] [ ] [
~
One-period
Im(z)
Re(z)
12
2t
Im(z)
Re(z)
e
DFS
DTFT
Sampling the Fourier Transform-Time Aliasing
=
=
r
rN n x n x ] [ ] [
~
One-period
Im(z)
Re(z)
7
2t
Im(z)
Re(z)
e
DFS
DTFT
X
X
Aliasing in Time-Domain
Summary
Samples of Fourier Transform of an aperiodic sequence x[n] can be
thought of as Fourier Series Coeffs. of periodic sequence obtained
by summing periodic replicas of x[n]

If x[n] is finite duration and we take sufficient number of samples
of its Fourier Transform (greater than or equal to its length), then x[n]
is recoverable from the periodic sequence

To recover or represent x[n], it is therefore not necessary to know X(e
je
)
at all the frequencies

Using DFS for purpose of recovering/representing a finite duration
sequence leads to DFT
] [
~
n x
] [
~
n x
DFT-Fourier Representation of Finite
Duration Sequences
Consider a finite length sequence x[n] of length N

Corresponding periodic sequence

To maintain duality between time and frequency
Fourier coefficients to associate with finite duration sequence x[n]
one period of

| |
0 outside of 0 1 x n n N = s s
| | | |
r
x n x n rN
=
=
| | ( ) ( ) ( )
mod N
N
X k X k X k

= =

| | ( ) ( ) ( )
mod N
N
x n x n x n

= =

No-overlap between the summation terms
[ ] 0 1
[ ]
0 otherwise
x n n N
x n
s s
One period of
] [
~
n x
] [
~
k X
[ ] 0 1
[ ]
0 otherwise
X k k N
X k
s s
=


DFT-Analysis and Synthesis Equations
| |
( )
1
2 /
0
1
[ ]
N
j N kn
k
x n X k e
N
t
=
=

| |
( )
1
2 /
0
[ ]
N
j N kn
n
X k x n e
t
=
=
DFS Pair
| |
( )
1
2 /
0
[ ] 0 1
0
N
j N kn
n
x n e k N
X k
else
t
s s
| |
( )
1
2 /
0
1
0 1
[ ]
0
N
j N kn
k
X k e n N
x n N
else
t
s s
PERIODIC
ONE PERIOD ONLY
| | | |
DFT
x n X k
1
0
[ ] ( ) , 0 1
N
kn
N
n
X k x n W k N
=
= s s
1
0
1
[ ] ( ) , 0 1
N
kn
N
k
x n X k W n N
N
=
= s s
Analysis equation

Synthesis equation
DFT-Ex: Rectangular Pulse
Minimum Value of N ?
Minimum Value of N = 5
| |
( )
( )
4
2 / 5
0
2
2 / 5
1
1
5 0, 5, 10,...
0
j k n
n
j k
j k
X k e
e
e
k
else
t
t
t
DFS
Required DFT
DFT-Ex: Rectangular Pulse
Minimum Value of N ?
Minimum Value of N = 5
| |
( )
( )
4
2 / 5
0
2
2 / 5
1
1
5 0, 5, 10,...
0
j k n
n
j k
j k
X k e
e
e
k
else
t
t
t
DFS
Required N = 5-point DFT
DFT-Ex: Rectangular Pulse N = 10
| |
( )
( )
( )
( )
( )
( )
2 /10 5
4
2 /10 4 /10
2 /10
0
sin / 2
1
sin /10
1
j k
j kn j k
j k
n
k
e
X k e e
k
e
t
t t
t
t
t
= = =
| |
( )
( )
( )
( )
( )
( )
2 /10 5
4
2 /10 4 /10
2 /10
0
sin / 2
1
sin /10
1
j k
j kn j k
j k
n
k
e
X k e e
k
e
t
t t
t
t
t
= = =
| |
( )
( )
( )
( )
( )
( )
2 /10 5
4
2 /10 4 /10
2 /10
0
sin / 2
1
sin /10
1
j k
j kn j k
j k
n
k
e
X k e e
k
e
t
t t
t
t
t
= = =
Required N = 10-point DFT

DFT not same as
prev. example although
DTFT is same
DFT- Frequency Interpretation
1
0
[ ] ( ) , 0 1
N
kn
N
n
X k x n W k N
=
= s s
DFT determines the spectral content of input at N equally spaced frequency points
What are the exact frequencies in the DFT spectrum?
depends on the number of DFT points N and
on the sampling frequency f
s
, at which the original signal was sampled
X[k] : frequency content at discrete radial frequency: (rad/sample)
or cycles/sample

In real frequency terms (Hz) :
k
N
k
t
e
2
=
N
k
f
k
=
N
kf
f
s
=
analysis
In case your sampling frequency is not specified or not known, we talk of normalized
frequency (scale from -0.5 to 0.5)

DSP Lecture 13-14

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DSP Lecture 13-14

Uploaded by

Copyright:

Available Formats

Lectures 13-14 EE-802 ADSP SEECS-NUST

EE 802-Advanced Digital Signal

Lectures 13-14 EE-802 ADSP SEECS-NUST

Periodic impulse train

Consider a finite length signal x[n] spanning from 0 to N-1

represents one cycle of the following periodic signal

Lectures 13-14 EE-802 ADSP SEECS-NUST

Required N = 10-point DFT

You might also like