Vd: gi s ta c cc h s bin i nh sau:

Ta tin hnh m ha qua 3 pass v to ra chui bit truyn i; sau tin hnh gii m t cc
bit ny.
First pass:

log

Khi to: n log 2 max i , j ci , j

26 4

LIP = H: 0,0 26, 0,1 6, 1,0 7, 1,1 7

LIS:

0,1 D, 1,0 D, 1,1 D

LSP:
Sorting pass:
LIP: h s ta (0,0) > 2 4 h s ta ny l quan trng

truyn bit 1, tip

theo l bit 0 chng t h s ny l dng v chuyn ta n LSP. Ba h s cn li l khng
quan trng truyn 3 bit 0 v vn chng LIP.

LIS: kim tra cc con chu cht ca ta (0,1) (tc l 13, 10, 6 v 4)

tt c
u khng quan trng truyn 1 bit 0. Tng t, con chu cht ca ta (1,0) v (1,1) u
khng quan trng truyn 2 bit 0.

Refinement pass: khng c phn t no nn khng lm g.

Qua bc first pass ta truyn i 8 bit: 10 000 000
Quantization-step update: gim n i 1: n=3
Second pass:
Khi to: ngng n 2 3 8
LIP:

0,1 6, 1,0 7, 1,1 7

LIS:

0,1 D, 1,0 D, 1,1 D

LSP: 0,0 26
LIP: c 3 h s u khng quan trng

truyn 3 bit 0.

LIS: u tin kim tra con chu cht,ca ta (0,1)

hai h s 13 v 10 ln hn gi tr

ngng nn chng quan trng, tc l D (0,1) l quan trng ta gi i 1 bit 1 v kim tra con ca ta
(0,1), tc l O (0,1) . Con u tin c gi tr l 13 quan trng v dng gi i 1 bit 1 v 1 bit
0; con th 2 cng tng t

tip theo u khng quan trng

gi i 1 bit 1 v 1 bit 0; ta chuyn ta ca 2 con n LSP; 2 node con

gi i 2 bit 0 v chuyn chng n LIP. V L(0,1)

nn ta loi

D (0,1) ra khi LIS. Tng t vi D (1,0) v D (1,1) , ta thy cc phn t u khng quan trng

gi i 2 bit 0.
Refinement pass:
LSP t pass trc: ch c 1 phn t c h s l 26. MSB th 3 ca 26 l 1

1.
Qua bc second pass ta truyn i 13 bit: 000 11010 00 1.
Quantization-step update: gim n i 1: n=2
Third pass:

Khi to: ngng n 2 2 4

LIP:

0,1 6, 1,0 7, 1,1 7, (1,2) 6, (1,3) 4

LIS:

1,0 D, 1,1 D

LSP: 0,0 26, 0,2 13, 0,3 10

Cch lm tng t trn, chui bit s l: 10111010101101100110000010.
Danh sch l:
LIP:

3,0 2, 3,1 2, 2,3 3, (3,2) 2, (3,3) 0

LIS:
LSP:

0,0 26, 0,2 13, 0,3 10, 0,1 6, 1,0 7, 1,1 7,

1,2 6, 1,3 4, 2,0 4, (2,1) 4, (2,2) 4

truyn bit

Gii m:
First pass:
Khi to:
LIP:

0,0 , 0,1 , 1,0 , 1,1

LIS:

0,1 D, 1,0 D, 1,1 D

LSP:
Ta gi s rng gi tr ban u ca n c truyn n b gii m (n=4), nh ta thit lp
c gi tr ngng ban u l 16. Chui bit c truyn i first pass l 10 000 000, nh vy
h s u tin ca LIP l quan trng v dng, cn li tt c cc h s khc u khng quan
trng. H s quan trng c khi phc s c gi tr c tnh l 1.5 2 4 24
Nh vy qua first pass, cc h s c khi phc li l:

Danh sch cc tp hp c cp nht li nh sau:

LIP:

0,1 , 1,0 , 1,1

LIS:

0,1 D, 1,0 D, 1,1 D

LSP:

0,0

Second pass:
Gim n i 1 (n=3) v xem xt chui bit c truyn i 000 11010 00 1. T vic 3 bit u tin l
0 v ch c 3 phn t trong LIP nn tt c cc phn t LIP u l khng quan trng. 9 bit tip theo ni
ln thng tin trong tp LIS.

Bit tip theo l 1=> tp hp c node gc ta (0,1) l quan trng, theo danh sch LIS th tp
ny l loi D nn gi tr h s c gii m tip theo s l node con ca (0,1).
Bit tip theo l 101000 chng t hai con u tin ca (0,1) l quan trng v dng, cn 2 con sau
th khng quan trng. Do , ta chuyn hai con u tin n LSP v 2 con sau n LIP. Gi tr ca hai h
s quan trng ny c khi phc u l 1.5 2 3 12
. Ta chuyn 0,1 D ra khi LIS.
Hai bit tip theo l 00 chng t l hai tp tip theo trong LIS l khng quan trng.
Bit cui cng tng ng vi bc refinement pass c gi tr l 1, ta cp nht gi tr khi phc ca
h s ta (0,0) l 24+8/2=28.
Nh vy cc h s khi phc qua bc second pass l:

V cc danh sch c cp nht li l:

LIP:

0,1 , 1,0 , 1,1 , 1,2 , 1,3

LIS:

1,0 D, 1,1 D

LSP:

0,0 , 0,2 , 0,3

Third pass:
Gim n i 1 (n=2), nh vy gi tr ngng l 4. Gii m chui bit c truyn third pass
(10111010101101100110000010) ta cp nht c cc h s khi phc c gi tr nh sau:

V danh sch c cp nht l:

LIP:

3,0 , 3,1

LIS:
LSP:

0,0 , 0,2 , 0,3 , 0,1 , 1,0 , 1,1 , 1,2 , 2,0 , 2,1 , 3,2

third pass, tp LIS khng cn phn t no nn ta ch n gin cp nht gi tr ca cc

h s.