Você está na página 1de 13

2T2: The Discrete Fourier

Transform (2 of 2)

Xavier Serra
Universitat Pompeu Fabra, Barcelona
Index

● Review of DFT equation


● DFT of complex sinusoids
● DFT of real sinusoids
● Inverse-DFT
Discrete Fourier Transform
N −1
X [k ]= ∑ x [n]e
− j 2 π kn / N
k =0,. .. , N −1
n=0
DFT of complex sinusoid
j2 π k 0 n / N
x 1 [n]=e for n=0,. .. , N −1
N −1
X 1 [k ]= ∑ x 1 [n]e
− j 2 π kn / N

n=0
N −1
j 2 π k 0 n/ N − j 2 π k n/ N
=∑ e e
n=0
N −1
− j 2 π(k −k 0 )n/ N
=∑ e
n=0
− j 2 π(k −k 0 )
1−e
= − j 2 π(k −k )/ N
(sum of a geometric series)
1−e 0

if k ≠k 0 , denominator≠0 and numerator=0


thus X 1 [k ]= N for k =k 0 and X 1 [k ]=0 for k ≠k 0
DFT of any complex sinusoid

x 2 [n]=e j(2 π f 0 n+ϕ)


for n=0,. .. , N −1
N −1
X 2 [k ]= ∑ x 2 [n]e
− j 2 π kn / N

n=0
N −1
j (2 π f 0 n+ϕ) − j 2 π k n/ N
=∑ e e
n=0
N −1
− j 2 π(k / N − f 0 ) n
=e

∑e
n=0
− j 2 π(k / N − f 0 ) N
j ϕ 1−e
=e − j 2 π(k / N − f )
1−e 0
DFT of real sinusoids
A0 j 2 π k n/N A0 − j 2 π k n/ N
x 3 [n]= A0 cos(2 π k 0 n/ N )= e 0
+ e 0

2 2
N /2−1
X 3 [ k ]= ∑ − j 2 π kn / N
x 3 [n]e
n=−N /2
N /2−1
A0 j 2 π k n/ N A0 − j 2 π k n/ N − j 2 π kn / N
= ∑ ( e + e 0
)e
0

n=−N /2 2 2
N /2−1
A0 j 2 π k n/ N − j 2 π kn/ N N / 2−1 A0 − j 2 π k n/ N − j 2 π kn/ N
= ∑ e e0
+ ∑ e e 0

n=−N /2 2 n=−N /2 2
N /2−1
A0 − j 2 π(k −k )n/ N N /2−1 A0 − j 2 π(k + k )n/ N
= ∑ e + ∑ 0
e 0

n=−N /2 2 n=−N / 2 2
A0
=N for k =k 0, −k 0 ;0 for rest of k
2
Inverse DFT
N −1 N −1
1 1
x [n]=
N
∑ X [k ] s k [n]=
N
∑ X [ k ]e
j 2 π kn / N
n=0,1,. .. , N −1
k =0 k =0

Example:
X [ k ]=[0,4,0,0] ; N =4

1 1
x [0]= ( X ∗s)[ n=0]= (0∗1+4∗1+0∗1+0∗1)=1
4 4
1 1
x [1]= ( X ∗s)[ n=1]= (0∗1+4∗ j +0∗(−1)+0∗(− j))= j
4 4
1 1
x [ 2]= ( X ∗s)[ n=2]= (0∗1+ 4∗(−1)+0∗1+0∗(−1))=−1
4 4
1 1
x [3]= ( X ∗s)[ n=3]= (0∗1+4∗(− j)+0∗(−1)+0∗ j )=− j
4 4
Inverse DFT for real signals
j< X [k ] − j < X [k ]
X [k ]=|X [ k ]|e and X [−k ]=|X [ k ]|e
for k =0,1,... , N / 2
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-Noncommercial-
Share Alike license and code under Affero GPL license;
available from https://github.com/MTG/sms-tools
2T2: The Discrete Fourier
Transform (2 of 2)

Xavier Serra
Universitat Pompeu Fabra, Barcelona

Você também pode gostar