Trellis coding and receiver algorithms

Short description

This course enables to quickly acquire knowledge of the selected aspects od channel coding. The aim of the course is to explain trellis coding (definitions, structures, properties), and decoding methods based on "Viterbi Algorithm (VA). In 1967, Viterbi introduced the decoding algorithm, which later was shown to be a maximum-likelihood decoding algorithm equivalent to a dynamic programming solution to the problem of finding the shortest path through a weighted graph.

Student can switch between the subject description and computer experiment whenever he wants. Our student should have a PC with operating system Windows, Internet Explorer 5.5 (or newer), virtual Java machine (Java™ Plug-in) Ver. 1.4.1 (or newer). Internet Explorer 6.0 and Java(TM)Plug-in are links to the web pages where the software is available free.


  1. Introduction to the convolutional codes
  2. Systematic convolutional encoder
  3. State-diagram description of convolutional codes
  4. The maximum-likelihood decoding - Viterbi algorithm
  5. Hard-decision decoding
  6. Soft decision Viterbi decoding
  7. Trellis-Coded Modulation
  8. Max-Log-MAP
  9. Turbo codes
  10. Other approaches of extending the VA
  • Literature