3T1: Fourier Transform

properties (1 of 2)

Xavier Serra
Universitat Pompeu Fabra, Barcelona
Index
● Linearity
● Shift
● Symmetry
● Convolution
Linearity: a x 1 [n]+b x 2 [ n]⇔ a X 1 [ k ]+b X 2 [ k ]

DFT (a x 1 [n ]+b x 2 [n ])
N −1
= ∑ (a x 1 [n]+b x 2 [n])e
− j 2 π kn / N

n=0
N −1 N −1
= ∑ a x 1 [n ]e− j 2 π kn / N + ∑ b x 2 [n ]e− j 2 π kn / N
n=0 n=0
N −1 N −1
=a ∑ x 1 [n ]e +b ∑ x 2 [n ]e
− j 2 π kn / N − j 2 π kn / N

n=0 n=0
=a X 1 [k ]+b X 2 [k ]
Shift: x [n−n 0 ]⇔ e
− j 2 π k n0/ N
X [k ]

DFT ( x [n−n 0 ])
N −1
= ∑ x [n−n0 ]e
− j 2 π kn / N

n=0
N −1−n0
− j 2 π k (m+n0 )/ N
= ∑ x [m]e (m=n−n 0)
m=−n 0
N −1
− j 2 π kn0 / N
= ∑ x [m]e
− j 2 π km/ N
e
m=0
N −1
− j 2 π kn 0 / N
=e ∑ x [m]e
− j 2 π km/ N

m=0
− j 2 π kn 0 / N
=e X [k ]
Symmetry:
x [n]real ⇔ ℜ {X [ k ]}even and ℑ {X [k ]}odd
⇔ |X [ k ]|even and < X [ k ]odd
x [n]real and even ⇔ ℜ {X [ k ]}even and ℑ {X [ k ]}=0
⇔ |X [k ]|even and < X [ k ]=n π
Convolution: x 1 [n ]∗x 2 [ n]⇔ X 1 [ k ]× X 2 [ k ]

DFT ( x 1 [n]∗x 2 [n])

N −1
= ∑ ( x 1 [n]∗x 2 [n])e− j 2 π kn/ N
n=0
N −1 N −1
− j 2 π kn/ N
=∑ ∑ x1 [m] x 2 [n−m]e
n=0 m=0
N −1 N −1
= ∑ x 1 [m] ∑ x 2 [n−m]e − j 2 π kn/ N

m=0 n=0
N −1
=( ∑ x 1 [m]e − j 2 π km/ N
) X 2 [k ]
m=0
= X 1 [k ]× X 2 [ k ]
References and credits
● More information in:
– https://en.wikipedia.org/wiki/Discrete_Fourier_transform
● Reference on the DFT by Julius O. Smith:
https://ccrma.stanford.edu/~jos/mdft/
● Sounds from:
http://www.freesound.org/people/xserra/packs/13038/
● Slides released under CC Attribution-Non Commercial-
Share Alike license and code under Affero GPL license;
available from https://github.com/MTG/sms-tools
3T1: Fourier Transform
properties (1 of 2)

Xavier Serra
Universitat Pompeu Fabra, Barcelona