4.3.

Qu trnh gii m lp i lp li
Trong tiu chun DVB-RCS, mi cp c ni ti mt im hnh sao QPSK, v mi bit
sao c ni trn knh I v knh Q, mt cch tng ng. Thc t, tn hiu s c gi i
m khng c iu ch s bit QPSK v qu trnh gii m lp i lp li gi tr u vo
tng bit mt. Do s hn ch ca qu trnh gii m lp i lp li, s xo bit (interleaving)
v s ta bit (puncturing) c lm tng k t mt cho hnh sao 8PSK, do , gii thut
gii m c chuyn thnh gii thut Max-Log-MAP tng k t.
Li trng thi (trellis) ca b m ha tch chp hi tip b ba nh phn m ta s
dng, c 16 trng thi, v mi nt c 8 k t vo v 8 k t ra. S k l trng thi m ha
thi gian k. K t dk gn lin vi qu trnh chuyn t thi gian k-1 ti k. Trng thi ca
li trng thi trng thi k-1 v k c nh s Sk-1 v Sk, mt cch tng ng.
Li (d k )

ln

P[d k i PObservation]
for i = 1, 2, 3, 4, 5, 6, 7
P[d k 0 PObservation]

ln

(Sk 1 ,Sk )
dk i
(Sk 1 ,Sk )
dk 0

p (Sk 1 ,Sk , y k )
p (Sk 1 ,Sk , y k )

(4.2)

Cp ch s (Sk-1,Sk) xc nh k t thng tin dk v k t c m ha xk, vi dk v

xk trong GF(23) vi cc thnh phn {0, 1, 2, 3, 4, 5, 6, 7} i din cho {000, 001, 010,
011, 100, 101, 110, 111}, mt cch tng ng, t thi gian k-1 ti k. Tng xc sut chung
p(Sk-1,Sk,yk) trong t s v mu s ca biu thc (4.2) c thc hin trn tt c cc qu
trnh chuyn i hin ti t Sk-1 ti Sk c nh du bng k t thng tin dk v k t
c m ha xk. Gi s mt knh truyn khng nh, tng xc sut chung p(S k-1,Sk,yk) c
th c tnh bng biu thc (3.12). S quy v trc v sau ca thut ton MAP c
vit trong biu thc (3.13) v (3.14). Xc sut truyn thnh phn branch c tnh bng
biu thc (3.15).
Mt cch nh nhau, ta biu din tng ng vi branch kt ni mt trng thi S k-1
ti Sk vi nh du branch dk=i nh , vi i = 0, 1, 2, 3, 4, 5, 6, 7 trong biu thc theo sau.
Sau s phn b ca k t chn l v thuc h thng nhn c c tnh bng

1|Page

p[y k Pd k i]
p[y sk Px sk (i)] p[y kp Px kp (i,Sk 1 ,Sk )]

2
2
E
1
exp s y ks , I x ks , I (i) y ks ,Q x ks ,Q (i)

N 0
N0

2
2
E
1

exp s y p,k I x p,k I (i,Sk 1 ,Sk ) y kp,Q x kp,Q (i,Sk 1 ,Sk )

N 0
N0

Lc y ks , I xks , I (i) yks ,Q xks ,Q (i)

2

Bk exp

Lc y kp, I xkp, I (i,Sk 1 ,Sk ) ykp,Q xkp,Q (i,Sk 1 ,Sk )

2

exp

Vi

y ks y kp

l k t h thng v chn l nhn c, v

y ks , I , y ks ,Q , y p,k I , y p,Q
k

nhn c m c truyn qua knh I v Q, mt cch tng ng;

t h thng v chn l cho i =0, 1, 2, 3,
s,I
k

x (i), x

s ,Q
k

p, I
k

(i), x (i,Sk 1 ,Sk ), x

p,Q
k

(i,Sk 1 ,Sk )

(4.3)

s
k

l gi tr k t

p
k

x (i), x (i,Sk 1 ,Sk )

4,

5,

6,

l k
7 v

l t m ca k t c nh x vo chm sao

8PSK, mt cch tng ng.

2
2
s ,I
s ,Q 2
s ,Q
2

s,I 2

1
Es y k x k (i) y k x k (i)

Bk

exp
2
2
2
2
N 0
N 0 y p,k I x kp, I (i,Sk 1 ,Sk ) y kp,Q x kp,Q (i,Sk 1 ,Sk )

(4.4)

4.3.1. Gii thut Max-Log-MAP cho m b ba nh phn

