Scribd
Upload
45 views2 pages

Convolutional Code Solution

The document outlines a solution for generating a convolutional code using a (3, 1, 2) convolutional code with specified generator polynomials and a given message sequence. It details the construction of a generator matrix and the binary summation of its rows to produce the final codeword. The resulting codeword is presented as a 21-bit sequence: 111011100010001101111.

Uploaded by

Abhishek Kuamr
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
45 views2 pages

Convolutional Code Solution

The document outlines a solution for generating a convolutional code using a (3, 1, 2) convolutional code with specified generator polynomials and a given message sequence. It details the construction of a generator matrix and the binary summation of its rows to produce the final codeword. The resulting codeword is presented as a 21-bit sequence: 111011100010001101111.

Uploaded by

Abhishek Kuamr
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Convolutional Code Solution

Solution:

Given:

(3, 1, 2) convolutional code with generator polynomials:

g(1) = (1 1 0)

g(2) = (1 0 1)

g(3) = (1 1 1)

Message sequence: (1 1 1 0 1)

After zero-padding: u = (1 1 1 0 1 0 0)

Step 1: Construct generator matrix (time-domain). Size: 7x21

Each row corresponds to an input bit, contributing 3 outputs via convolution with g(1), g(2), g(3).

G Matrix Rows (non-zero rows only shown):

Row 0 (u0 = 1):

[1 1 0 | 1 0 1 | 1 1 1 | 0 0 0 | 0 0 0 | 0 0 0 | 0 0 0]

Row 1 (u1 = 1):

[0 0 0 | 1 1 0 | 1 0 1 | 1 1 1 | 0 0 0 | 0 0 0 | 0 0 0]

Row 2 (u2 = 1):

[0 0 0 | 0 0 0 | 1 1 0 | 1 0 1 | 1 1 1 | 0 0 0 | 0 0 0]

Row 4 (u4 = 1):

[0 0 0 | 0 0 0 | 0 0 0 | 0 0 0 | 1 1 0 | 1 0 1 | 1 1 1]

Step 2: Binary sum of the above rows (mod 2):


Convolutional Code Solution

Row 0: 111 101 111 000 000 000 000

Row 1: 000 110 101 111 000 000 000

Row 2: 000 000 110 101 111 000 000

Row 4: 000 000 000 000 110 101 111

----------------------------------

Final Codeword: 111 011 100 010 001 101 111

Answer:

Codeword = 111011100010001101111 (21 bits)

You might also like