Documentos de Académico
Documentos de Profesional
Documentos de Cultura
Cuando la funcin f(t) est dada por una lista de N valores f(t1), f(t2), ...f(tN) se dice ue est discretizada o muestreada, entonces la inte!ral ue define la Transformada de Fourier"
F() = f ( t )e jt dt
#e convierte en la sumatoria
F(n ) = f ( t k )e
k =1
n ( k 1) j 2N
, para 1 n N
...
-T
-T
/2
0 -p
/2
/2 p /2
T
T ...
f(k)
0.5 0
Con lo ue o'tenemos 12 valores comple.os de F(n). 4stos valores son los coeficientes de la serie comple.a ordenados como si!ue"
n 1 2 1 5 ... 16 17 18 19 ... 12
F(n) c2
c1
c2
F(n) ueda"
n 1 ...
...
11
15
1:
16
17
18
19
...
12
F(n) c-16
c2
c1 ... c1:
0.4
0.2
10
20
30
0.4
<'teniendo"
0.2
-50
50
c n = (a n jb n ), c n = (a n + jb n )
1 2 1 2
,odemos o'tener
,ara el e.emplo se o'tiene" a202.:, an0'n02 (para n par), adems para n impar"
n 1 1 : 7 9 11 11 1:
a 0 = c 0 , a n = 2 Re(c n ), b = 2 Im(c n )
Coeficientes bn Coeficientes an
0
-0.5
10
20
30
?sando una funcin peridica diferente a la su'ra+ada" a) Braficar la funcin. ') <'tener + !raficar el espectro de amplitud de la seCal usando la funcin FFT
3edidores $i!itales
La FFT )a )ec)o posi'le el desarrollo de e uipo electrnico di!ital con la capacidad de clculo de espectros de frecuencia para seCales del mundo real, por e.emplo" 1) <sciloscopio di!ital Fu%e 121 ($ 18,600.00 M.N.) 2) <sc. di!ital Te%troni& TD#722, ($3,796 dls) 1) ,oEer ,latform ,,-5122
3edidores $i!itales
El Flu e 1!3 s"ope me#er
3edidores $i!itales
Te #ron$% T&'7!0( (os"$los"op$o d$)$#al)
3edidores $i!itales
*nal$+ador de po#en"$a ((,-300 4s un e uipo especiali(ado en monitoreo de la calidad de la ener!Fa" permite medicin de 5 seCales simultneas (para sistemas trifsicos)
= =
N / 2 1 j =0
e e
j =0
2i ( 2 j ) k / N
h2 j +
N / 2 1 j =0
e
2ik / N
2 i ( 2 j +1) k / N
h2 j +1 h2 k +1
N / 2 1
2ijk /( N / 2 )
h2 j + e
N / 2 1 k =0
2 ijk /( N / 2 )
1 1 = H k0 + e 2ik / N H k = H k0 + W k H k , (W e 2i / N ) "e can do the same reduction of Hk0 to the transform of its N!# e$en% numbered input data and N!# odd%numbered data. For N & 2', e can continue appl(ing the reduction until e subdi$ide the data into the transforms of length ). For e$er( pattern of log2N number of *+s and )+s, there is one%point transformation that is ,ust one of the input number hn
1001...001 Hk = hn
for some n
= ( h0 + W 2 k h2 + W k h + W # k h# ) + W k (h1 + W 2 k h! + W k h" + W # k h7 ) = ( h0 + W k h ) + W 2 k (h2 + W k h# ) + W k [(h1 + W k h" ) + W 2 k (h! + W k h7 )] = ( h0 ) + W k ( h ) + W 2 k [h2 + W k (h# )] + W k [(h1 ) + W k (h" ) + W 2 k [h! + W k (h7 )]]
/ince WN!2 & %), Hk* and Hk) ha$e period N!2,
1 H k = H k0 + W k H k , 1 H k + N/ 2 = H k0 W k H k
for k = 0,1,..., N / 2 1
Diagrammaticall( (butterfl(),
H k0
1 Hk
1 H k0 + W k H k
1 H k0 W k H k
(k = 0,1,..., N / 2 1)
There are -!2 butterflies for this stage of the FFT, and each butterfl( re0uires one multiplication
H10
0 H2
H !0
1 H0 1 H1 1 H2 1 H!
The splitting of 1H23 into t o half%size DFTs can be repeated on H2* and H2) themsel$es,
H k0 = H k00 + W 2 k H k01 ,
1 10 11 Hk = Hk + W 2k H k ,
H100
01 H0
H101
10 H0 10 H1 11 H0 11 H1
H100 W 2 H101 = H !0
10 11 1 H0 +W 0H0 = H0 10 11 1 H1 + W 2 H1 = H1 10 11 1 H0 W 0H0 = H2 10 11 1 H1 W 2 H1 = H!
$ 1H2**3 is the N!#%point DFT of 1h*, h#,4, h-%#3, $ 1H2*)3 is the N!#%point DFT of 1h2, h5,4, h-%23, $ 1H2)*3 is the N!#%point DFT of 1h), h6,4, h-%73, $ 1H2))3 is the N!#%point DFT of 1h7, h8,4, h-%)3, $ -ote that there is a re$ersal of the last t o digits in the binar( e9pansions of the indices j in 1h,3.
For each of the log2N stages, there are N!2 multiplications, hence there are (N!2)log2N multiplications needed for FFT.
$ <uch less time than the (N%))2 multiplications needed for a direct DFT calculation. $ "hen -&)*2#, FFT&6)2* multiplication, DFT&),*#5,62= sa$ings b( a factor of almost 2**.