Solutions to problems from Chapter 3

Manjunatha. P
[email protected]

Professor
Dept. of ECE

J.N.N. College of Engineering, Shimoga

October 13, 2012

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

Consider a systematic (8, 4) code whose parity-check equations are

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 2 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

Consider a systematic (8, 4) code whose parity-check equations are

v0 = u1 + u2 + u3
v1 = u0 + u1 + u2
v2 = u0 + u1 + u3
v3 = u0 + u2 + u3

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 2 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

Consider a systematic (8, 4) code whose parity-check equations are

v0 = u1 + u2 + u3
v1 = u0 + u1 + u2
v2 = u0 + u1 + u3
v3 = u0 + u2 + u3
where u0 , u1 , u2 , u3 are message digits and v0 v1 v2 v3 are parity
check digits. Find the generator and parity check matrices for this
code. Show analytically that the minimum distance of this code is 4.

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 2 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

Consider a systematic (8, 4) code whose parity-check equations are

v0 = u1 + u2 + u3
v1 = u0 + u1 + u2
v2 = u0 + u1 + u3
v3 = u0 + u2 + u3
where u0 , u1 , u2 , u3 are message digits and v0 v1 v2 v3 are parity
check digits. Find the generator and parity check matrices for this
code. Show analytically that the minimum distance of this code is 4.
Solution:
The information sequences u = [u0 u1 u2 u3 ] are encoded into
codewords v of length n = 8, using a systematic encoder. If we
assume that the systematic positions in a codeword are the last k = 4
positions, then codewords have the form

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 2 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

Consider a systematic (8, 4) code whose parity-check equations are

v0 = u1 + u2 + u3
v1 = u0 + u1 + u2
v2 = u0 + u1 + u3
v3 = u0 + u2 + u3
where u0 , u1 , u2 , u3 are message digits and v0 v1 v2 v3 are parity
check digits. Find the generator and parity check matrices for this
code. Show analytically that the minimum distance of this code is 4.
Solution:
The information sequences u = [u0 u1 u2 u3 ] are encoded into
codewords v of length n = 8, using a systematic encoder. If we
assume that the systematic positions in a codeword are the last k = 4
positions, then codewords have the form
v = [v0 v1 v2 v3 u0 u1 u2 u3 ]

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 2 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

Consider a systematic (8, 4) code whose parity-check equations are

v0 = u1 + u2 + u3
v1 = u0 + u1 + u2
v2 = u0 + u1 + u3
v3 = u0 + u2 + u3
where u0 , u1 , u2 , u3 are message digits and v0 v1 v2 v3 are parity
check digits. Find the generator and parity check matrices for this
code. Show analytically that the minimum distance of this code is 4.
Solution:
The information sequences u = [u0 u1 u2 u3 ] are encoded into
codewords v of length n = 8, using a systematic encoder. If we
assume that the systematic positions in a codeword are the last k = 4
positions, then codewords have the form
v = [v0 v1 v2 v3 u0 u1 u2 u3 ]
and the systematic encoding is specified by
v = uG ; G = [P | I ] :

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 2 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

From the given set of parity-check equations we immediately obtain

the generator and the parity check matrices.

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 3 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

From the given set of parity-check equations we immediately obtain

the generator and the parity check matrices.
We can start with the parity check matrix H and recall that every row
in H represents one parity check equation, and it has ones in the
positions of P T corresponding to the symbols involved in that
equation. Thus, we have

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 3 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

From the given set of parity-check equations we immediately obtain

the generator and the parity check matrices.
We can start with the parity check matrix H and recall that every row
in H represents one parity check equation, and it has ones in the
positions of P T corresponding to the symbols involved in that
equation. Thus, we have
 
1 0 0 0| 0 1 1 1
 0 1 0 0| 1 1 1 0 
H=  0 0 1 0| 1 1 0 1 


0 0 0 1| 1 0 1 1

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 3 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

From the given set of parity-check equations we immediately obtain

the generator and the parity check matrices.
We can start with the parity check matrix H and recall that every row
in H represents one parity check equation, and it has ones in the
positions of P T corresponding to the symbols involved in that
equation. Thus, we have
 
1 0 0 0| 0 1 1 1
 0 1 0 0| 1 1 1 0 
H=  0 0 1 0| 1 1 0 1 


0 0 0 1| 1 0 1 1
 
0 1 1 1| 1 0 0 0
 1 1 1 0| 0 1 0 0 
G =  1 1 0 1| 0 0 1 0 


1 0 1 1| 0 0 0 1

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 3 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

To find the minimum distance analytically, we use the property that

the minimum distance of a binary linear code is equal to the smallest
number of columns of the parity-check matrix H that sum up to zero.
Hence, we find that:

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 4 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

To find the minimum distance analytically, we use the property that

