Problem Sheet - 3
Problem Sheet - 3
Problem Sheet - 3
PROBLEM SHEET-3
Channel Coding
Instructions:
1. Total Marks: 15
v4 = u1 + u2 + u3
v5 = u0 + u1 + u2
v6 = u0 + u1 + u3
v7 = u0 + u2 + u3
Write the generator and parity check matrices and draw the encoder diagram.
3 A systematic (10, 5) LBC is designed with a minimum Hamming distance of 2
4. The generator matrix is:
1 0 0 0 0 1 1 1 0 1
0 1 0 0 0 0 1 1 1 0
G= 0 0 1 0 0 1 0 1 1 1
0 0 0 1 0 1 1 0 1 0
0 0 0 0 1 0 1 1 0 1
3. Analyze the error detection and correction capabilities of this code based
on the minimum Hamming distance.
1. Derive the code polynomial for both input sequences using polynomial
multiplication.
2. Construct the full code vector for each input by using the generator poly-
nomial.
4. Correct the received vector if an error is detected and identify the error
location.
5 A (15, 7) cyclic code is defined by the generator polynomial g(x) = 1 + x + 2
x4 . The code is used in a communication system where the following received
vectors are obtained:
1. For each received vector, calculate the syndrome and determine if there
is any error.
2. Explain the steps required to correct the received vectors if an error exists.
4. Explain how this cyclic code could be converted into a systematic form,
if possible, and discuss the implications on encoding complexity.
6 Given
a (6, 3) linear block code with generator matrix G = 1
1 0 0 1 0 1
0 1 0 1 1 0:
0 0 1 0 1 1
1. Construct the entire set of codewords and verify the minimum Hamming
distance.
2. Design the encoder circuit for this code using basic logic gates.
2. Using the syndrome decoding approach, analyze how this code detects
and corrects single-bit errors.
4. Draw the encoder and syndrome decoder circuit diagrams for this code.
0 0 1 0 1 0
S1 = r1 + r2 + r3 + r4
S2 = r1 + r2 + r4 + r6
S3 = r1 + r3 + r4 + r7
1. g(x) = 1 + x2 + x3
2. g(x) = 1 + x + x2 + x4
3. g(x) = 1 + x + x2 + x3 + x4