8/4/2019 DIV Contents

Collective Table of Formulas

Discrete-time (DT) Fourier Transforms Pairs and Properties

(used in ECE301, ECE438, ECE538)

DT Fourier transform and its Inverse

∞ −jωn
DT Fourier Transform X (ω) = F (x[n]) = ∑ n=−∞ x[n]e
−1 1 2π
Inverse DT Fourier Transform x[n] = F (X (ω)) = 2π ∫ 0 X (ω)ejωn dω
DT Fourier Transform Pairs
x[n] ⟶ X (ω)
DTFT of a
+∞
complex e jw 0 n 2π ∑ l=−∞ δ(w − w 0 − 2πl)
exponential
(info)
DTFT of a
rectangular
w[n] = add formula here
window
1
an u[n], |a| < 1 1−ae −jω
1
(n + 1)an u[n], |a| < 1 (1−ae −jω )
2

1 1 1
sin(ω0 n)u[n] 2j
( − )
1−e −j(ω−ω0 ) 1−e −j(ω+ω0 )
cos(ω0 n) π∑ ∞k=−∞ (δ(ω − ω0 + 2πk) + δ(ω + ω0 − 2πk))
sin(ω0 n)
π
j
∑∞k=−∞ (δ(ω − ω0 + 2πk) − δ(ω + ω0 − 2πk))
1 2π ∑ ∞k=−∞ δ(ω − 2πk)
DTFT of a ⎧ 1, |n| < N 1 ,
Periodic 2π ∑ ∞
ak δ(ω − 2πk
)
⎨ N and x[n + N ] = x[n] k=−∞
Square ⎩ 0, N 1 < |n| ≤
N
Wave 2
∞ 2π ∞ 2πk
∑ k=−∞ δ[n − kN ] N
∑ k=−∞ δ(ω − N
)
δ[n] 1
1 ∞
u[n] 1−e −jω
+∑ k=−∞ πδ(ω − 2πk)
δ[n − n 0 ] e−jωn 0

n 1
(n + 1)a u[n], |a| < 1 (1−ae −jω )
2

DT Fourier Transform Properties

x[n] ⟶ X (ω)
1 π
multiplication property x[n]y[n] ∫ X(θ)Y (ω − θ)dθ
2π −π
convolution property x[n] ∗ y[n] X(ω)Y (ω)
time reversal x[−n] X(−ω)
d
Differentiation in frequency nx[n] j dω X(ω)
Linearity ax[n] + by[n] aX(ω) + bY (ω)
Time Shifting x[n − n 0 ] e−jωn 0 X(ω)
Frequency Shifting ejω0 n x[n] X(ω − ω0 )
Conjugation x ∗ [n] X ∗ (−ω)
x[n/k], if n = multiple of k,
Time Expansion x (k) [n] = { X(kω)
0, else.
https://www.projectrhea.org/rhea/index.php/Table_DT_Fourier_Transforms 1/2
 8/4/2019
Differentiating x[n] − x[n − 1]
in Time DIV Contents
(1 − e−jω )X(ω)
n 1
Accumulation ∑ k=−∞ x[k] 1−e −jω
X(ω)
Symmetry x[n] real and even X(ω) real and even
x[n] real and odd X(ω) purely imaginary and odd
Other DT Fourier Transform Properties
∞ π
Parseval's relation ∑ n=−∞ |x[n]| 2 = 1
2π
∫ −π |X(ω)| 2 dω

Back to Collective Table

https://www.projectrhea.org/rhea/index.php/Table_DT_Fourier_Transforms 2/2