Minimum-Error Trellis-Path Decoders for Convolutional Codes

摘要

In this final report on a one-year study of syndrome decoding techniques, the results of previous studies are extended and applied to the development of a new class of minimum-error trellis-path decoders for (n, k) convolutional codes. Also, a new method is devised by example for finding the minimum-error trellis path. This promising technique is called piecewise L-step minimum-error decoding. Other more standard decoding methods can also be used to find the minimum-error trellis path, such as a Viterbi-like algorithm and the various sequential decoding techniques.