[go: up one dir, main page]
Scribd
Upload
86 views18 pages

Sheet 5 Coding

The document details the output of a convolutional encoder with a rate of r = 1/2 and a constraint length of K = 4, producing an output of 11, 11, 01, 11, 10 for the input message 10111. It includes the generator polynomials and the message polynomial used in the encoding process. Additionally, it references constructing a trellis diagram for the encoder based on the given message sequence.

Uploaded by

david1milad1982
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
86 views18 pages

Sheet 5 Coding

The document details the output of a convolutional encoder with a rate of r = 1/2 and a constraint length of K = 4, producing an output of 11, 11, 01, 11, 10 for the input message 10111. It includes the generator polynomials and the message polynomial used in the encoding process. Additionally, it references constructing a trellis diagram for the encoder based on the given message sequence.

Uploaded by

david1milad1982
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
You are on page 1/ 18

Sheet 5

Figure shows the encoder for a rate r = 1/2, constraint length K = 4 convolutional code.
Determine the encoder output produced by the message sequence 10111.

Message 10111 → The encoder output is 11, 11, 01, 11,10


The generator polynomials are
𝒈 𝟏 𝑿 = 𝟏 + 𝑿 + 𝑿𝟐 + 𝑿𝟑
𝒈 𝟐 𝑿 = 𝟏 + 𝑿 + 𝑿𝟑
The message polynomial is
m 𝑿 = 𝟏 + 𝑿𝟐 + 𝑿𝟑 + 𝑿𝟒

𝒄 𝟏 𝑿 =𝒈 𝟏 𝑿 𝒎 𝑿 = 𝟏 + 𝑿 + 𝑿𝟑 + 𝑿𝟒 + 𝑿𝟓

𝒄 𝟐 𝑿 =𝒈 𝟐 𝑿 𝒎 𝑿 = 𝟏 + 𝑿 + 𝑿𝟐 + 𝑿𝟑 + 𝑿𝟔 + 𝑿𝟕

𝟏
𝒄 = 𝟏, 𝟏, 𝟎, 𝟏, 𝟏, 𝟏, …
𝒄 𝟐 = 𝟏, 𝟏, 𝟏, 𝟏, 𝟎, 𝟎 …

The encoder output is 11, 11, 01, 11,10


dk-3 dk-2 dk-1 dk V1 V2
0 0 0 0 0 0
0 0 0 1 1 1
0 0 1 0 1 1
0 0 1 1 0 0
0 1 0 0 1 0
0 1 0 1 0 1
0 1 1 0 0 1
0 1 1 1 1 0
1 0 0 0 1 1
1 0 0 1 0 0
1 0 1 0 0 0
1 0 1 1 1 1
1 1 0 0 0 1
1 1 0 1 1 0
1 1 1 0 1 0
1 1 1 1 0 1
dk-3 dk-2 dk-1 dk V1 V2
0 0 0 0 0 0
0 0 0 1 1 1
0 0 1 0 1 1
0 0 1 1 0 0
0 1 0 0 1 0
0 1 0 1 0 1
0 1 1 0 0 1
0 1 1 1 1 0
1 0 0 0 1 1
1 0 0 1 0 0
1 0 1 0 0 0
1 0 1 1 1 1
1 1 0 0 0 1
1 1 0 1 1 0
1 1 1 0 1 0
1 1 1 1 0 1
Message 10111 → The encoder output is 11, 11, 01, 11,10
Contruct the trellis diagram for the encoder shown, assumng the message sequence of length 5.

Message 10111 → The encoder output is 11, 11, 01, 11,10


Example: The trellis diagram of a rate-1/2, constraint length-3 convolutional code shown in
Figure. The all-zero sequence is transmitted, and the received sequence is 1000100000… Using
the Viterbi decoding algorithm, compute the decoded sequence.
Solution:
Example: Consider the rate r = 1/2, constraint length K = 3 convolutional encoder shown in Figure

You might also like