Tutorial 12 – Convolutional Coding and Decoding Made Easy

Description: Convolutional Coding and Decoding Made Easy

Download: convo.pdf

10 comments on “Tutorial 12 – Convolutional Coding and Decoding Made Easy
  1. Randy Pilkington says:

    I believe figure 6c and 6d should have input=0 in the caption rather than input=1. Also in 6d, the input state should be 001. Unless I miss something!

    By the way, I really appreciate your tutorials. Very well written and intuitive! Many thanks.

  2. Damoon Charati says:

    Firstly I really appreciate your great tutorial. According to page 11, last paragraph describing how to encode 1101 using the state diagram, my question is why do we start from the MSB( from left to right)? like you wrote the arrival of 1 and then 0 and then 1 and finally 1?


  3. Bharat Goyal says:

    Thanks for the tutorial….How to make trellis diagram for 2/3 or 3/4 etc convolution encoder…
    i.e. how to make trellis diagram when input bit is more than one…as this is used in TCM

  4. Vasudeva Murthy Vadlakonda says:

    No other author has explained the coding and decoding theory with so much of clarity. One small clarification. The tree diagram on Page:13; 11(100)up 11(011) up 01(010) may have to be corrected as 11(100)up 11(010) up 01(001). Regret if I am giving a wrong suggestion.

    • Profile photo of Charan L. Charan L. says:

      Yes, you are correct. Need to go back and fix it. I am busy trying get my book out so it might be while.
      Thank you very much for you comments, however.

  5. mick says:

    very short and impressive note. Thank you!

  6. rahul says:

    Referring to the list of generator polynomials given on page 2. The number of binary bits for both G1 and G2 for a given constraint length are not matching. Why is this so?

  7. R.Runthala says:

    after reading a lot , i cant find how connections ( basically I/Ps ) to modulo-2 adders are decided , you mentioned that Peterson and weldon mentioned about how to decide the Polynomial , but i cant find that,so can you plz let me know how polynomials (i.e which Shift registers output will go to which Modulo adder and how they are connected.

    • Profile photo of Charan L. Charan L. says:

      Let’s say the polynomial is x^2 + x^3
      Then the coefficients are 0, 1, 1. Now 0 being the coefficient of the linear term x, 1 being the coefficient of two next polynomials x^2 and x^3. Then these are your connections.
      Its really quite simple.
      Charan Langton
      PS I have already given a list of “good” polynomials in the tutorial.

  8. Chandru Aswani says:

    I think I found a typo on Pg-12, Tree Diagrams section: Ref. Fig-9, at the first coding step, the output is 11 and the new state is 100. However, the text says ‘111’.

    Many thanks for this lucid tutorial.

Leave a Reply

Your email address will not be published. Required fields are marked *


Skip to toolbar