Professional Documents
Culture Documents
EE576 ErrorControlCoding(142)
Lec01
Lecture Outline
Basics of error control coding
Coding gain
Hamming bound
Gilbert bound
EE576 ErrorControlCoding(142)
Lec01
Communication System
EE576 ErrorControlCoding(142)
Lec01
EE576 ErrorControlCoding(142)
Lec01
EE576 ErrorControlCoding(142)
0.5)
Lec01
3
3
1
3 1
10 ,
]
10 .
EE576 ErrorControlCoding(142)
Lec01
Coding Gain
Coding gain is the reduction in / required to achieve a
specific BER for a coded system compared to uncoded
system.
For fair comparison,
/
of the coded system must be
scaled by the rate of the code (or equivalently reduced by
10 log 1/ dB), to ensure the same energy per information
bit for both systems.
Ex: For DPSK
0.5 exp
When coding is introduced,
/
/
.
drops by a factor of
We should calculate
0.5 exp
/
, then evaluate
as a function of . Now it is fair to compare
and .
7
EE576 ErrorControlCoding(142)
Lec01
BER
Graphical Illustration
EE576 ErrorControlCoding(142)
B
G A
Eb/N0
Lec01
Hamming Distance
Def: The Hamming distance between two codewords
, denoted by
and
011,111
EE576 ErrorControlCoding(142)
Lec01
Geometrical Illustration
000
001
010
011
101
100
110
10
EE576 ErrorControlCoding(142)
111
Lec01
EE576 ErrorControlCoding(142)
Lec01
1
EE576 ErrorControlCoding(142)
Lec01
and in
EE576 ErrorControlCoding(142)
Lec01
14
EE576 ErrorControlCoding(142)
Lec01
code.
EE576 ErrorControlCoding(142)
Lec01
Hamming Bound
For an
received words.
Think of the 2 codewords as centers of spheres in an dimensional space.
All received words that differ from codeword
positions lie within the sphere
of center
in
or less
and radius .
1, . . , 2 , must be disjoint.
EE576 ErrorControlCoding(142)
Lec01
Hamming Bound
In other words, when a codeword is selected, none of the
-bit sequences that differ from that codeword by
or less
EE576 ErrorControlCoding(142)
Lec01
Hamming Bound
The total number of -bit sequences that must be available
for the code to be a -error correcting code is
2
But, the total number of sequences is 2n. Therefore,
2
2
or
2
18
EE576 ErrorControlCoding(142)
Lec01
Hamming Bound
This bound is known as the Hamming (sphere-packing)
Bound. It provides a necessary, but not a sufficient,
condition for the existence of an
,
-error correcting
code.
Ex: Is it theoretically possible to design a (10,7) single-error
correcting code?
10
10
1 10 11 2
0
1
It is not possible.
A code for which the equality is satisfied is called a perfect
code.
19
EE576 ErrorControlCoding(142)
Lec01
Gilbert Bound
It provides the sufficient condition for the existence of a
, code with
.
1
2
Ex: What are the values of that are guaranteed to exist for a
single-error-correcting code of
10.
Gilbert bound requires
5. A (10,5) code with
3
does exist.
Hamming bound requires
6. A (10,7) code with
3
does not exist. The (10,6) code with
3, according to
the two bounds,may or may not exist. It is found to exist.
20
EE576 ErrorControlCoding(142)
Lec01
EE576 ErrorControlCoding(142)
Lec01
22
EE576 ErrorControlCoding(142)
Lec01
EE576 ErrorControlCoding(142)
Lec01