DIV Contents https://www.projectrhea.org/rhea/index.

php/Discrete_Fourier_Transform_table

Collective Table of Formulas

Discrete Fourier transforms (DFT) Pairs and Properties

click here for more formulas

Discrete Fourier Transform Pairs and Properties (info)

Definition Discrete Fourier Transform and its Inverse
Let x[n] be a periodic DT signal, with period N.
kn
N−1
N-point Discrete Fourier Transform X[k] = ∑ n=0 x[n]e −j2π N
kn
Inverse Discrete Fourier Transform x[n] = (1/N) ∑ N−1
k=0 X[k]e
j2π N

Discrete Fourier Transform Pairs (info)

x[n] (period N ) ⟶ X N [k] (N point DFT)
∞ 1, if n = 0, ±N , ±2N, …
∑ k=−∞ δ[n + Nk] = { 1 (period N)
0, else.

∞ N, if n = 0, ±N , ±2N , …
1 (period N) N∑ m=−∞ δ[k + Nm] = {
0, else.
j2πk0 n
e N δ[((k − k 0 )) N ]
cos( 2π
N
k 0 n) N
2
(δ[((k − k 0 )) N ] + δ[((k + k 0 )) N ])
Discrete Fourier Transform Properties
x[n] ⟶ X[k]
Linearity ax[n] + by[n] aX[k] + bY [k]
2π
Circular Shift x[((n − m)) N ] X[k]e (−j N km)
Duality X[n] NX[((−k)) N ]
1
Multiplication x[n]y[n] N
X[k] ⊛ Y [k], ⊛ denotes the circular convolution
Convolution x(t) ⊛ y(t) X[k]Y [k]
x ∗[n] X ∗[((−k)) N ]
x ∗[((−n)) N ] X ∗[k]
R{x[n]} X ep [k] = 12 {X[((k)) N ] + X ∗[((−k)) N ]}
jI{x[n]} X op [k] = 1
2
{X[((k)) N ] − X ∗[((−k)) N ]}
1
x ep [n] = 2
{x[n] + x ∗[((−n)) N ]} R{X[k]}
1 ∗
x op [n] = 2
{x[n] − x [((−n)) N ]} jI{X[k]}
Other Discrete Fourier Transform Properties
Parseval's Theorem ∑ N−1 2
n=0 |x[n]| =
1
N
∑ N−1
k=0 |X[k]|
2

Go to Relevant Course Page: ECE 438

Go to Relevant Course Page: ECE 538

1 of 2 10/8/2016 2:11 PM
DIV Contents https://www.projectrhea.org/rhea/index.php/Discrete_Fourier_Transform_table

Back to Collective Table

2 of 2 10/8/2016 2:11 PM