Chap3-Discrete Fourier Transform

Chapter 3
Discrete Fourier Transform

Review
The DTFT provides the frequency-domain ( )

representation for absolutely summable sequences.
The z-transform provides a generalized frequencydomain ( z ) representation for arbitrary sequences.
Features in common
Defined for infinite-length sequences.
Functions of continuous variable ( or z ).
They are not numerically computable transform.
We need a numerically computable transform, that is
Discrete Fourier Transform (DFT)
Copyright 2005. Shi Ping CUC
Chapter 3
Discrete Fourier Transform
Content
The Family of Fourier Transform

The Discrete Fourier Series (DFS)
The Discrete Fourier Transform (DFT)
The Properties of DFT
The Sampling Theorem in Frequency Domain
Approximating to FT (FS) with DFT (DFS)
Summary
Introduction
Fourier analysis is named after Jean Baptiste Joseph

Fourier (1768-1830), a French mathematician and
physicist.
A signal can be either continuous or discrete, and it can
be either periodic or aperiodic. The combination of
these two features generates the four categories of
Fourier Transform.
Aperiodic-Continuous Fourier Transform
X ( j ) x( t )e
1
x(t )
2
j t
dt
X ( j )e
j t
Periodic-Continuous Fourier Series
1
X ( jk 0 )
T0
x( t )
T0 2
T0 2
X ( jk
x ( t )e
)e
jk 0 t
dt
jk 0 t
2
0 2F
T0
Aperiodic-Discrete DTFT
X (e )
x(n)e
j n
1
x ( n)
2
X (e
)e
j n
Periodic-Discrete DFS (DFT)

