Table of Discrete-Time Fourier Transform Pairs:

∞
x[n]e−jΩn
X
Discrete-Time Fourier Transform : X(Ω) =
n=−∞
1
Z
Inverse Discrete-Time Fourier Transform : x[n] = X(Ω)ejΩt dΩ .
2π 2π

x[n] X(Ω) condition

1
an u[n] |a| < 1
1 − ae−jΩ
1
(n + 1)an u[n] |a| < 1
(1 − ae−jΩ )2
(n + r − 1)! n 1
a u[n] |a| < 1
n!(r − 1)! (1 − ae−jΩ )r

δ[n] 1

δ[n − n0 ] e−jΩn0
∞
X
x[n] = 1 2π δ(Ω − 2πk)
k=−∞
∞
1 X
u[n] + πδ(Ω − 2πk)
1 − e−jΩ k=−∞
∞
X
ejΩ0 n 2π δ(Ω − Ω0 − 2πk)
k=−∞
X∞
cos(Ω0 n) π {δ(Ω − Ω0 − 2πk) + δ(Ω + Ω0 − 2πk)}
k=−∞
∞
π X
sin(Ω0 n) {δ(Ω − Ω0 − 2πk) − δ(Ω + Ω0 − 2πk)}
j k=−∞
∞ ∞
2π 2πk
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(Ω)e−jΩn0

Frequency Shifting x[n]ejΩ0 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 − e−jΩ )X(Ω)

P∞ 1 P∞
Accumulation k=−∞ x[k] 1−e−jΩ
+ πX(0) k=−∞ δ(Ω − 2πk)
dX(Ω)
Frequency Differentiation nx[n] j
dΩ
P∞ 2 1
|X(Ω)|2 dΩ
R
Parseval’s Relation for Aperiodic Signals k=−∞ |x[k]| 2π 2π