Decoding block codes

11/2/2014

Error Correction Coding - 9: Decoding block codes

Outline
Decoding algorithms
Error rate of block codes
Performance of some block
codes
Coding gain

11/2/2014

Error Correction Coding - 9: Decoding block codes

Decoding block codes summary

For any linear code we may find the
syndrome using s = r HT
then look up error pattern, and hence correct it

Similarly, for cyclic codes, given the

generator polynomial g(x) we may find a
syndrome polynomial s(x) = r(x) mod
g(x)
then look up error pattern and correct

For long codes, where (n k) is large, we

use special algorithms for specific codes to
find the error pattern from the syndrome
e.g. for BCH codes: Berlekamp-Massey
11/2/2014algorithm,
Error Correction
- 9: Decoding block codes
3
ChienCoding
search

Decoded error rates

Probability of a uncorrectable word error,
for an
n
(n, k)
code:
Pew terror-correcting
P no. errors t
P i errors
i t 1

P i errors Ci p 1 p
n

n i

where p is nthe
channel
bit
probability
n ierror
n
i
n
t 1

Then:

Pew

i t 1

Ci p 1 p

Ct 1 p

approximation
n if np 1is small
K n i 1
n ! holds
n
note: Ci i ! n i !
i i 1 K 1
11/2/2014

Error Correction Coding - 9: Decoding block codes

Decoded BER
Most probable word error codeword at
dmin
i.e. total of dmin bit errors, of which k dmin/n are
data bits
But therekdare kn data bits/word
d min
d min n
t 1
min
P

C
p
eb
ewBER:
ew
t 1
Average
decoded
k
n
n

2 Ec
2kE b
p Gaussian
Q
noise
Q

On white
channel
using

N
nN
0
0

BPSK or QPSK

11/2/2014

Error Correction Coding - 9: Decoding block codes

Error probability of Hamming

codes

BER

0.01

0.001

0.0001

15

0.00001

uncoded

63 31
3
11/2/2014

Bit energy
to noise density ratio, dB
Error Correction Coding - 9:
Decoding block codes

7
9

10

Error probability of BCH

codes
0.01

BER
0.001
0.0001

0.00001

10

10

10

Bitenergytonoisedensityratio,dB

Near rate 1/2 BCH codes: b - (7,4); c - (15,7); d (31,16) Error Correction Coding - 9: Decoding block codes 7
11/2/2014

BER of RS codes
Reed-Solomon codes have non-binary (2qary) symbols, representing groups of q bits
hence we must relate channel
ps 1 1 p q qp
symbol error probability to channel BER:

Then decoded symbol error probability:

d min n
t 1 d min n
Pes
Ct 1 ps
Ct 1q t 1 p t 1
n
n

Average no. bit errors per errored symbol

is q/2
q 2
d min n
Peb
Pes
Ct 1q t 1 p t 1
Hence decoded BER: q
2n
Beware that for large n and relatively
small k the
approximation
forcodes
Pes may
not
11/2/2014
Error Correction
Coding - 9: Decoding block
8

Error probability of RS codes

0.1

BER
0.01
0.001
10-4
10-5
10 -6
10-7

6
11/2/2014

(15,9)

(31,23)

(7,3) uncoded

10

Bit energy to noise density ratio, dB

Error Correction Coding - 9: Decoding block codes 9

11

12

Calculating coding gain

Coding gain is defined as:
the reduction in required bit energy to
noise density ratio for a given BER in the
coded system compared with an
equivalent uncoded system
Difficult to calculate using exact BER

2k Eb
Ec

p Q 2
Q
expressions

N
n
N
0
0

e.g. for t-error correcting BCH

t 1
code

Eb
E
b
d min n
2
k
using
on
Ct 1 AWGN
Q
Peb BPSK
c
channel:
Q 2
Peb u
N

n
n N 0 c
0 u

then:
Eb
E
b
10log10
10log10

N 0

N
0

c
find

11/2/2014
We solve Error
this
to Coding - 9: Decoding block codes
Correction

11

Summary
n

n i
Decoded word P
n
i
n
t 1
C
p
1

C
p

ew
i
t 1
error probability:
i t 1

Decoded BER:P d min P d min nC p t 1

eb
ew
t 1

Coding gain definition:

the reduction in required bit energy to noise
density ratio for a given BER in the coded system
compared with an equivalent uncoded system
Calculating coding gain

11/2/2014

Error Correction Coding - 9: Decoding block codes

12