UET-VNU H ni Faculty of Electronic &

Communications
1
Block Coding
Code: ELT3057
UET-VNU H ni Faculty of Electronic &
Communications
2
Introduction
There are two kinds of coding:
Source coding for compacting the message. It eliminate
the redundant bits from message before transmission.
For a specific source there is a below limit of bit
number/codeword. Under this limit can not recover
message with distort-less
Channel coding for decreasing the error probability. It
add the redundant bits to message before transmission.
For a specific channel there is a upper limit of data rate.
Under this limit the transmission can be reliable
This subject basically focus on channel coding
UET-VNU H ni Faculty of Electronic &
Communications
3
Example
Given a BSC
(Binary symetric channel)
Assume p=10
-3
Consider a repetition code:
In transmitter: 111 substitute for 1, 000 substitute for 0
In receiver: Hard decision by majority
P
e1
=Pr(001)+Pr(010)+Pr(100)+Pr(000)
= 3. p
2
(1-p)+p
3
=3.10
-3
10
-3
(1-10
-3
)+10
-3
10
-3
10
-3
=~ 3.10
-6
UET-VNU H ni Faculty of Electronic &
Communications
4
Trade off in repetition code
Using BPSK
Repeat N times to transmit one bit. Soft decision
Error probability decays exponentially with block
length N or number of repetition. It makes slowly
the rate of information
For increasing data rate using M-PAM
Reliable when M less than , but data rate is
bounded by then still goes to zero as the
block length increase
UET-VNU H ni Faculty of Electronic &
Communications
5
Repetition in signal-space
UET-VNU H ni Faculty of Electronic &
Communications
6
Packing Spheres
UET-VNU H ni Faculty of Electronic &
Communications
7
Capacity of channel (Shannon limit)
Number of noise spheres
The maximum number of bit per symbol/
dimension
Bandwidth W have 2W dimension
UET-VNU H ni Faculty of Electronic &
Communications
8
Revision
What are the source code and the channel
code
Why repetition coding can decrease error
probability
What is disadvantage of repetition code
What is the capacity (Shannon limit) of
specific channel with AWGN
How does mean the reliable transmission
UET-VNU H ni Faculty of Electronic &
Communications
9
Example: Hamming Code (7,4)
s
1
,s
2
,s
3
ars information bits, t
5
,t
6
,t
7
are parity-bits
UET-VNU H ni Faculty of Electronic &
Communications
10
Represent by matrix
MD: Minimum distance, and number of error bit
are detectable
C: codeword, H: Checking matrix
UET-VNU H ni Faculty of Electronic &
Communications
11
Linear Parity-Check Codes
In an (n,k) block codes
UET-VNU H ni Faculty of Electronic &
Communications
12
Syndrome decoding
Parity-Check Matrix
Syndrome decoding
S is called the syndrome of
r. Note that eH
T
is i-row of H
T
we can identify the
error position by comparing s to the rows of H
T
UET-VNU H ni Faculty of Electronic &
Communications
13
Revise:Hamming code (7,4)
Chosen:
UET-VNU H ni Faculty of Electronic &
Communications
14
Decoding by syndrome
d
min
=3, can correct one bit (d
min
-1)/2=1
Assume code c=[1110010] is sent
Received c=[1100010] with an error in the
third bit. Calculate: s=cH
T
=(c+e)H
T
=eH
T
UET-VNU H ni Faculty of Electronic &
Communications
15
Decoding by syndrome
s is called Syndrome
From table the coset leader is found to be
[0010000]. Indicate that the third bit of the
received is erroneous. Thus, adding this
error to the received vector yields the
correct code
Note: Received vector have 2
n
possible
values. Partitioning into 2
k
subset. Each
subset correspond a codeword.
UET-VNU H ni Faculty of Electronic &
Communications
16
Revision
What is the block coding and the meaning
of generator matrix, checking matrix
What is Hamming distance and capability
of error correction.
What is syndrome decoding
UET-VNU H ni Faculty of Electronic &
Communications
17
Problems
UET-VNU H ni Faculty of Electronic &
Communications
18
UET-VNU H ni Faculty of Electronic &
Communications
19
Note that eH
T
=s is i
th
row of H
T
we can identify
the erroe position by comparing s to the rows of
H
T
. The method is called Syndrome decoding
Since s is equal to the fourth row of H
T
, an error
is at the fourth bit. The correct code is 010011,
and the data bit are 010
UET-VNU H ni Faculty of Electronic &
Communications
20
UET-VNU H ni Faculty of Electronic &
Communications
21
Error probability
Block code with d
min
possible detect and correct
t=(d
min
-1)/2 error bit
The probability of m error in a block of n bits is
P(m,n)=C
n
m
p
m
(1-p
)n-m
Error probability:
For high signal to noise ratio, i.e small values of p
If p=10
-2
in BSC