the minimum distance of a binary linear code is equal to the smallest
number of columns of the parity-check matrix H that sum up to zero.
Hence, we find that:
there are no two identical columns in H dmin > 2

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 4 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

To find the minimum distance analytically, we use the property that

the minimum distance of a binary linear code is equal to the smallest
number of columns of the parity-check matrix H that sum up to zero.
Hence, we find that:
there are no two identical columns in H dmin > 2
there are no groups of 3 columns that sum up to 0 dmin > 3

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 4 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

To find the minimum distance analytically, we use the property that

the minimum distance of a binary linear code is equal to the smallest
number of columns of the parity-check matrix H that sum up to zero.
Hence, we find that:
there are no two identical columns in H dmin > 2
there are no groups of 3 columns that sum up to 0 dmin > 3
there exists a group of 4 columns (for example, columns 1,2,3,6) that
sum up to 0 dmin = 42.

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 4 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

3.2 Construct an encoder for the code given in Problem 3.1

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 5 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

3.2 Construct an encoder for the code given in Problem 3.1

Solution:
Based on the parity check equations from the previous problem, the
systematic encoder for the (8; 4) code has the structure as shown in
Figure 1.

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 5 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

3.2 Construct an encoder for the code given in Problem 3.1

Solution:
Based on the parity check equations from the previous problem, the
systematic encoder for the (8; 4) code has the structure as shown in
Figure 1.
v 0 = u1 + u2 + u3 v1 = u0 + u1 + u2
v2 = u0 + u1 + u3 v3 = u0 + u2 + u3

Message register
Input U
U0 U1 U2 U3

To Channel

+ + + +
vo v1 v2 v3

Parity register
Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 5 / 10
 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

3.3 Construct a syndrome circuit for the code given in Problem 3.1

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 6 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

3.3 Construct a syndrome circuit for the code given in Problem 3.1
Solution:
Syndrome vector is obtained from the received sequence
r = [r0 r1 . . . r7 ] using the parity check matrix of the code:
s = [s0 s1 s2 s3 ] = rH T :
 
1 0 0 0
 0 1 0 0 
 
 0 0 1 0 
 
 0 0 0 1 
= (r0 , r1 , r2 , r3 , r4 , r5 , r6 , r7 ) 
 0

 1 1 1 

 1 1 1 0 
 
 1 1 0 1 
1 0 1 1

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 6 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

3.3 Construct a syndrome circuit for the code given in Problem 3.1
Solution:
Syndrome vector is obtained from the received sequence
r = [r0 r1 . . . r7 ] using the parity check matrix of the code:
s = [s0 s1 s2 s3 ] = rH T :
 
1 0 0 0
 0 1 0 0 
 
 0 0 1 0 
 
 0 0 0 1 
= (r0 , r1 , r2 , r3 , r4 , r5 , r6 , r7 ) 
 0

 1 1 1 

 1 1 1 0 
 
 1 1 0 1 
1 0 1 1

By parity check matrix the syndrome digits are:

s0 = r0 + r5 + r6 + r7 s1 = r1 + r4 + r5 + r6
s2 = r2 + r4 + r5 + r7 s3 = r3 + r4 + r6 + r7
Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 6 / 10
 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

s0 = r0 + r5 + r6 + r7 s1 = r1 + r4 + r5 + r6
s2 = r2 + r4 + r5 + r7 s3 = r3 + r4 + r6 + r7 :

r
r0 r1 r2 r3 r4 r5 r6 r7

+ + + +

s0 s1 s2 s3

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 7 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

3.3 Determine the weight distribution of the (8,4) linear code given in
Problem 3.1. Let the transition probability of a BSC be ρ = 10−2 .
Compute the probability of an undetected error of this code.

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 8 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

3.3 Determine the weight distribution of the (8,4) linear code given in
Problem 3.1. Let the transition probability of a BSC be ρ = 10−2 .
Compute the probability of an undetected error of this code.
Solution:
Let Ai denote the number of codewords of weight i in an (n; k) code
C. Then the numbers A0 , A1 , . . . An are called the weight distribution
of the code. For any linear code A0 = 1 (every linear code must
contain the all-zero codeword). The first next non-zero element of the
weight distribution of a linear code is Admin , corresponding to the
number of minimal-weight codewords.
For the (8; 4) code with the minimum distance dmin = 4, all the
codewords except the all-zero and the all-one codeword have
minimum weight, that is, the weight distribution is
A0 = 1, A4 = 14, A8 = 1,

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 8 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

