Priority-first search decoding for convolutional tail-biting codes

Yunghsiang S. Han, Ting Yi Wu, Hung Ta Pai, Po-Ning Chen, Shin Lin Shieh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

Abstract

Due to rapid interest on the applications of convolutional tail-biting to communication systems, several suboptimal algorithms have been proposed to achieve near-optimal Word error rate (WER) performances with circular Viterbi decoding approach. Among them, the wrap-around Viterbi algorithm (WAVA) proposed in [1] is the one with least decoding complexity. Very recently, a maximum likelihood (ML) decoding algorithm has been proposed in [2]. The scheme has two phases. The Viterbi algorithm is applied to the trellis of the convolutional tail-biting code and the information obtained in the first phase is used by algorithm A*, which is performed to all subtrellises, in the second phase. In this work, a new two-phase ML decoding algorithm is proposed. From the simulation results for the (2, 1, 12) convolutional tail-biting code, the proposed algorithm has 16 times less average decoding complexity in the second phase when compared to the one using algorithm A*and 15123 times less than that of the WAVA, respectively, when SNRb = 4 dB.

Original languageEnglish
Title of host publication2008 International Symposium on Information Theory and its Applications, ISITA2008
DOIs
StatePublished - 1 Dec 2008
Event2008 International Symposium on Information Theory and its Applications, ISITA2008 - Auckland, New Zealand
Duration: 7 Dec 200810 Dec 2008

Publication series

Name2008 International Symposium on Information Theory and its Applications, ISITA2008

Conference

Conference2008 International Symposium on Information Theory and its Applications, ISITA2008
CountryNew Zealand
CityAuckland
Period7/12/0810/12/08

Fingerprint Dive into the research topics of 'Priority-first search decoding for convolutional tail-biting codes'. Together they form a unique fingerprint.

Cite this