Institute of Electrical & Electronic Engineers
In this paper, the authors compare the performances of the M-Algorithm (MA) and the List Viterbi Algorithm (LVA) for a concatenated coding scheme with outer cyclic redundancy code (CRC) and inner convolutional code. Even though the Viterbi Algorithm (VA) performs the optimum decoding for convolutional codes, it is sub-optimum for the concatenated system. The LVA provides an ordered list of decoded bit sequences by embedding limited list search in its trellis structure. On the contrary, the MA is a list-based algorithm which can be viewed as a constrained tree search decoder. Their results show that for the considered concatenated system, list-based algorithm outperforms trellis-based algorithm for equivalent complexity.