N 1
X ( k ) x ( n)e
2
j
nk
N
n0
1
x ( n)
N
N 1
X (k )e
2
nk
N
k 0
Summary
Time function
Frequency function
Continuous and Aperiodic
Aperiodic and Continuous
Continuous and Periodic(

Discrete (
Discrete (
T)0
) and Aperiodic
T
T ) and Periodic ( T0)
2
Aperiodic and Discrete( 0
)
T0
2
Periodic( s
) and Continuous
T
2
Periodic(
)
s
T
2
0 )
and Discrete(
T0
return
Definition
Periodic time functions can be synthesized as a linear

combination of complex exponentials whose frequencies
are multiples (or harmonics) of the fundamental frequency
Periodic continuous-time function x ( t ) x ( t rT )
2
2
j
t
fundamental
j
kt
T
T
x(t )
X ( k )e
frequency
Periodic discrete-time function x ( n)

2
fundamental
j
n
1
N
x( n)
frequency
x ( n rN )
N 1
X ( k )e
N
k 0
2
kn
N
1
N
N 1
N 1
2
rn
N
n0
x(n)e
2
rN
N
r mN
1,
1 1 e

2
j
r
N
0, elsewhere
N
1 e
2
rn
N
n0
1
X ( k )
k 0
N
N 1
1

n0 N
N 1
N 1
e
n0
N 1
X (k )e
2
kn
N
k 0
2
rn
N
2
( k r )n
N
X (r )

N 1
X ( k ) x( n)e
2
kn
N
n0
N 1
Because:
X ( k mN ) x ( n)e
2
( k mN ) n
N
n0
N 1
x ( n)e
2
kn
N
X (k )
n 0
The X (k ) is a periodic sequence with fundamental

period equal to N
Let W N e
j 2N
N 1
~
nk
~
~
X ( k ) DFS[ x ( n)] x ( n)W N
n0
1
~
~
x ( n) IDFS[ X ( k )]
N
N 1
~
nk
X (k )W N
k 0
Relation to the z-transform
x~ ( n), 0 n N 1
x( n)
elsewhere
0,
N 1
X ( z ) x ( n) z n ,
n0
~
X (k ) X ( z ) |
z e
N 1
~
j 2N k n
X ( k ) x ( n)(e
)
n0
j 2 k
N
~
The DFS X ( k ) represents N evenly spaced
samples of theXz-transform
around the unit
(z )
circle.
Relation to the DTFT
x~ ( n), 0 n N 1
x( n)
elsewhere
0,
N 1
X (e ) x ( n)e
j
~
X ( k ) x( n)e
j n
n0
N 1
~
X ( k ) X (e j ) | 2 k
2
nk
N
n0
The DFS is obtained by evenly sampling the DTFT at 2
N
intervals. It is called frequency resolution and represents the
sampling interval in the frequency domain.

~
X ( k ) X (e j ) | 2 k
N
jIm[z]
frequency resolution
N=8
2
N
k0
Re[z]
The properties of DFS

Linearity
~
~
~
~
DFS[ax1 ( n) bx 2 ( n)] aX 1 ( k ) bX 2 ( k )
Shift of a sequence
mk ~
~
DFS[ x ( nm )] W N X ( k ) e
2
mk
N
~
X (k )
Modulation
~
~
DFS[W x ( n)] X ( k l )
ln
N
if
then
Periodic convolution
~
~
~
Y (k ) X 1 (k ) X 2 (k )
N 1
~y ( n) IDFS[Y~ ( k )]
~
~
x1 (m ) x2 (n m )
m 0
N 1
x~2 ( m ) x~1 ( n m )
m 0
~y ( n) IDFS[ X~ ( k ) X~ ( k )] 1
1
2
N
N 1
~
~
nk
X 1 (k ) X 2 (k )W N
k 0
mk ~
nk
~
x1 ( m )W N X 2 ( k )W N
k 0 m 0
N 1
N 1
1
~
( n m ) k
~
x1 ( m )
X 2 ( k )W N
N
m 0
k 0
N 1 N 1
N 1
N 1
m 0
m 0
~
~
~
~
x1 ( m ) x 2 ( n m ) x 2 ( m ) x1 ( n m )
return
Introduction
The DFS provided us a mechanism for numerically

computing the discrete-time Fourier transform. But most of the
signals in practice are not periodic. They are likely to be of
finite length.
Theoretically, we can take care of this problem by defining a

periodic signal whose primary shape is that of the finite length
signal and then using the DFS on this periodic signal.
Practically, we define a new transform called the Discrete

Fourier Transform, which is the primary period of the DFS.
This DFT is the ultimate numerically computable Fourier

transform for arbitrary finite length sequences.
Finite-length sequence & periodic sequence
x (n) Finite-length sequence that has N samples

x~ ( n) periodic sequence with the period of N
Window operation
x~ ( n), 0 n N 1
x ( n)
0, elsewhere
x ( n) x~ ( n) R ( n)
N
Periodic extension
x~ ( n)
x(n rN )
x~ ( n) x (( n)) N
The definition of DFT

N 1
X ( k ) DFT[ x ( n)] x ( n)W Nnk ,
0 k N 1
n0
1
x ( n) IDFT[ X ( k )]
N
N 1
N 1
nk
X
(
k
)
W
,
0 n N 1
n0
~
X ( k ) x ( n)W RN ( k ) X ( k ) RN ( k )
n0
1
x ( n)
N
nk
N
N 1
nk
~ ( n) R ( n)
X
(
k
)
W
R
(
n
)
N
N
N
n0
return
Linearity
DFT[ax1 ( n) bx 2 ( n)] aX 1 ( k ) bX 2 ( k )
N3-point DFT, N3=max(N1,N2)
Circular shift of a sequence
DFT[ x(( n m )) N RN ( n)] W
km
N
X (k )
Circular shift in the frequency domain
DFT[W
nl
N
x( n)] X (( k l )) N RN ( k )
The sum of a sequence
X (k ) k 0
nk
x
(
n
)
W
N
n 0
k 0
N 1
x ( n)
n 0
The first sample of sequence
1
x ( 0)
N
N 1
N 1
X (k )
k 0
DFT [ x( n)] X ( k )
DFT [ X ( n)] Nx(( N k )) N RN ( k )

Circular convolution
x1 ( n)
x 2 ( n)
x (m ) x ((n m ))
m 0
x (m ) x (( n m ))
m 0
DFT[ x1 ( n)
N 1
N 1
RN ( n )
RN ( n) x 2 ( n)
x1 ( n)
x 2 ( n)] X 1 ( k ) X 2 ( k )
Multiplication
1
DFT[ x1 ( n) x 2 ( n)]
X 1 (k )
N
X 2 (k )
Circular correlation
Linear correlation
rxy ( m )
x ( n) y * ( n m ) x ( n m ) y * ( n)
Circular correlation
N 1
rxy ( m ) x( n) y * (( n m )) N RN ( m )
n0
N 1
x (( n m )) N y * ( n)RN ( m )
n0
if
R xy ( k ) X ( k ) Y ( k )
then
rxy ( m ) IDFT[ Rxy ( k )]
N 1
x( n) y * (( n m ))
n0
N 1
x(( n m ))
n0
RN ( m )
y * ( n)RN ( m )
Parsevals theorem
N 1
1
*
x ( n) y ( n)
N
n0
let
then
N 1
*
X
(
k
)
Y
(k )
k 0
x ( n) y( n)
N 1
1
*
x ( n) x ( n)
N
n 0
N 1
n0
1
x ( n)
N
2
N 1
N 1
*
X
(
k
)
X
(k )
k 0
X (k )
k 0
Conjugate symmetry properties of DFT
xep (n)
and
xop (n)
Let x (n) be a N-point sequence
x~ ( n) x (( n)) N
1 ~
1
~
~
xe ( n) [ x ( n) x ( n)] [ x (( n)) N x (( N n)) N ]
2
2
1 ~
1
~
~
xo ( n) [ x ( n) x ( n)] [ x(( n)) N x (( N n)) N ]
2
2
*
~
~
It can be proved that
x ( n) x ( n)
e
x~o ( n) x~o* ( n)

Circular
conjugate
symmetric
component
Circular
conjugate
antisymmetric
component
xep ( n) x~e ( n) RN ( n)
x (( n)) N x (( N n)) N RN ( n)
2
xop ( n) x~o ( n) RN ( n)
1
x (( n)) N x (( N n)) N RN ( n)
2
x ( n) xep ( n) xop ( n)
xep ( n) x (( N n)) N RN ( n)
*
ep
xop ( n) x (( N n)) N RN ( n)
*
op
X ep (k )
and
X op (k )
X ( k ) X ep ( k ) X op ( k )
X ep ( k ) X (( N k )) N RN ( k )
*
ep
X op ( k ) X (( N k )) N RN ( k )
*
op
Re[ X ep ( k )] Re[ X ep (( N k )) N RN ( k )]
Im[ X ep ( k )] Im[ X ep (( N k )) N RN ( k )]
Re[ X op ( k )] Re[ X op (( N k )) N RN ( k )]
Im[ X op ( k )] Im[ X op (( N k )) N RN ( k )]
Circular even sequences
if
x ( n) x (( N n)) N RN ( n)
then
X ( k ) X (( N k )) N RN ( k )
Circular odd sequences
if
x( n) x(( N n)) N RN ( n)
then
X ( k ) X (( N k )) N RN ( k )
Conjugate sequences
DFT[ x ( n)] X (( k )) N RN ( k )
*
*
X (( N k )) N RN ( k ) X ( N k )
*
DFT[ x (( n)) N RN ( n)]

*
DFT[ x (( N n)) N RN ( n)] X ( k )

*
Complex-value sequences
DFT Re[ x ( n)] X ep ( k )
1
*
X (( k )) N X (( N k )) N RN ( k )
2
DFT j Im[ x ( n)] X op ( k )
1
*
X (( k )) N X (( N k )) N RN ( k )
2
DFT[ xep ( n)] Re[ X ( k )]

1
*
DFT [ x (( n)) N x (( N n)) N ]RN ( n)
2
DFT[ xop ( n)] j Im[ X ( k )]

1
*
DFT [ x (( n)) N x (( N n)) N ]RN ( n)
2
Real-value sequences
if x ( n) is real - value sequence

then X ( k ) X (( N k )) N RN ( k )
*
Imaginary-value sequences
if x( n) only has imaginary part

then X ( k ) X (( N k )) N RN ( k )
*
Summary
x( n) Re[ x ( n)] j Im[ x ( n)]
X ( k ) X ep ( k )
x ( n)
xep ( n)
X op ( k )
xop ( n)
X ( k ) Re[ X ( k )] j Im[ X ( k )]
example
Linear convolution & circular convolution

x1 ( n) N1 point sequence, 0n N1-1
x 2 ( n)
N2 point sequence, 0n N2-1
Linear convolution
y l ( n) x1 ( n) x 2 ( n)
N 1 1
x (m ) x (n m ) x (m ) x (n m )
m 0
y l (n) L point sequence, L= N1+N2-1

We have to make both x1 ( n) and x 2 ( n) L-point

sequences by padding an appropriate number of zeros
in order to make L point circular convolution.
x1 ( n), 0 n N 1 1
x1 ( n)
N1 n L 1
0,
x 2 ( n), 0 n N 2 1
x 2 ( n)
N2 n L 1
0,
yc ( n) x1 ( n) L x 2 ( n)
L 1
x (m ) x (( n m ))
m 0
x (m ) x (n rL m )
m 0
L 1
x (m )x (n rL m )
r m 0
y (n rL)
RL ( n )
RL ( n )
L 1
RL ( n )
RL ( n )
yc ( n)
if
y ( n rL)
RL ( n )
L N1 N 2 1
then
that is
yc ( n) y l ( n)
x1 ( n )
x 2 ( n ) x1 ( n ) x 2 ( n )
return
Sampling in frequency domain
~
X ( k ) X ( z ) |z W k
N
km
x
(
m
)
W
1
~
~
x N ( n) IDFS[ X ( k )]
N
1
N 1
N 1
~
kn
X
(
k
)
W
N
k 0
kn
x
(
m
)
W
W

N
k 0 m
1 N 1 k ( m n )
x( m )
WN
x( n rN )
m
N k 0
r
km
N
~
x N ( n)
x(n rN )
Frequency Sampling Theorem

For M point finite duration sequence, if the frequency
sampling number N satisfy:
then
NM
~
x N ( n ) x N ( n) RN ( n ) x ( n )
Interpolation formula of X (z )
N 1
X ( z ) x ( n) z
n0
N 1
X (k )
N 1
k 0
k 0
X ( k )
1

n0 N
N 1
X (k )W
k 0
nk
N
n
z
N 1
N 1
1
nk
k 1 n
W N z X ( k ) W N z
N k 0
n0
n0
1 W N Nk z N
1 z N N 1 X ( k )
k 1
1 WN z
N k 0 1 W N k z 1
N 1
N 1
1 z
X (z)
N
N N 1
N 1
X (k )
X ( k ) k ( z )
k 1
k 0 1 W N z
k 0
N
1 1 z
k (z)
k 1
N 1 WN z
Interpolation
function
Interpolation formula of X (e j )
2
X (e ) X ( k ) K (e ) X ( k ) (
k)
N
k 0
k 0
jw
N 1
N 1
sin 2N j N21
( )
e
N sin 2
Interpolation
function
return

Approximating to FT of continuous-time aperiodic
signal with DFT
CTFT
X ( j ) x( t )e
1
x(t )
2
j t
dt
X ( j )e
jt
d
Sampling in time domain
t nT ,
dt T ,
dt
X ( j ) x ( t )e jt dt T
jnT
x
(
nT
)
e
1
j t
x( t )
X
(
j
)
e
d
2
1 S
2
jnT
x( nt )
X ( j )e
d s 2f s
2 0
T
Truncation in time domain
t : (0 ~ T0 ) , T0 NT ,
n : (0 ~ N 1)
N 1
X ( j ) T x ( nT )e
jnT
n0
1
x ( nT )
2
X ( j )e
jnT
d
Sampling in frequency domain
k 0 ,
d 0 ,
1
N
T0
NT ,
F0 f s
N 1
d 0
n0
2
0 2F0
T0
2
2
0T
T
T0
N
N 1
X ( jk 0 ) T x( nT )e
n0
T DFT[ x ( n)]
jk 0 nT
N 1
T x( n)e
2
nk
N
n0
0
x ( nT )
2
N 1
X ( jk
k 0
N 1
1
F0 N
N
X ( jk
N 1
1
fs
N
k 0
X ( jk
k 0
)e
jk 0 nT
)e
)e
2
nk
N
2
nk
N
1
f s IDFT[ X ( jk 0 )] IDFT[ X ( jk 0 )]
T
demo

Approximating to FS of continuous-time periodic
signal with DFS
1
X ( jk 0 )
T0
x( t )
T0
x ( t )e
X ( jk
)e
jk 0 t
dt
jk 0 t
2
0 2F0
T0
Sampling in time domain
t nT ,
T
X ( jk 0 )
T0
dt T ,
N 1
T0 NT
x(nT )e
n0
jk 0 nT
T0
N 1
dt T
N 1
n0
x(n)e
2
nk
N
n0
1
DFS[ x( n)]
N
Truncating in frequency domain
T0 NT , f s NF0 ,
x( t )
X ( jk
)e
jk 0 t
N 1
x ( nT ) X ( jk 0 )e
jk 0 nT
k 0
1
N
N
N 1
X ( jk
k 0
let k : (0, N 1)
)e
N 1
X ( jk 0 )e
2
nk
N
k 0
2
nk
N
N IDFS[ X ( jk 0 )]
Some problems
Aliasing
Sampling in time domain:
f s 2 fh ,
1
1
T
fs 2 fh
Otherwise, the aliasing will occur in frequency domain
1
Sampling in frequency domain: T0
F0
T0 Period in time domain F0 Frequency resolution
f s T0
N
F0 T
fh
and F0
is contradictory
Spectrum leakage
x1 ( n), infinite - length sequence

x 2 ( n) x1 ( n) RN ( n), finite - length sequence
j
X 2 (e ) X 1 (e ) W R (e )
Spectrum extension (leakage)
Spectrum aliasing
demo
Fence effect
2 0 2F0
0
,
N
fs
fs
fs
F0
N
Frequency resolution
fs
1
1
F0
N NT T0
demo
Comments
Zero-padding is an operation in which more zeros are

appended to the original sequence. It can provides closely
spaced samples of the DFT of the original sequence.
The zero-padding gives us a high-density spectrum and

provides a better displayed version for plotting. But it does
not give us a high-resolution spectrum because no new
information is added.
To get a high-resolution spectrum, one has to obtain

more data from the experiment or observation.
demo
example
return
Summary
z-transform of x(n)
The frequency representations of x(n) Complex
frequency domain
X (z )
DTFT of x(n)
j
z
e
Frequency
domain
DTFT
X ( e j )
ZT
z
x (n)
interpolation
2
j
k Time
e N sequence
DFT of x(n)
Discrete
frequency domain
DFT
2
k
N
interpolation
X (k )
return
Illustration of the four Fourier transforms
Fourier Transform
Signals that are continuous

and aperiodic
Fourier Series
Signals that are continuous

and periodic
DTFT
Signals that are discrete and

aperiodic
Discrete Fourier Series
Signals that are discrete and

periodic
x~1 ( m )
n0
n1
n2
n3
n4
n5
n6
x~2 ( n m )
~y ( n)
0 1 2 3 4 5 6
n
return
1
xep ( n) x ( n) x (( N n)) N RN ( n)
2
x(n)
x (( N n)) N
xep (n)
n
return
xep ( n) x (( N n)) N RN ( n)
*
ep
xep (n)
xep (( N n)) N
RN (n)
return
10 (0.8) n R11 ( n)
Original sequence
x(n)
10
5
0
0
2
3
4
5
6
7
8
Circular conjugate symmetric component
10 n
2
3
4
5
6
7
8
Circular conjugate antisymmetric component
10 n
10 n
xep(n)
10
5
0
xop(n)
4
2
0
-2
-4
return
Circular even sequence x(n)

10
5
0
0
4
5
6
The DFT of x(n)
10 n
X (k )
40
20
0
10 k
X (( N k )) N RN ( n)
40
20
0
10 k
return
Circular odd sequence x(n)
4
2
0
-2
-4
3
4
5
6
7
The imaginary part of DFT[x(n)]
10 n
10 k
10 k
X (k )
10
0
-10
0
X (( N k )) N RN ( n)
10
0
-10
0
return
X ( k ) X * (( N k )) N RN ( k )
X (0) X * (( N k )) N RN ( k )
k 0
X * ( 0)
X (0) is a real number

if N is even
N
*
X ( ) X (( N k )) N RN ( k )
2
N
X ( ) is a real number
2
N
2
N
X ( )
2
*
return
X ( k ) X * (( N k )) N RN ( k )
X (0) X * (( N k )) N RN ( k )
k 0
X * ( 0)
X (0) is an imaginary number

if N is even
N
*
* N
X ( ) X (( N k )) N RN ( k ) N X ( )
k
2
2
2
N
X ( ) is an imginary number
2
return
x1 ( n) , x 2 ( n) N-point real-value sequences

X 1 ( k ) DFT[ x1 ( n)],
X 2 ( k ) DFT[ x 2 ( n)]
y( n) x1 ( n) jx 2 ( n)
Y ( k ) DFT[ y( n)] DFT[ x1 ( n) jx 2 ( n)]
DFT[ x1 ( n)] jDFT[ x 2 ( n)] X 1 ( k ) jX 2 ( k )
1
X 1 ( k ) DFT Re[ y( n)] Yep ( k ) Y ( k ) Y (( N k )) N RN ( k )
2
1
1
X 2 ( k ) DFT Im[ y( n)] Yop ( k )
Y ( k ) Y (( N k )) N RN ( k )
j
2j
return
Linear convolution
Circular convolution N = 6
12
12
10
10
0
0
9 n
9 n
9n
x ( n) [1,2,2], x 2 ( n)Circular
[1,2convolution
,3,2], N = 5
1
N=7
12
12
10
10
0
0
9 n
return
( )
Magnitude Response, N = 8
1
0.8
2
N
0.6
0.4
4
N
0.2
0
-1
-0.8
-0.6
-0.4
-0.2
0
0.2
frequency in pi units
0.4
0.6
0.8
0.4
0.6
0.8
Phase Response
pi
0.5
0
-0.5
-1
-1
-0.8
-0.6
-0.4
-0.2
0
0.2
return
X(k),N = 8
6
5
4
3
2
1
0
X (0)( )
7 k
26
6
X (1) ( X ( 3))4( )
X ( 2)N( ) N
N
5
2
0
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
return
X a ( j )
xa ( t ) 10 (0.8) t
10
50
40
FT
30
20
10
10
x(n)
15
20
25
0
-1
X ( e j )
10
50
40
DTFT30
20
10
10
-0.5
15
20
25
-2
-1
0
rad
0
pi
0.5
x ( n) R11 ( n)
50
10
40
8
6
DTFT30
20
10
-10
-5
x~ N ( n)
10
50
10
-2
-1
~
X N (k )
0
pi
40
DFS 30
6
4
20
10
X ( e j ) R ( e j )
-10
0
n
10
-10
0
k
10
x N (n)
50
10
40
8
6
DFT 30
20
10
X N (k )
-10
0
n
10
-10
0
k
10
return
X 1 ( e j )
x1 ( n)
RN (n)
R(e j )
X 2 (e j )
x2 ( n)
return
x ( n) [1,1,1,1]
DTFT
DFT
2
0
0.2
0.4
0.6
0.8
1.2
1.4
x ( n) [1,1,1,1,0,0,0,0]
1.6
1.8
2 pi
1.8
2 pi
1.8
2 pi
DTFT
DFT
2
0
0.2
0.4
0.6
0.8
1.2
1.4
1.6
x ( n) [1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0]
DTFT
DFT
2
0
0.2
0.4
0.6
0.8
1.2
1.4
1.6
return
x( n) cos(
0.48
n0<=n<=19
) cos(0.52n)
signal
x(n),
2
1
0
-1
-2
10
n
12
14
16
20
18
20
X 20 ( k )
15
10
5
0
0.1
0.2
0.3
0.4
0.5
pi
0.6
0.7
0.8
0.9
signal x(n), 0<=n<=19+80 zeros
2
1
0
-1
-2
10
20
30
40
50
n
60
70
80
20
90
100
X 100 ( k )
15
10
5
0
0.1
0.2
0.3
0.4
0.5
pi
0.6
0.7
0.8
0.9
signal x(n), 0<=n<=99
2
1
0
-1
-2
10
20
30
40
50
n
60
70
80
50
90
100
X 100 ( k )
40
30
20
10
0
0.1
0.2
0.3
0.4
0.5
pi
0.6
0.7
0.8
0.9
signal x(n), 0<=n<=99+300 zeros
2
1
0
-1
-2
50
100
150
200
n
250
300
350
60
400
X 400 ( k )
40
20
0.1
0.2
0.3
0.4
0.5
pi
0.6
0.7
0.8
0.9
return
Suppose
F0 10 Hz,
Determine
T0 , T , N
Solution
f h 4 kHz
1
1
T0
0.1 s
F0 10
1
1
1
T
0.125 ms
3
f s 2 f h 2 4 10
T0
0.1
N
800
3
T 0.125 10
N 2 m 210 1024
return

Chap3-Discrete Fourier Transform

Enviado por

Dados do documento

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Chap3-Discrete Fourier Transform

Enviado por

Direitos autorais:

Formatos disponíveis

Chapter 3

Discrete Fourier Transform

The DTFT provides the frequency-domain ( )

The Family of Fourier Transform

Copyright 2005. Shi Ping CUC

The Family of Fourier Transform

Fourier analysis is named after Jean Baptiste Joseph

Copyright 2005. Shi Ping CUC

The Family of Fourier Transform

Aperiodic-Continuous Fourier Transform

Copyright 2005. Shi Ping CUC

The Family of Fourier Transform

Periodic-Continuous Fourier Series

The Family of Fourier Transform

Copyright 2005. Shi Ping CUC

The Family of Fourier Transform

Periodic-Discrete DFS (DFT)

Copyright 2005. Shi Ping CUC

The Family of Fourier Transform

Continuous and Aperiodic

Aperiodic and Continuous

Continuous and Periodic(

T ) and Periodic ( T0)

Copyright 2005. Shi Ping CUC

The Discrete Fourier Series (DFS)

Periodic time functions can be synthesized as a linear

Periodic discrete-time function x ( n)

Copyright 2005. Shi Ping CUC

The Discrete Fourier Series (DFS)

Copyright 2005. Shi Ping CUC

The Discrete Fourier Series (DFS)

The X (k ) is a periodic sequence with fundamental

The Discrete Fourier Series (DFS)

Copyright 2005. Shi Ping CUC

The Discrete Fourier Series (DFS)

Relation to the z-transform

The Discrete Fourier Series (DFS)

Relation to the DTFT

The DFS is obtained by evenly sampling the DTFT at 2

The Discrete Fourier Series (DFS)

Copyright 2005. Shi Ping CUC

The Discrete Fourier Series (DFS)

The properties of DFS

Copyright 2005. Shi Ping CUC

The Discrete Fourier Series (DFS)

Copyright 2005. Shi Ping CUC

Copyright 2005. Shi Ping CUC

The Discrete Fourier Transform (DFT)

The DFS provided us a mechanism for numerically

Theoretically, we can take care of this problem by defining a

Practically, we define a new transform called the Discrete

This DFT is the ultimate numerically computable Fourier

Copyright 2005. Shi Ping CUC

The Discrete Fourier Transform (DFT)

Finite-length sequence & periodic sequence

x (n) Finite-length sequence that has N samples

The Discrete Fourier Transform (DFT)

The definition of DFT

X ( k ) DFT[ x ( n)] x ( n)W Nnk ,

Copyright 2005. Shi Ping CUC

The Properties of DFT

Circular shift of a sequence

DFT[ x(( n m )) N RN ( n)] W

Circular shift in the frequency domain