Gii thut Max-Log-MAP tng k t c ngun gc t m b ba nh phn vi s iu ch
bc cao 8PSK s dng s Gray. u tin, tm logarit ca branch
ki ( S k 1 , S k )
ln ki ( Sk 1 , S k )
lnP(y k Pd k ) P(d k )

1
Lc y sk, I x sk, I (i) y sk,Q xks ,Q (i)
lnP(d
k) K

2
1
Lc y kp, I x p,k I (i,Sk 1 ,Sk ) y p,Q
xkp,Q (i,Sk 1 ,Sk )
k
2

(4.5)
2|Page

Vi hng s K bao gm cc hng s v thnh phn chung s c xa trong giai on

sau. Tip n, tnh:
ln e k ( Sk 1 , Sk ) ek 1 (Sk 1 )
i

k (Sk )

S k 1

max [ ki ( Sk 1 , Sk ) k 1 (Sk 1 )]
S k 1

(4.6)

Tng t:
ln e k ( Sk 1 ,Sk ) e k (Sk )
i

k 1 (Sk 1 )

max [ ki ( S k 1 , S k ) k (Sk )]
S

(4.7)

Gii m lp i lp li, ta c:
0 (S0 ) N (SN ) for S0
N (SN ) 0 (S0 ) for SN

(4.8)

T l log-likelihood c biu din nh sau

Li (d k )

ln

ln

(Sk 1 ,Sk )
d k i
(Sk 1 ,Sk )
dk 0

ki ( S k 1 , S k ) k 1 (Sk 1 ) k (Sk )
k0 ( S k 1 , S k ) k 1 (Sk 1 ) k (Sk )

(Sk 1 ,Sk ) i ( S , S )
k
k 1 k
d k i

ek 1 (Sk 1 ) e k (Sk )

(Sk 1 ,Sk ) 0 ( S , S )
k
k 1 k

ek 1 (Sk 1 ) e k (Sk )

dk 0

for i = 1, 2, 3, 4, 5, 6, 7

(4.9)

Do , tch t l Log-likelihood thnh thng tin ni ti, h thng v bn ngoi, t:

i(e)
k

( S k 1 , S k )

Lc y p,k I x p,k I (i,Sk 1 ,Sk ) y p,Q
xp,Q
k
k (i,Sk 1 ,Sk )
2

exp

Ak

(4.11)

Vi

3|Page

2
2
2
2
E
1
p,Q

exp s y kp, I x p,k I (i,Sk 1 ,Sk ) y p,Q

k x k (i,Sk 1 ,Sk )

N 0
N
0

Ak

(4.12)

Do , logarit ca operation transition branch gim vi

ki ( e ) ( S k 1 , S k )
ln ki ( e ) ( Sk 1 , Sk )

1
Lc y kp, I x kp, I (i,Sk 1 ,Sk ) y kp,Q xkp,Q (i,Sk 1 ,Sk )
2

K
'

(4.13)

Vi hng s K gm cc hng s v phn chung s c xa trong trng thi sau.

Cch khc, tm t l Log-likelihood

ln

L (d )
^

(Sk 1 ,Sk )
d k i
(Sk 1 ,Sk )
dk 0

ki ( Sk 1 , Sk ) k 1 (Sk 1 ) k (Sk )
k0 ( S k 1 , S k ) k 1 (Sk 1 ) k (Sk )

Lc y ks , I x ks , I (i) y sk,Q xks ,Q (i)

2

ln
1

exp Lc yks , I x ks , I (0) y ks ,Q xks ,Q (0)

2

exp

ln

(Sk 1 ,Sk )

dk i
(Sk 1 ,Sk )
dk 0

for i = 1, 2, 3, 4, 5, 6, 7

P[d k

i]

P[d k

0]

ki (e) ( S k 1 , S k ) k 1 (Sk 1 ) k (Sk )

k0( e ) ( S k 1 , S k ) k 1 (Sk 1 ) k (Sk )

1
Lc y ks , I x ks , I (i) y ks ,Q xks ,Q (i)
2

1
Lc
2

k 1 k
ki (e) ( S k 1 , S k ) k 1 (Sk 1 ) k (Sk )

P[d k i ]
d k i
ln
ln (Sk 1 ,Sk ) 0( e )
P[d k 0]
d 0 k ( Sk 1 , Sk ) k 1 (Sk 1 ) k (Sk )

(S

,I

yks , I x ks
(0) y ks,Q x ks ,Q(0)

,S )

(4.14)

Do , thng tin ngoi ti bng

) 1 L y s , I x s , I (i) y s ,Q xs ,Q (i)

