Low-Complexity ML Decoding for Convolutional Tail-Biting Codes

Hung-Ta Pai

doi:10.1109/LCOMM.2008.072181

Low-Complexity ML Decoding for Convolutional Tail-Biting Codes

2008-12-01

26

OA

AI

DOI：10.1109/LCOMM.2008.072181

原文链接

摘要

En 中文

Recently, a maximum-likelihood (ML) decoding algorithm with two phases has been proposed for convolutional tail-biting codes [1]. The first phase applies the Viterbi algorithm to obtain the trellis information. and then the second phase employs the algorithm A* to find the ML solution. In this work, we improve the complexity of the algorithm A* by using a new evaluation function. Simulations showed that the improved A* algorithm has over 5 times less average decoding complexity in the second phase when E-b/N-0 >= 4 dB.

Keyword:

Viterbi algorithm

maximum-likelihood

tail-biting codes

algorithm A*

Low-Complexity ML Decoding for Convolutional Tail-Biting Codes

摘要

期刊

机构

引用论文