Information Technology Reference
In-Depth Information
10
0
Uncoded
k = 37, I(
Δ
) = 64
k = 93, I(
) = 128
k = 163, I(
Δ
) = 128
k = 219, I(
Δ
) = 16
Δ
10
−
1
10
−
2
10
−
3
10
−
4
10
−
5
0
1
2
3
SNR (dB)
4
5
6
7
(a)
10
0
Uncoded
k = 130, L = 1
k = 101, L = 1
k = 101, L = 4
k = 101, L = 16
k = 101, L = 64
k = 101, L = 256
k = 101, ML, lower bound
10
−
1
10
−
2
10
−
3
10
−
4
10
−
5
0
1
2
3
SNR (dB)
4
5
6
7
(b)
Figure
6.14.
(a) Exact bounds on word error rates (WER) for ML decoding of RM
codes of orders 2 to 5 on the length 256. The legend includes the list sizes l(D), for
which recursive permutation algorithm performs within D = 0.25 dB from ML
decoding. (b) Word error rates (WER) for the (512, 101)-subcode of the (512, 130)
RM code of order 3. Different curves represent WER for recursive list decoding
for varying lists L.
Search WWH ::
Custom Search