Php bin i Fourier nhanh (Fast Fourier Transform)

Mt trong nhng ng dng thng gp ca php bin i Fourier nhanh (FFT) l

nhn hai s nguyn ln (v vic ny cng coi nh l nhn 2 a thc bin x = 10).

Fabrice Bellard l mt nh khoa hc my tnh ngi Php vit c chng

trnh C tnh ra gi tr ca: (2 m 43112609) 1. y l s nguyn t ln nht cho
n gi con ngi tm ra.

Quy tc ca ng nh sau: thay v phi c (43112609 1 = 43112608) php tnh

nhn cc s 2 li vi nhau, th nn tn dng li cc kt qu tnh ra trong qu trnh
, th ny: vit 43112609 thnh dng nh phn 1010010001110110001010000.
Ban u khi to mt bin tch ly s = 1, i t tri qua phi trn dy nh phn, nu
gp bit 1 th bnh phng s ri nhn vi 2. C nh vy cui cng s = 2 m
43112609.

Php nhn mt s vi s 2 ko c g ng ni, cn php bnh phng th chnh l

ng dng trn ca FFT. y c bit l hai s nguyn em nhn l ging nhau,
nn thi gian thc hin FFT s nhanh hn.

DFT Discrete Fourier Transform: Bin i Fourier ri rc

FD Frame Difference lch khung
FFT Fast Fourier Transform Bin i Fourier nhanh
FT Fourier Transform Bin i Fourier
HD Horizontal Difference lch trc ngang
IDCT Inverse DCT Bin i ngc DCT
IDFT Inverse DFT Bin i ngc DFT

PHP BIN I FOURIER RI RC V NG DNG T chng trc, ta

thy ngha ca vic phn tch tn s cho tn hiu ri rc. Cng vic ny thng
c thc hin trn cc b x l tn hiu s DSP. thc hin phn tch tn s, ta
phi chuyn tn hiu trong min thi gian thnh biu din tng ng trong min
tn s. Ta bit biu din l bin i Fourier)(X ca tn hiu x[n]. Tuy
nhin, )(X l mt hm lin tc theo tn s v do , n khng ph hp cho tnh
ton thc t. Hn na, tn hiu a vo tnh DTFT l tn hiu di v hn, trong khi
thc t ta ch c tn hiu di hu hn, v d nh mt bc nh, mt on ting ni
Trong chng ny, ta s xt mt php bin i mi khc phc c cc khuyt
im trn ca DTFT. l php bin i Fourier ri rc DFT (Discrete Fourier
Transform). y l mt cng c tnh ton rt mnh thc hin phn tch tn s
cho tn hiu ri rc trong thc t. Ni dung chnh chng ny gm: - DTFT ca tn
hiu ri rc tun hon. y l php bin i trung gian dn dt n DFT - DFT
thun v ngc - Cc tnh cht ca DFT - Mt s ng dng ca DFT - Thut ton
tnh nhanh DFT, gi l FFT