Analysis on Decoding Algorithms Based on Sectionalised Trellises of Block Codes and Their Dual |
A trellis T is an edge-labeled directed graph with the property that every state in T has a well-defined depth which can represent corresponding codes in coding theory. Currently, trellis-based algorithms are widely used, for example, Viterbi algorithm [7] and MAP algorithm [4]. There are many different factors that impose on the complexity of trellises, each decoding method has different level of complexity. In this paper, we briefly sur-vey the complexity of the Viterbi decoding algorithm with Hamming codes and their dual.
Cai J, Ambroze MA