State recovery techniques for (M,L) algorithm

A breadth-first decoding algorithm, the (M,L) algorithm, is applied to the decoding of convolutional codes. Simulated performances obtained for codes with rate 1/n are presented. The problem of the loss of the correct state from the set of retained states is considered, together with its influence on the decoding performance. Two recovery techniques that can avoid this problem are proposed and analysed.