Advanced Digital Communication Linear Block Code 1.

The parity check bits of a (8,4) block code are generated by c0 = m0 + m1 + m3 c1 = m0 + m1 + m2 c 2 = m 0 + m 2 + m3 c3 = m1 + m2 + m3 where m1 , m2 , m3 and m4 are the message digits.

(a) Find the generator matrix and the parity check matrix for this code. (b) Find the minimum weight of this code. (c) Find the error-detecting capabilities of this code. (d) Show through an example that this code can detect three errors/codeword. 2. In a single-parity-check code, a single parity bit is appended to a block of k message bits (m1, m2, , m4). The single parity bit b1 is chosen so that the code word satisfies the even parity rule: m1 + m2 + L + mk + b1 = 0, mod 2

For k = 3, set up the 2k possible code words in the code defined by this rule. 3. Consider the (7, 4) Hamming code with the generator matrix G and the parity-check matrix H: 1 0 G= 1 1 1 1 1 0 0 1 1 1 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1

1 0 0 1 0 1 1 H = 0 1 0 1 1 1 0 0 0 1 0 1 1 1 Show that these two matrices satisfy the condition:

HGT= 0
4. Consider the (5, 1) repetition code:

G = [1 1 1 1 1]
1 0 H= 0 0
0 0 0 1 1 0 0 1 0 1 0 1 0 0 1 1

Evaluate the syndrome s for the following error patterns: (a) All five possible single-error patterns (b) All 10 possible double-error patterns 5. For an application that requires error detection only, we may use a nonsystematic code. In this problem, we explore the generation of such a cyclic code. Let g(X) denote the generator polynomial, and m(X) denote the message polynomial. We define the code polynomial c(X) simply as

c( X ) = m( X )g ( X )
Hence, for a given generator polynomial, we may readily determine the code words in the code. To illustrate this procedure, consider the generator polynomial for a (7, 4) Hamming code:

g(X ) = 1 + X + X 3
Determine the 16 code words in the code, and confirm the nonsystematic nature of the code. 6. The polynomial 1 + X 7 has 1 + X + X 3 and 1 + X 2 + X 3 as primitive factors. In pervious example, we used 1 + X + X 3 as the generator polynomial for a (7, 4) Hamming code. In this problem, we consider the adoption of 1 + X 2 + X 3 as the generator polynomial. Develop the encoder and syndrome calculator for the generator polynomial:

g(X ) = 1 + X 2 + X 3

7. Consider the (31, 15) Reed-Solomon code. (a) How many bits are there in a symbol of the code? (b) What is the block length in bits? (c) What is the minimum distance of the code? (d) How many symbols in error can the code correct?

Solution 1 1 1(a) c = [c0 L c8 ] = [b0 L b3 m0 L m3 ] = [m0 L m3 ] 0 1 1 1 1 0 1 1 0 1 Therefore, G = MI 0 1 1 1 4 1 0 1 1 1 1 and then H = I 4 M 1 0 (b) 1 0 1 1 1 0 0 1 1 1 1 1 1 1 0 1 0 1 MI 4 1 1 1 0 1 1

m 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111
Therefore, minimum weight = 4 (c) d min = minimum weight = 4

C 0000 0000 1011 0001 0111 0010 1100 0011 1101 0100 0110 0101 1010 0110 0001 0111 1110 1000 0101 1001 1001 1010 0010 1011 0011 1100 1000 1101 0100 1110 1111 1111

Therefore, error-detecting capability = d min 1 = 3 (d) Suppose the transmitted code be 00000000 and the received code be 11100000.

 1 1 s = rH T = [11100000]I 4 M 1 0

1 0 1 1 1 0 = [1110]0 0 1 1 1 1 1

2.

3.

4.

5.

6.

7.

10