DTFT

The Discrete-Time Fourier
Transform
8/10/08 M. J. Roberts - All Rights Reserved 2
Extending the DTFS
Analogous to the CTFS, the DTFS is a good
analysis tool for systems with periodic
excitation but cannot represent an aperiodic
signal for all time
The discrete-time Fourier transform
(DTFT) can represent an aperiodic signal for
all time
DTFS-to-DTFT Transition
Pulse Train
This periodic rectangular-wave signal is analogous to the
continuous-time periodic rectangular-wave signal used to
illustrate the transition from the CTFS to the CTFT.
DTFS of
Pulse Train
As the period of the
rectangular wave
increases, the period of
the DTFS increases
and the amplitude of
the DTFS decreases.
Normalized
DTFS of
Pulse Train
By multiplying the DTFS
by its period and plotting
versus k / N
0
instead of k, the
amplitude of the DTFS stays
the same as the period increases
and the period of the normalized
DTFS stays at one.
The normalized DTFS approaches this limit as the
period approaches innity.
Denition of the DTFT

x n
[ ]
= X F ( )e
j 2Fn
dF
1
F
X F ( ) = x n
[ ]
e
j 2Fn
n=
F Form

x n
[ ]
=
1
2r
X e
jO
( )
e
jOn
dO
2r
[
F
X e
jO
( )
= x n
[ ]
e
jOn
n=~
~
Form
Forward Inverse
Forward Inverse
DTFT Properties
Linearity

x n
[ ]
+ y n
[ ]
F
X F ( ) + Y F ( )
x n
[ ]
+ y n
[ ]
F
X e
j
( )
+ Y e
j
( )
DTFT Properties
Time
Shifting

x n n
0
[ ]
F
e
j 2Fn
0
X F ( )
x n n
0
[ ]
F
e
jn
0
X e
j
( )
DTFT Properties

e
j 2F
0
n
x n
[ ]
F
X F F
0
( )
e
j
0
n
x n
[ ]
F
X e
j
0
( )
( )
Frequency
Shifting
Time
Reversal
x n
[ ]
F
X F ( )
x n
[ ]
F
X e
j
( )
DTFT Properties
Let z n
[ ]
= x n
[ ]
.
Time and Frequency Scaling
There is no scaling property
for this kind of time
scaling because there is no
unique relationship between
a signal and a decimated
version of that signal. Two
different signals can be
decimated to form the same
signal.
DTFT Properties
Time and Frequency Scaling
Let z n
[ ]
=
x n / m
[ ]
, n / m an integer
0 , otherwise
.
Then Z F ( ) = X mF ( ).
There is one kind of time scaling for which there is a time
scaling property.
This also implies a limited form of frequency scaling. If F is
changed to mF (m an integer), the effect in the time domain
is the insertion of m-1 zeros between adjacent points as described
above.
DTFT Properties
x n
[ ]
x n 1
[ ]
F
1 e
j 2F
( )
X F ( )
x n
[ ]
x n 1
[ ]
F
1 e
j
( )
X e
j
( )
Differencing
DTFT Properties

x m
[ ]
m=~
n
F

X F ( )
1 e
j 2rF
+
1
2
X 0 ( )o
1
F ( )
x m
[ ]
m=~
n
F

X e
jO
( )
1 e
jO
+
1
2
X e
j 0
( )
o
1
O
2r
_
,
Accumulation
DTFT Properties
As is true for other transforms, convolution in the time domain is
equivalent to multiplication in the frequency domain
Multiplication-
Convolution
Duality

x n
[ ]
y n
[ ]
F
X F ( ) Y F ( )
x n
[ ]
y n
[ ]
F
X e
j
( )
Y e
j
( )
x n
[ ]
y n
[ ]
F
X F ( ) Y F ( )
x n
[ ]
y n
[ ]
F
1/ 2 ( ) X e
j
( )
Y e
j
( )
DTFT Properties
DTFT Properties
Accumulation
Denition of a
Periodic Impulse
e
j 2Fn
n=
=
1
F ( )
The signal energy is proportional to the integral of the
squared magnitude of the DTFT of the signal over one
period.
Parsevals
Theorem
x n
[ ]
2
n=
= X F ( )
2
dF
1
x n
[ ]
2
n=
=
1
2
X j ( )
2
d
2

The Four Fourier Methods
Discrete Frequency
(Harmonic Number k)
Continuous Frequency
f or F
Continuous Time t
X k
1
]
= 1/ T
F
( )
x t
( )
e
j 2rkf
F
t
dt
T
F
[
x t
( )
= X k
1
]
e
j 2rkf
F
t
k =~
~
kf
F
f
1/ T
F
( )
dt
T
F
[
dt
~
~
[
k =~
~
df
~
~
[
X f
( )
= x t
( )
e
j 2r ft
dt
~
~
[
x t
( )
= X f
( )
e
j 2r ft
df
~
~
[
k t 1/ T
F
( )
dt
T
F
[

k =~
~

k n 1/ N
F
( )
n= N
F

k = N
F
f t dt
~
~
[
df
~
~
[

F n
n=~
~
dF
1
[
Discrete Time n
X k
1
]
= 1/ N
F
( )
x n
1
]
e
j 2rkn/ N
F
n= N
F
x n
1
]
= X k
1
]
e
j 2rnk / N
F
k = N
F
k / N
F
F
1/ N
F
( )

n= N
F
n=~
~
k = N
F
dF
1
[
X F
( )
= x n
1
]
e
j 2r Fn
n=~
~
x n
1
]
= X F
( )
e
j 2r Fn
dF
1
[
Relations Among Fourier Methods

Discrete Frequency Continuous Frequency
Continuous Time x t ( ) y t ( )
FS
X k
[ ]
Y k
[ ]
x t ( ) y t ( )
F
X f ( ) Y f ( )
Discrete Time x n
[ ]
y n
[ ]
FS
Y k
[ ]
X k
[ ]
x n
[ ]
y n
[ ]
F
X F ( ) Y F ( )

Continuous Time x t ( ) y t ( )
FS
T
0
X k
[ ]
Y k
[ ]
x t ( ) y t ( )
F
X f ( )Y f ( )
Discrete Time x n
[ ]
y n
[ ]
FS
N
0
Y k
[ ]
X k
[ ]
x n
[ ]
y n
[ ]
F
X F ( )Y F ( )
Multiplication-Convolution Duality
Continuous Time
1
T
0
x t ( )
2
dt
T
0
= X k
[ ]
2
k=
x t ( )
2
dt
= X f ( )
2
df
Discrete Time
1
N
0
x n
[ ]
2
n= N
0
= X k
[ ]
2
k= N
0
x n
[ ]
2
n=
= X F ( )
2
dF
1
Parsevals Theorem

Continuous Time x t t
0
( )
FS
X k
[ ]
e
j k
0
( )t
0
x t t
0
( )
F
X j ( )e
jt
0
Discrete Time x n n
0
[ ]
FS
X k
[ ]
e
j k
0
( )n
0
x n n
0
[ ]
F
X e
j
( )
e
jn
0
Time and Frequency Shifting

Continuous Time x t ( )e
+ j k
0
0
( )t FS
X k k
0
[ ]
x t ( )e
+ j
0
t F
X j
0
( )
( )
Discrete Time x n
[ ]
e
+ j k
0
0
( )n FS
X k k
0
[ ]
x n
[ ]
e
+ j
0
n F
X e
j
0
( )
( )
CTFT - CTFS Relationship
X f ( ) = X k
[ ]
f kf
0
( )
k=

CTFT - CTFS Relationship
X
p
k
[ ]
= f
p
X kf
p
( )
CTFT - DTFT Relationship
Let x
t ( ) = x t ( )
T
s
t ( ) = x nT
s
( )
t nT
s
( )
n=
and let x n
[ ]
= x nT
s
( )
.
X
F
F ( ) = X
f
s
F
( )
X
f ( ) = X
F
f / f
s
( )
X
F
F ( ) = f
s
X
f
f
s
F k ( )
( )
k=
There is an information equivalence between x
t ( )
and x n
[ ]
. They are both completely described by
the same set of numbers.
CTFT - DTFT Relationship
DTFS - DTFT Relationship
X F ( ) = X k
[ ]
F kF
0
( )
k=

DTFS - DTFT Relationship
X
p
k
[ ]
=
1
N
p
X kF
p
( )

DTFT

Încărcat de

Informații document

Descriere originală:

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

DTFT

Încărcat de

Drepturi de autor:

Formate disponibile

The Discrete-Time Fourier

8/10/08 M. J. Roberts - All Rights Reserved 18

8/10/08 M. J. Roberts - All Rights Reserved 25

There is an information equivalence between x

8/10/08 M. J. Roberts - All Rights Reserved 29

S-ar putea să vă placă și