A reduced complexity list single-wrong-turn (SWT) Viterbi decoding algorithm

In this study, we propose a list single-wrong turn (SWT) convolutional decoding algorithm that is computationally less complex than the serial list Viterbi algorithm (SLVA). We present the simulation results for the performance of the proposed algorithm for Gaussian and Rayleigh fading channels using one of the channel encoding schemes adopted in GSM narrowband adaptive multi-rate (AMR) speech application. It has been observed that the performance of the proposed algorithm is very close to that of the list Viterbi algorithm, when the number of searches is limited to best 3 sequences. Moreover, the complexity of the proposed algorithm is considerably less than list VA. Therefore, we believe that the proposed scheme is an attractive alternative to the list VA algorithm.