n
t m
e
n m p p
1
) , (
1 ) 1 (
1 1


t n p p C p
t t
n e
5 2 2
7
) 1 ( p p C p
e

UET-VNU H ni Faculty of Electronic &
Communications
22
Cyclic Codes
Cyclic codes is a subclass of linear block code:
easy to code and efficient decoding
Properties: Linearity and Cyclic property (any
cyclic sift of a codeword is also a codeword)
Codeword c
0
c
1
..c
n-1
is mapped to code
polynomial
UET-VNU H ni Faculty of Electronic &
Communications
23
The encoding procedure
addition by modulo-2
b(X) is the remainder after dividing X
n-k
m(X)
by g(X).
1: Multiply the message polynomial m(X) by X
n-k
.
2: Divide X
n-k
m(X) by the generator polynomial g(X),
obtaining the remainder b(X)
3: Add b(X) to X
n-k
m(X), obtaining the code polynomial
that is codeword
UET-VNU H ni Faculty of Electronic &
Communications
24
Hamming code revisited (7,4)
Chosen
For example message 1001
Encode: Multiplying m(X) by X
n-k
=X
3
Divide by g(X)
UET-VNU H ni Faculty of Electronic &
Communications
25
Codeword
That is 0111001. 001 are the parity check
UET-VNU H ni Faculty of Electronic &
Communications
26
Syndrome Calculator
UET-VNU H ni Faculty of Electronic &
Communications
27
Generation of codeword
1:The gate is switched on, the k message bits are shifted
into the channel. The resulting (n-k) bit in the register
form the parity bit
2:The gate is switched off. Thereby breaking the feedback
connections
3: The contents of the shift register are read out into the
channel
UET-VNU H ni Faculty of Electronic &
Communications
28
Parity-Check Polynomial
The generator pol. g(X) is equivalent to the
generator mat. G. Corresponding ly h(X)
or H so HG
T
=0 we have
Or g(X) and h(X) are factors of X
n
+1
UET-VNU H ni Faculty of Electronic &
Communications
29
Decoding by Syndrome
Received word
Divide r(X) by generator pol. g(X)
s(X) is a pol. Of degree n-k-1 or less.
The syndrome s(X) is identical to error
e(X)
The error correction can be accomplished
simply by adding the syndrome s(X) to r(X)
UET-VNU H ni Faculty of Electronic &
Communications
30
Calculate the syndrome
The received bits are fed into (n-k) stages of the
feedback shift register from the left.
After all the received bits have been shifted into
the shift register, its contents the syndrome s
UET-VNU H ni Faculty of Electronic &
Communications
31
Revision
What is the block coding and how does its
possibility for correcting error bit in a
codeword.
How do encode and decode in the block
coding
What is the error probability of block
coding (n,k) in the AWGN channel
UET-VNU H ni Faculty of Electronic &
Communications
32
Advance topic: Capability of error
correction
An (n,k) linear block code can correct up to t
error/code word if satisfy the Hamming bound
A block code with equality is known as perfect
code. The single error correcting perfect codes
are called Hamming codes
Hamming bound is necessary but not sufficient
for construction of a t error-correcting code