L
(d

i
k
c
k
k
k
k

L (d k )
2
e
i

4|Page

1
Lc y ks , I x ks , I (0) y sk,Q xsk,Q (0)
2

P[d k i ]
P[d k 0]

ln

(4.15)

S tnh ton xc sut k t cho b gii m tip theo vi i = 1, 2, 3, 4, 5, 6, 7 t b gii m

trc
P[d k i]
Li (d k ) Lei (dk ) ln
P[d k 0]

(4.16)

T
P[d k 0]
Le0 (dk ) ln
ln1 0
P[d k 0]
P[d k i ]
Lei (dk ) ln
P[ d k 0]

(4.17)

Sau :

P[dk=i]=

P[ d k i] e Li ( dk ) P[d k 0]

(4.18)

V:
7

P[d
i 0

i] 1

(4.19)

Ta c:
P[d k 0]

1
1 i 1 e Li ( dk )
7

P[ d k i]

e Li ( dk )
1 i 1 e Li ( dk )
7

(4.20)

S dng hm max

5|Page

ln P[d k 0] max[0, Lei (dk )]

ln P[d 0] Le (d ) ln P[ d 0]
k

for i = 1, 2, 3, 4, 5, 6, 7

(4.21)

4.3.2. S khi to v quyt nh cui cng

Ta khng c sn thng tin u tin (priori) cho vng lp u tin, nn ta khi to
Li (d k i ) 0 for i = 0, 1, 2, 3, 4, 5, 6, 7

(4.22)

Theo biu thc 4.20, ta c:

P[d k 0]

1
1 i 1 e
7

P[d k i ]

Lei ( dk )

e Li ( dk )
1 i 1 e
7

Lei ( dk )

1
8

1
8

(4.23)

S dng hm max:
ln P[ d k 0] max[0, Lei ( dk )] 0
ln P[ d 0] Le ( d ) ln P[d 0] 0
k

for i = 1, 2, 3, 4, 5, 6, 7

(4.24)

Tng t, v gi nh likelihood bng nhau cho tt c k t, ta c:

0 (s 0 ) 1 for s0
N (s N ) 1 for s N

(4.25)

Ly log
0 (S0 ) ln 0 (s 0 ) =0 for s0
N (SN ) ln N (s N ) 0 for sN

V khi to

(4.26)

0i 0

Gi tr tin cy ca knh:

6|Page

E
E
Lc 4a s 4a Rc b
N0
N0

(4.27)

Vi Rc l t l m.
Sau mt vi ln gii m lp i lp li, quyt nh c to theo:
dk i if L(dk ) Li (dk ) and Li (dk ) 0
for i = 1, 2, 3, 4, 5, 6, 7
dk 0 else

(4.28)

Vi
L(dk ) max( Li ( dk )) for i = 1, 2, 3, 4, 5, 6, 7

(4.29)

4.4. Kt qu m phng
Kch thc ba khung hnh khc nhau c tnh v hnh 4.6 biu din. ng cong bn
tri ca hnh 4.6 tng ng vi t l m ha ca 1/3, v bng thng hiu qu ca
1bit/s/Hz. ng cong bn pharie tng ng vi t l m ha 2/3, v bng thng hiu
qu ca 2bit/s/Hz.

Hnh 4.7 so snh BER ca m b ba nh phn CRSC vi m nh phn kp CRSC

trong tiu chun DVB-RCS. ng cong vi nt lin bn tri hnh 3.7 tng ng vi m
7|Page

nh phn kp, t l m ca , kch thc khi N = 228 (57 bytes) s dng s xo bit mc
1 v mc 2. ng gch l m b ba nh phn 8PSK, t l m ha 1/3 v mt s xo bit
mc 2. Tt c nhng ng cong ny l bng thng hiu qu ca 1bit/s/Hz. Chng rt
gn nhau.
ng cong nt lin bn phi ca hnh 4.7 l ATM (57 bytes vi t l ly mu
6/7 v bng thng hiu qu 1.7bit/s/Hz. ng nt lin vi ngi sao l m ta bit b ba
nh phn CRSC vi t ln m ha 2/3 v bng thng hiu qu 2bit/s/Hz, N = 152 (57
bytes). Hiu sut ca m b ba nh phn 8PSK tt hn so vi m nh phn kp QPSK ti
t l tn hiu trn nhiu cao hn vi bng thng hiu qu cao hn. c thng tin s gii
thch l thuyt ca kt qu ny, xem hnh 1.5 v gii thch tng ng trong chng 1.
Hnh 4.8 so snh hai chng trnh m ha v t l li khung (FER).

8|Page

4.5. Phng php iu ch m Turbo

iu ch li trng thi c m ha (Trellis coded modulation TCM) gii thiu
trong [101], [102] v [103] l mt phng php rt hiu qu gim nng lng yu cu
m khng lm tng yu cu v bng thng. Sng to ca TCM ch qu trnh iu ch
v m ha khng cn xem nh nhng thnh phn ring bit, nhng ng hn, n hot
ng ring bit. Phng php TCM c ng dng trong in thoi, v tinh v knh
radio sng cao tn s, vi li m ha ca 3-6dB thu c m khng gim bng thng
hoc t l d liu.
M turbo c th t c hiu sut li ng ch ti t l tn hiu trn nhiu thp
gn vi gii hn dung lng Shannon. Tuy nhin, phng php m ha nh phn mnh
khng ph hp cho h thng truyn thng gii hn bng thng, t c cng mt lc
li m ha ln v hiu sut bng thng cao, mt phng php tng qut c cha
trong m turbo vi s iu ch m ca li trng thi. Turbo Trellis Coded Modulation
(TTCM) c trnh by trong [104] l phn m rng ca m Turbo vi m thnh phn
c thay bng Ungerboeck TCM codes trong cc hnh thc c h thng quy, cha li
th ca m turbo ban u v m TCM. Phng php TTCM c gi l TCM ni song
song hoc TCM ni ni tip ty vo cu trc m. Vi hiu xut ng ch ca m turbo,
n n thun gm m turbo vi phng php iu ch a cp t li m ha ln v
hiu sut bng thng cao trn c AWGN v knh fading [105]. Trong phn ny, ta ni v
vi phng php m ha turbo hiu qu.

9|Page

4.5.1. iu ch m turbo nh phn thc dng (Pragmatic Binary

Turbo Coded Modulation)
Nhng n lc u tin trong vic kt hp m turbo vi iu ch a cp c m t trong
[109] v c gi l phng php tip cn thc dng TCM. Trong phng php ny, mt
b mapper gray c s dng sau khi m ha turbo cho a cp. Vic m ha v iu ch
l cc qu trnh ring bit v do n thc ra khng phi l qu trnh iu ch v m ha.
Gii m da trn b m ha nh phn, do c gi l pragmatic. Hnh 4.9 cho thy s
kt hp gi m turbo nh phn vi s iu ch M mc (MPSK, M-QAM). M turbo tiu
chun s dng hai m t l RSC nh l cc m thnh phn.

Cc bit kim tra chn l u ra ca cc m thnh phn c biu th l C 1 v C2,

mt cch tng ng. Hm ta bit c thm vo ti u ra ca m turbo tiu chun v do
n c th cha mt tp hp m ln vi cc t l khc nhau R = , vi l s bt chn l v
m l tng s bit m c nh x gray vo k t tn hiu phc tp truyn qua knh.
Trong biu thc [56], m thnh phn RSC nh phn trong m turbo nh phn c
thay bng m TCM Ungerboeck gi li cc li th ca c m turbo c in v m
TCM. Ti u nhn (xem hnh 4.10), gi tr log-likelihood c tnh cho mi ch s nh
phn c m ha b hngbng knh nhiu. Sau , trnh t ca cc gi tr bit loglikelihood c xo ngc li v phn tch ra trc khi cho qua b gii m turbo da
trn MAP, Log-MAP, thut ton Max-Log-Map, hoc SOVA.

10 | P a g e

4.5.2 Turbo Trellis Coded Modulation

Da trn phng php m ha a cp [107], mt phng php kt hp m turbo
vi qu trnh gii m a cp c gii thiu [56] v [108]. N lin quan n s kt ni
song song ca m trellis loi Ungerboeck quy vi m-ary chm sao tn hiu. Hnh 4.11
cho thy cu trc m ha gm hai b m ha xon quy vi nhau, mi b c theo l
mt nh x tn hiu v lin kt bi mt k t xo bit. Cng tc u ra ca b gii m
turbo ta m bng vic chn nhng k t k l ca mt b nh x v thm ch l biu
tng khc.

Cu trc gii m c biu din trong hnh 4.12. Ta biu din bng biu thc 2.23,
cho m turbo chp, u ra ca mi b gii m thnh phn c th c vit thnh tng ca
ba thnh phn, thnh phn h thng, u tin v bn ngoi, v ch phn bn ngoi c
cho qua cc b gii m khc. C th thy t hnh 4.11, qu trnh ny, c bit thng tin v
bit chn l c nh x ti cng mt k t iu ch v sau b nh hng bi cng mt
mu nhiu. Kt qu, phn h thng khng th tch t phn bn ngoi. Tuy nhin, n c
th tch u ra ca b gii m thnh hai phn: 1. Phn u tin 2. Phn thng tin bn ngoi
v h thng. Ch c phn 2 c cho qua cc b gii m khc c s dng nh cc
thng tin u tin. Phn ny thu c bng cch tr i cc thng tin u tin t u ra ca
n. Xc xut u tin ban u ca tt c cc k t thng tin gi s bng nhau lc bt u
gii m. Cc b gii m b qua cc k t m khng phi t b m ha tng ng ca n.
V d, nu b ta bit ly the odd numbered outputs of the first mapper and the even
numbered noisy outputs and the second then, the first mapper and the even numbered
noisy inputs and the second decoder ignores the odd ones. The only input in these
instances is the informaion received from the other decoder. For more detail about the
decoding procedure including the initializaiton, the reader is referred to [108]
S dng TTCM, li m ha khong 1.7 dB c th t c so vi TCM thng
thng, ti t l li trong vng ln cn ca 10 -4. iu ny c ngha rng m TCM turbo
t c s biu din gn hn Shannon trong knh AWGN [44].
11 | P a g e

Trong [108], hai b nh x 8PSK loi ungerboeck c kt hp vi hai m thnh

phn h thng thng vi b nh v = 3 c s dng. Thut ton MAP c p dng v
kch thc khi N = 1024 (256 bytes, 2048 bits) cho t l m 1/3 trong phng php
TTCM. Hiu qu bng thng l 2bit/s/Hz ti 5.9 dB (E s/N0). Hnh 4.13 biu th s so snh
ca m 8PSK/ b ba nh phn v m TTCM.
M 8PSK/ b ba nh phn c kch thc khung, N = 752 (282 bytes, 2256 bits), t
l m 2/3, b nh v = 4, s dng thut ton Max-Log-Map. Kt qu m phng cho thy
rng th ca 8PSK v TTCM rt gn. Hn na, ti u thu, phng php 8PSK trnh
s tnh ton gi tr log-likelihood cho mi s nh phn c m ha v thut ton MaxLog-MAP n gin v d thc hin.

12 | P a g e

4.6. Tng kt
Circular Recursive Systematic Convolutional (CRSC) gm m, hon v khng ng dng
v s ta bt khc nhau lm cho m turbo nh phn kp hiu qu v cung cp s sa li tt
hn so vi m nh phn i vi cc cch thc hin phc tp tng ng. Da vo li th
ca m turbo chp nh phn kp, m nh phn tam c thit k dng vi iu ch
8PSK.
Trong khi tiu chun DVB-RCS c s biu din tuyt vi, hiu qu bng thng
ca n gii hn bng s tiu bit v iu ch QPSK t hn 2bits/s/Hz/ t ti hiu
qu bng thng 2bits/s/Hz v cao hn, n cn qu trnh m ha v iu ch vi bng ch
ci M-ary (M>4). M CRSC nh phn tam mi c thit k cho iu ch 8PSK tng
hiu qu bng thng. M nh phn tam vn c cc c im ca m CRSC, nh trnh s
xung cp ca hiu qu ph. Hai trng thi lu thng phi c xc nh v trnh t phi
c m ha bn ln. S hon v khc nhau (s xo trn) c th thu c bng phng
trnh di truyn ch c mt s gii hn ca cc thng s.
M CRSC nh phn tam tha kt hu ht li th ca m CRSC nh phn kp, tuy
nhin, chng linh hot v hiu qu hn cho m ha d liu ca khi. c bit, bng 8-ary
ca m turbo nh phn tam khi kt hp vi 8PSK t c t l m cao hn v hn
2bits/s/Hz hiu qu bng thng. S xo trn bit c bit t m turbo nh phn c in
c thay bng s hot ng ca interleaving trong mt nhm cc bit v biu thc ca
cc thng s hon v c chn sao cho ging vi b interleaver mc 2 ca m DVBRCS. Cu trc ca vic gii m lp i lp li v thut ton Max-Log-MAP theo k t
c to t li trng thi khng nh phn trnh vn v s v gim s gii m phc
tp do mt tp cc rng buc trong m thnh phn, interleaver v mapping symbol 8PSK.
Nghin cu s b ny ca m CRSC nh phn tam 8-ary cho thy tim nng nh mt s
thay th cho nhiu hiu qu bng thng d liu truyn qua v tinh m khng tng yu cu
v bng thng. Hn th na, TTCM c nghin cu. Kt qu m phng cho thy rng
kt qu ca m CRSC nh phn tam gn vi qu trnh TTCM.

13 | P a g e