3.3 Determine the weight distribution of the (8,4) linear code given in
Problem 3.1. Let the transition probability of a BSC be ρ = 10−2 .
Compute the probability of an undetected error of this code.
Solution:
Let Ai denote the number of codewords of weight i in an (n; k) code
C. Then the numbers A0 , A1 , . . . An are called the weight distribution
of the code. For any linear code A0 = 1 (every linear code must
contain the all-zero codeword). The first next non-zero element of the
weight distribution of a linear code is Admin , corresponding to the
number of minimal-weight codewords.
For the (8; 4) code with the minimum distance dmin = 4, all the
codewords except the all-zero and the all-one codeword have
minimum weight, that is, the weight distribution is
A0 = 1, A4 = 14, A8 = 1,

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 8 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

A0 = 1, A4 = 14, A8 = 1,

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 9 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

A0 = 1, A4 = 14, A8 = 1,
The probability of an undetected error is

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 9 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

A0 = 1, A4 = 14, A8 = 1,
The probability of an undetected error is
n
X
Pu (E ) = Ai p i (1 − p)n−i
i=1

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 9 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

A0 = 1, A4 = 14, A8 = 1,
The probability of an undetected error is
n
X
Pu (E ) = Ai p i (1 − p)n−i
i=1

Pu (E ) = A4 p 4 (1 − p)4 + A8 p 8 = 14p 4 (1 − p 4 ) + p 8

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 9 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

A0 = 1, A4 = 14, A8 = 1,
The probability of an undetected error is
n
X
Pu (E ) = Ai p i (1 − p)n−i
i=1

Pu (E ) = A4 p 4 (1 − p)4 + A8 p 8 = 14p 4 (1 − p 4 ) + p 8

If p = 10−2 then Pu (E ) = 1.3448x10−7 .

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 9 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

Form the generator matrix of the first-order RM code RM(1,3) of

length 8. What is the minimum distance of the code? Determine its
parity check sums and devise majority-logic decoder for the code.
Decode the received vector r=(0 1 0 0 0 1 0 1).
Solution:
Consider the code R(1,3) with generator matrix:

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 10 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

Form the generator matrix of the first-order RM code RM(1,3) of

length 8. What is the minimum distance of the code? Determine its
parity check sums and devise majority-logic decoder for the code.
Decode the received vector r=(0 1 0 0 0 1 0 1).
Solution:
Consider the code R(1,3) with generator matrix:
Code length: n = 2m = 23 = 8

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 10 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

Form the generator matrix of the first-order RM code RM(1,3) of

length 8. What is the minimum distance of the code? Determine its
parity check sums and devise majority-logic decoder for the code.
Decode the received vector r=(0 1 0 0 0 1 0 1).
Solution:
Consider the code R(1,3) with generator matrix:
Code length: n = 2m = 23 = 8
 
3 3.2.1
k(r , m) = 1 + = 1 + (2.1).1 =4
1

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 10 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

Form the generator matrix of the first-order RM code RM(1,3) of

length 8. What is the minimum distance of the code? Determine its
parity check sums and devise majority-logic decoder for the code.
Decode the received vector r=(0 1 0 0 0 1 0 1).
Solution:
Consider the code R(1,3) with generator matrix:
Code length: n = 2m = 23 = 8
 
3 3.2.1
k(r , m) = 1 + = 1 + (2.1).1 =4
1
Minimum distance: dmin = 2m−r = 23−1 = 4

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 10 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

Form the generator matrix of the first-order RM code RM(1,3) of

length 8. What is the minimum distance of the code? Determine its
parity check sums and devise majority-logic decoder for the code.
Decode the received vector r=(0 1 0 0 0 1 0 1).
Solution:
Consider the code R(1,3) with generator matrix:
Code length: n = 2m = 23 = 8
 
3 3.2.1
k(r , m) = 1 + = 1 + (2.1).1 =4
1
Minimum distance: dmin = 2m−r = 23−1 = 4
 
1 1 1 1 1 1 1 1
 1 1 1 1 0 0 0 0 
GRM (1, 3) =  1 1

0 0 1 1 0 0 
1 0 1 0 1 0 1 0

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 10 / 10

 Solutions to problems from Chapter 3 Solutions to problems from Chapter 3

Form the generator matrix of the first-order RM code RM(1,3) of

length 8. What is the minimum distance of the code? Determine its
parity check sums and devise majority-logic decoder for the code.
Decode the received vector r=(0 1 0 0 0 1 0 1).
Solution:
Consider the code R(1,3) with generator matrix:
Code length: n = 2m = 23 = 8
 
3 3.2.1
k(r , m) = 1 + = 1 + (2.1).1 =4
1
Minimum distance: dmin = 2m−r = 23−1 = 4
 
1 1 1 1 1 1 1 1
 1 1 1 1 0 0 0 0 
GRM (1, 3) =  1 1

0 0 1 1 0 0 
1 0 1 0 1 0 1 0

Manjunatha. P (JNNCE) Solutions to problems from Chapter 3 October 13, 2012 10 / 10