• Home
  • Textbooks
  • Foundations of coding: theory and applications of error-correcting codes
  • Convolutional Codes

Foundations of coding: theory and applications of error-correcting codes

Jiri Adamek

Chapter 14

Convolutional Codes - all with Video Answers

Educators


Chapter Questions

Problem 1

Design an encoder of the binary convolutional $(2,1)$-code with the generator polynomial $g_0(x)=1+x+x^3+x^4+x^6+x^7+x^9$. Encode 110 .

Check back soon!

Problem 2

Find a five-row generator matrix for the code in 14A.

Check back soon!

Problem 3

Design an encoder of a binary convolutional $(3,2)$-code of memory $m=2$.

Check back soon!
01:59

Problem 4

The encoder in Figure 4 in 14.2 uses five shift registers. Design an encoder of the same code using four shift register states only.

Roee Shalom
Roee Shalom
Numerade Educator

Problem 5

Describe the generator polynomials of the convolutional code in Figure 11.

Check back soon!

Problem 6

Find a five-row generator matrix for the code in 14E. Encode 11001.

Check back soon!

Problem 7

Design an encoder for the (2,3)-code with the generator polynomials $g_0(x)=1+x+x^3+x^5+x^6, g_1(x)=x+x^2+x^3+x^4$, and $g_2(x)=$ $1+x^2+x^3+x^5+x^6$.

Check back soon!

Problem 8

Use the Viterbi algorithnm to decode $w=01000001000 \ldots$ provided that the code of Example 2 of 14.4 is used (and $b=7$ ).

Check back soon!

Problem 9

Draw the trellis of the $(2,1)$-code with $g_0(x)=1+x^2+x^3+x^5$. Use the Viterbi algorithm to decode $\mathbf{w}=1000001000001000 \ldots$.

Check back soon!

Problem 10

Generalize the concept of a trellis diagram to $(n, k)$-codes. Draw the trellis of the $(2,2)$-code in Figure 12.

Check back soon!