Trong knh v tuyn, tr s gy ra 2 hin tng ICI (inter-Carrier Interference) v ISI (IntraSymbol Interference).

Ghi ch:ICI mi ngi vn thi quen gi bng ISI trong l thuyt v tuyn (vn thng bit n l nhiu xuyn k t). Trong nhiu ti liu v OFDM ngi ta t li chnh xc hn l ICI (nhiu xuyn sng mang) phn bit vi ISI (v tr nn cc phin bn symbol t gy nhiu cho nhau, IntraSymols Interference). Gii quyt ICI ngi ta tng khong cch cho cc carrier cch xa nhau ( chng khng gy nh hng cho nhau) bng cch thm khong bo v Gaurding Time (GT) vo pha trc. GT c la chn sao cho GT>L, vi L l tr ti a ca knh v tuyn. Tr l do hin tng sng i theo nhiu ng (vi chiu di khc nhau) n ch. vi phm vi ph sng tm Km th L vo tm micro-giy. Th nhng trong khong thi gian GT, ngi ta truyn ci g? Nhiu ti liu qu quyt rng "khng th trng GT" v n ph hp vi c tnh thu pht, tn hiu cn phi c lin tc. Ti tm hiu nhng vn cha r v sao khng th truyn tn hiu ngt qung (nu khng truyn g trong GT). Bn no bit th jup ti vi Tuy nhin trong OFDM, ngi ta gn trong GT mt vi mu cui ln u to tnh tun hon cho n. iu ny xut pht t nh l chm (convolution theorem). Php ton Convolution trong min thi gian c bin din sang min tn s di dng php nhn khi hai tn hiu ny tri di v tn hoc mt trong chng phi tun hon. Thc t khng th to ra tn hiu v tn nn ngi ta mi to ra tnh tun hon cho k t OFDM. ngha quan trng ca vic lm ny l: v mt ton hc tn hiu pht x(t) qua knh truyn h(f,t) th tn hiu thu s l y(t)=x(t)*h(t) (*: php tnh convolution); bin i Fourier tng ng s l Y(f)=X(F).H(f). Mt khi biu din c sang php nhn th nhng suy hi trn knh truyn s c khc phc bng b equalizer, b ny s gain ("tng cng") cho nhng tn s b suy hao ti pha thu. iu ny ngha ln trong OFDM v cui cng k t OFDM s c tr v tn hiu trn min tn s, do equalizer verify trc tip cho cc knh mang ph. Tm li, vic copy mt s mu ui trong OFDM symbol gn vo phn GT u to tnh tun hon cho symbol v gip gii quyt vn khi phc tn hiu tt. Hn na cch lm ny gip cho b equalizer n gin, chnh xc v chi ph thp. Vy CP(Cyclic Prefix) gip OFDM gii quyt PS: cc bn c th tham kho convolution theory trn wikipedia. tt ICI v ISI.

Trc ht ta ni v DFT. DFT = Discrete Fourier Transform = Php bin i Fourrier Ri rc. Php ton ny c th thc hin c vi bt c gi tr nguyn dng N-DFT no. (N=1,2,3,4,5...10^100...). FFT l Fast Fourier Transform, l mt DFT c bit m s N-DFT c gi tr l 2^n. (N = 2, 4, 8, 16, ... 256, 1024, 2048, ....). Trong trng hp ny c thut ton thc hin php bin i DFT nh trn rt nhanh v hiu qu (nn mi gi l Fast FT). ( phc tp ca DFT thng thng l N^2, con FFT l N*log(N)). ngha: N-FFT (hay tng qut hn l N-DFT) l s sng mang con u ra (ngha l s tn symbol u ra v cng tng ng u vo na). Mt ngha quan trng khc na l nu B l bng thng ca ton b m h thng c c, th khong cch gia hai sng mang lin tip 'khong chng' B/N (Ti ni khong chng B/N v nhiu ngi nh ngha B l bng thng danh ngha hay mt ngha khc, cc bn nn coi k). Th nn nu N ln th B/N nh => d gy ra hin tng ICI hn (v khong cch gn hn, nhng tc cao hn), ngc li N nh th B/N ln nn hn ch ICI hn (nhng tc thp hn). Chnh v th m ra ci gi l 'thch nghi'. V d: Trong WiMAX thng c 3 loi: Loi 1: SC (Single Carrier) l dng 1 sng mang (khng dng FFT nh trn) Loi 2: OFDM l dng a sng mang, dng FFT nh trn, vi N = 256. (Ch l ci ny dng TDMA ghp knh a truy nhp) Loi 3: OFMMA l dng a sng mang, dng FFT nh trn N = 2048. (Ch l OFDMA khc vi OFDM heng, ci ny dng OFDMA ghp knh a truy nhp).