A low-complexity maximum likelihood decoder for tail-biting trellis
Lists
Only you see this
Abstract
Tail-biting trellises are defined on a circular time axis and can have a smaller number of states than equivalent conventional trellises. Existing circular Viterbi algorithms (CVAs) on the tail-biting trellis are non-convergent and sub-optimal. In this study, we show that the net path metric of each tail-biting path is lower-bounded during the decoding process of the CVA. This property can be applied to remove unnecessary iterations of the CVA and results in a convergent maximum likelihood (ML) decoder. Simulation results show that the proposed algorithm exhibits higher decoding efficiency compared with other existing ML decoders.
BibTeX
@article{wang2013low,
author = {Xiaotao Wang and Hua Qian and Kai Kang and Weidong Xiang},
title = {{A low-complexity maximum likelihood decoder for tail-biting trellis}},
journal = {EURASIP J. Wirel. Commun. Netw.},
year = {2013},
url = {https://openreview.net/forum?id=ERqSa2eb8-},
}Loading related content...