Professional Documents
Culture Documents
... -T -T
/2 0 T
/2 T ...
-p
/2 p
/2 t
La FFT y la Serie de Fourier
1
f(k)
0.5
0
0 1 k 2
La FFT y la Serie de Fourier
k=0:31
f=[(k<8)|(k>23)]
Plot(k,f,’o’)
La FFT y la Serie de Fourier
n 1 2 3 4 ... 16 17 18 19 ... 32
0.6
Espectro de Amplitud |
F(n)|
Para el tren de pulsos
F(n)
p=1, T=2
|
|
0.4
0.2
0
0 10 20 30 n
0.4
Obteniendo:
0.2
0
-50 0 50 w
La FFT y la Serie de Fourier
Coeficientes bCoeficientes
n
an
0
-0.5
0 10 20 30
La FFT y la Serie de Fourier
Tarea: Usar el siguiente código para generar 128
puntos de una función periódica con frecuencia
fundamental 0=120 (60 hertz) y dos armónicos
impares en el intervalo [0,T]:
N=128;
w0=120*pi;
T=1/60;
t=0:T/(N-1):T;
f=sin(w0*t)+0.2*sin(3*w0*t)+0.1*sin(11*w0*t);
N / 2 1 N / 2 1
e
j 0
2ijk /( N / 2 )
h2 j e 2ik / N
e
k 0
2 ijk /( N / 2 )
h2 k 1
H k0 e 2ik / N H k1 H k0 W k H k1 , (W e 2i / N )
We can do the same reduction of Hk0 to the transform of its N/4 even-
numbered input data and N/4 odd-numbered data.
For N = 2R, we can continue applying the reduction until we subdivide
the data into the transforms of length 1.
For every pattern of log2N number of 0’s and 1’s, there is one-point
transformation that is just one of the input number hn
H k1001...001 hn for some n
Fast Fourier Transform (FFT), II
For N=8
7
H k W jk h j h0 W k h1 W 2 k h2 W 3k h3 W 4 k h4 W 5 k h5 W 6 k h6 W 7 k h7
j 0
(h0 W 2 k h2 W 4 k h4 W 6 k h6 ) W k (h1 W 2 k h3 W 4 k h5 W 6 k h7 )
(h0 W 4 k h4 ) W 2 k (h2 W 4 k h6 ) W k [( h1 W 4 k h5 ) W 2 k (h3 W 4 k h7 )]
(h0 ) W 4 k (h4 ) W 2 k [h2 W 4 k (h6 )] W k [(h1 ) W 4 k ( h5 ) W 2 k [h3 W 4 k (h7 )]]
Diagrammatically (butterfly),
H k0 H k0 W k H k1
H k1 H k0 W k H k1 (k 0,1,..., N / 2 1)
There are N/2 butterflies for this stage of the FFT, and each butterfly
requires one multiplication
Fast Fourier Transform (FFT), III
So far, H 00 H 00 W 0 H 01 H 0
H10 H10 W 1 H11 H1
H 20 H 20 W 2 H 21 H 2
H 30 H 30 W 3 H 31 H 3
H 01 H 00 W 0 H k1 H 4
H11 H10 W 1 H11 H 5
H 21 H 20 W 2 H 21 H 6
H 31 H 30 W 3 H 31 H 7