C s l thuyt thng tin

Chng 3: M ha knh
M Khi tuyn tnh
TS. Phm Hi ng
02/12/2013
Slice 1 Trng H Bch Khoa H Ni
Phn 1: Khi nim c bn
M knh/M sa li
M ha knh (channel Coding) hay cn gi l m sa li (Error
Correction coding) l k thut khng ch, pht hin v sa li
trong qu trnh truyn d liu qua knh c nhiu.
M sa li s dng thng tin d tha (redundancy) c m ha
thm vo d liu pha bn pht. Thng tin d tha s c pha
thu s dng sa li - m khng cn yu cu pht li tin.


02/12/2013
Slice 2 Trng H Bch Khoa H Ni
Phn 1: Khi nim c bn
Phn loi li
Li c lp thng k: Li xut hin trong qu trnh truyn tin trn
knh truyn, xut hin c lp khng lin quan ti nhau. V d:
nhiu Gaussian.
Li chm: Li c phn b lin h vi nhau.

02/12/2013
Slice 3 Trng H Bch Khoa H Ni
Phn 1: Khi nim c bn
V d: Knh truyn tin khng nh
(Binary Symmetric Memoryless Channel).
Li xy ra vi bit 0 v 1 vi cng xc sut p (symmetric)
Li xy ra ngu nhin v c lp gia cc bit (memoryless)

02/12/2013
Slice 4 Trng H Bch Khoa H Ni
1-p
IN OUT
0 0
1 1
1-p
p
p
p l xc sut li BER
Bit Error Rate (BER)
Phn 1: Khi nim c bn
V d: Knh truyn tin a ng

02/12/2013
Slice 5 Trng H Bch Khoa H Ni
receiving signal
time
strength
0
sending signal
Phn 1: Khi nim c bn
V d: Knh truyn tin a ng

02/12/2013
Slice 6 Trng H Bch Khoa H Ni
RX power
TX power
Channel Fading
Phn 1: Khi nim c bn
Phn loi m sa li:
M khi (block codes): thng tin c m ha v chn
thm phn d tha theo tng khi.
M khi
M khi tuyn tnh
M vng CRC
M BCH, Reed-Solomon, LDPC
M chp (Convolutional codes): thng tin c bin i
theo cc hm truyn t (php tch chp). Khng c gii
hn r rng gia thng tin v phn d tha.
M chp (covolutional codes)
M Turbo

02/12/2013
Slice 7 Trng H Bch Khoa H Ni
Phn 2: Cc khi nim c bn ca m ha sa li
Tc m
Khong cch Hamming (Hamming distance)
Khong cch ti thiu (minimum distance)
Ma trn sinh, m trn kim tra chn l.
02/12/2013
Slice 8 Trng H Bch Khoa H Ni
Phn 2: Cc khi nim c bn ca m ha sa li
Tc m
Gi thit l tp hp 2 phn t 0 v 1.
biu din vector n phn t ca
S binary l tp hp im trong khng gian
M l m chp nhn bit u vo v to ra bit u ra.

nh ngha: tc m ca m l


V d: M lp (repetition code) nhn 1 bit u vo v to
ra n bit lp li u ra. Tc m l

02/12/2013
Slice 9 Trng H Bch Khoa H Ni
2
2
n
2
( , ) n k
2
k
2
n
( , ) n k
k
n
( , ) n k
k
R
n
=
( ,1) n
1
R
n
=
Phn 2: Cc khi nim c bn ca m ha sa li
Ma trn sinh
Vi biu din thng tin (message).
l t m (codeword) ca m lp


Qu trnh m ha c biu din di dng ma trn. Ma trn
sinh ca m lp l

02/12/2013
Slice 10 Trng H Bch Khoa H Ni
m
C
( ,1) n
| |
, , ,... C m m m m =
C mG =
| |
1,1,1,...,1 G =
G
Phn 2: Cc khi nim c bn ca m ha sa li
Biu din m lp (3,1) trong khng gian





