Table of Discrete-Time Fourier Transform Pairs:

x[n]ejn
X
Discrete-Time Fourier Transform : X() =
n=
1
Z
Inverse Discrete-Time Fourier Transform : x[n] = X()ejt d .
2 2

x[n] X() condition

1
an u[n] |a| < 1
1 aej
1
(n + 1)an u[n] |a| < 1
(1 aej )2
(n + r 1)! n 1
a u[n] |a| < 1
n!(r 1)! (1 aej )r

[n] 1

[n n0 ] ejn0

X
x[n] = 1 2 ( 2k)
k=

1 X
u[n] + ( 2k)
1 ej k=

X
ej0 n 2 ( 0 2k)
k=
X
cos(0 n) {( 0 2k) + ( + 0 2k)}
k=

X
sin(0 n) {( 0 2k) ( + 0 2k)}
j k=

2 2k
X X  
[n kN ]
k=
N k=
N


1 , |n| N


sin((N + 1/2))
x[n] =

sin(/2)
0 , |n| > N



1 , 0 || W


X() =
sin(W n) W Wn
 

= sinc
0 , W < ||

n

X() is periodic with period 2

3
Table of Discrete-Time Fourier Transform Properties: For each property, assume

DT F T DT F T
x[n] X() and y[n] Y ()

Property Time domain DTFT domain

Linearity Ax[n] + By[n] AX() + BY ()

Time Shifting x[n n0 ] X()ejn0

Frequency Shifting x[n]ej0 n X( 0 )

Conjugation x [n] X ()

Time Reversal x[n] X()

Convolution x[n] y[n] X()Y ()

1
Z
Multiplication x[n]y[n] X()Y ( )d
2 2

Differencing in Time x[n] x[n 1] (1 ej )X()

P 1 P
Accumulation k= x[k] 1ej
+ X(0) k= ( 2k)
dX()
Frequency Differentiation nx[n] j
d
P 2 1
|X()|2 d
R
Parsevals Relation for Aperiodic Signals k= |x[k]| 2 2