Khong cch Hamming trong m binary c tnh bng s
cc im khc bit trong 2 t m.

02/12/2013
Slice 11 Trng H Bch Khoa H Ni
| |
1
1,1,1 C =
| |
0
0, 0, 0 C =
| |
| |
1
2
12
1, 0,1,1,1, 0
1,1, 0,1,1,1
3
C
C
d
=
=
=
Phn 2: Cc khi nim c bn ca m ha sa li
nh ngha : Khong cch ti thiu (min distance) l
khong cch Hamming nh nht gia 2 t m bt k.


Phng php gii m ML: tm kim t m c khong cch
gn nht vi t m thu c.
02/12/2013
Slice 12 Trng H Bch Khoa H Ni
Phn 2: Cc khi nim c bn ca m ha sa li
Lin h gia khong cch Hamming ti thiu v kh nng
pht hin v sa li.

Vi m binary
Kh nng pht hin li
Kh nng sa li
02/12/2013
Slice 13 Trng H Bch Khoa H Ni
( , ) n k
min
1 d
min
1
2
d
t

(
=
(

Phn 2: Cc khi nim c bn ca m ha sa li
T l li bit (BER Bit Error Rate) ca m lp trong mi
trng knh AWGN (Additive White Gaussian Noise)

02/12/2013
Slice 14 Trng H Bch Khoa H Ni
Phn 2: Cc khi nim c bn ca m ha sa li
02/12/2013
Slice 15 Trng H Bch Khoa H Ni
V d m kim tra chn
Trong trng hp n = k+1, bn tin c b sung thm 1
bit kim tra chn l
Trong trng hp s chn cc bit 1, Bit kim tra chn l
c gi tr

Trong trng hp s l cc bit 1, bit kim tra c gi tr

Bit kim tra chn l c thm vo m bo s chn cc
bit 1 trong t m.
M kim tra chn l ch pht hin c (ti a) 1 li,
khng c kh nng sa li.
1
(mod 2)
k
i
i
q m
=
=

1 q
Phn 2: Cc khi nim c bn ca m ha sa li
02/12/2013
Slice 16 Trng H Bch Khoa H Ni
V d 1: M kim tra chn l (6,5)
Bn tin m = (10110) => t m c=(101101)
Bn tin m = (11011) => t m c=(110110)

Phn 2: Cc khi nim c bn ca m ha sa li
02/12/2013
Slice 17 Trng H Bch Khoa H Ni
V d 2: Bng m kim tra chn l (4,3)

Dataword Codeword
1 1 1
0 1 1
1 0 1
0 0 1
1 1 0
0 1 0
1 0 0
0 0 0
1 1 1 1
0 0 1 1
0 1 0 1
1 0 0 1
0 1 1 0
1 0 1 0
1 1 0 0
0 0 0 0
M khi (n,k) c biu din dng vector
Bn tin d=(d
1
d
2
.d
k
)
T m c=(c
1
c
2
..c
n
)
M khi c xy dng
c=dG
Vi G l ma trn sinh

(
(
(
(

=
(
(
(
(

=
k
2
1
2 1
2 22 21
1 12 11
a
.
a
a
...
. ... . .
...
...
G
kn k k
n
n
a a a
a a a
a a a
Phn 3: M khi tuyn tnh
Phn 3: M khi tuyn tnh
m bo 2 bn tin khng c chung 1 t m
(khng th gii m/sa li), cc h s phi c
lp tuyn tnh.
Nu l 2 t m bt k
cng l 1 t m

H qu: khi gm ton bit 0 cng l 1 t m
1
c a
k
i i
i
d
=
=

a
i
i
c
k
c
i k
c c c = +
Kh nng sa li ca m khi tuyn tnh
Khong cch Hamming ca m khi tuyn tnh
l khong cch Hamming nh nht ca cc t
m khc 0
tm khong cch Hamming nh nht, cn
tm kim tra 2
k
t m tm khong cch
Hamming nh nht.

Phn 3: M khi tuyn tnh
Phn 3: M khi tuyn tnh
Vi m (4,2), c ma trn sinh


Vi d=[1,1]
(

=
1 0 1 0
1 1 0 1
G
0 1 1 1
_ _ _ _
1 0 1 0
1 1 0 1
c
=
+
=
a
1
= [1011]
a
2
= [0101]
V d 1: m khi tuyn tnh
Error Syndrome
sa li m khi tuyn tnh, s dng phng php
Error Syndrome
Nu c
r l
t m thu c pha thu, vector pht hin
li (error syndrome) s ca c
r
s = c
r
H
T
Nu c
r
b li, gi e l vector li
c
r
= c + e
do
s = (c + e) H
T
= cH
T
+ eH
T
s = 0 + eH
T
Vector syndrome c gi tr ch ph thuc vo vector
li e.
Phn 3: M khi tuyn tnh Gii m sa li
Error Syndrome
Nhn xt: nu cng vector e vi cc t m
khc th vn thu c 1 vector syndrome.
Tng cng c 2
(n - k)
syndromes, 2
n
vector li.
V d: vi m (3,2), c 2 syndromes v 8 vector li
e. R rng khng th sa tt c cc li trong
trng hp ny.
V d: vi m (7,4) c 8 syndromes v 128 vector
li e.
V vy, vi 8 syndromes, ta cn b tr cc gi tr
khc nhau sa c 7 li (li 1 bit) v 1
trng hp khng li s=0.

Phn 3: M khi tuyn tnh Gii m sa li
Bng lit k li
Bng lit k li c xy dng nh sau:
c
1
(all zero)
e
1

e
2

e
3


e
N

c
2
+e
1

c
2
+e
2

c
2
+e
3


c
2
+e
N

c
2

c
M
+e
1

c
M
+e
2

c
M
+e
3


c
M
+e
N

c
M






s
0

s
1

s
2

s
3


s
N

Cc hng u c
chung gi tr
syndrome
Cc hng khc
nhau c vector
syndrome khc
nhau
Bng c 2
k
ct (tng ng vi cc t m hp l)
v 2
n-k
hng (s lng cc syndrome)
Phn 3: M khi tuyn tnh Gii m sa li
Bng lit k li c xy dng theo cch
Lit k tt c cc li 1 bit
Lit k tt c cc li 2 bit

Kim tra m bc cc li c b sung vo bng c vector
syndrome khc nhau. Vic xy dng bng kt thc khi s
dng ht cc vector syndrome.

gii m:
Tnh vector syndrome theo cng thc s = 0 + eH
T
Tra bng tng ng, tm vector li e tng ng.
Cng modulo vector e v t m thu c gii m
c = c
r
+ e

Phn 3: M khi tuyn tnh Gii m sa li
Phn 3: M khi tuyn tnh M h thng
M h thng c phn thng tin v phn kim tra
c phn tch trong t m, phn thng tin l
khng thay i so vi ban u
Ma trn sinh ca m h thng c dng
| | P | I
.. 1 .. 0 0
.. .. .. .. .. .. .. ..
.. 0 .. 1 0
.. 0 .. 0 1
G
2 1
2 22 21
1 12 11
=
(
(
(
(

=
kR k k
R
R
p p p
p p p
p p p
k R
R = n - k
Vi m h thng, ma trn kim tra c xy dng
G = [ I | P] and so H = [-P
T
| I]

V d: m (7,4) vi khong cch Hamming d
min
= 3
| |
(
(
(
(

= =
1 1 1 1 0 0 0
0 1 1 0 1 0 0
1 0 1 0 0 1 0
1 1 0 0 0 0 1
P | I G | |
(
(
(

= =
1 0 0 1 0 1 1
0 1 0 1 1 0 1
0 0 1 1 1 1 0
I | P - H
T
Phn 3: M khi tuyn tnh M h thng
Tm vector syndrome trong v d
T m thu c c
r
= [1101001]
| | | | 0 0 0
1 0 0
0 1 0
0 0 1
1 1 1
0 1 1
1 0 1
1 1 0
1 0 0 1 0 1 1 H c s
T
r
=
(
(
(
(
(
(
(
(
(

= =
Phn 3: M khi tuyn tnh M h thng
M Hamming l dng c bit ca m khi tuyn tnh
Vi mi
T m c di
Bn tin c di
Tc m

Khong cch Hamming , kh nng sa 1 li
M Hamming l m c tc m R ln nht vi cng
khong cch Hamming
Phn 4: M Hamming
2 r >
2 1
r
n =
2 1
r
k r =
1
2 1
r
k r
R
n
= = +

min
3 d =
min
3 d =
M Hamming (7,4) dng h thng
| |
(
(
(
(

= =
1 1 1 1 0 0 0
0 1 1 0 1 0 0
1 0 1 0 0 1 0
1 1 0 0 0 0 1
P | I G | |
(
(
(

= =
1 0 0 1 0 1 1
0 1 0 1 1 0 1
0 0 1 1 1 1 0
I | P - H
T
(
(
(
(

=
1 0 0 1 0 1 1
0 1 0 1 0 1 0
0 0 1 1 0 0 1
0 0 0 0 1 1 1
G
(
(
(

=
1 0 1 0 1 0 1
1 1 0 0 1 1 0
1 1 1 1 0 0 0
H
Phn 4: M Hamming (7,4)
M Hamming (7,4) dng khng h thng
V d: m Hamming (7,4) khng h thng
d = 1011
c = 1110000
+ 0101010
+ 1101001
= 0110011

e = 0010000
c
r
= 0100011

s = c
r
H
T
= eH
T
= 011
Ch : gi tr vector syndrome l v tr li.

Phn 4: M Hamming (7,4)
Phn 4: M Hamming (7,4) BER
For a given channel bit error rate (BER), what is the BER
after correction (assuming a memoryless channel, i.e., no
burst errors)?
To do this we will compute the probability of receiving 0,
1, 2, 3, . errors
And then compute their effect
Bit Error Rates after Decoding
Example A (7,4) Hamming code with a channel BER of 1%,
i.e., p = 0.01
P(0 errors received) = (1 p)
7
= 0.9321
P(1 error received) = 7p(1 p)
6
= 0.0659


P(3 or more errors) = 1 P(0) P(1) P(2) = 0.000034
002 . 0 ) 1 (
2
6 7
received) errors P(2
5 2
=

= p p
Bit Error Rates after Decoding
Single errors are corrected, so,
0.9321+ 0.0659 = 0.998 codewords are correctly
detected
Double errors cause 3 bit errors in a 7 bit codeword, i.e.,
(3/7)*4 bit errors per 4 bit dataword, that is 3/7 bit errors
per bit.
Therefore the double error contribution is 0.002*3/7 =
0.000856
Bit Error Rates after Decoding
The contribution of triple or more errors will be less than
0.000034 (since the worst that can happen is that every
databit becomes corrupted)
So the BER after decoding is approximately 0.000856 +
0.000034 = 0.0009 = 0.09%
This is an improvement over the channel BER by a factor of
about 11
Perfect Codes
So,
errors 3 to up correct to
6
2) - 1)(n - n(n
2
1) - n(n
n 1
errors 2 to up correct to
2
1) - n(n
n 1
error 1 to up correct to 1 2
+ + + >
+ + >
+ > n
R
If equality then code is Perfect
Only known perfect codes are SEC Hamming
codes and TEC Golay (23,12) code (d
min
=7).
Using previous equation yields
) 12 23 ( 11
2 2 2048
6
2) - 1)(23 - 23(23
2
1) - 23(23
23 1

= = = + + +