Priority-first search decoding for convolutional tail-biting codes

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

研究成果: Conference contribution同行評審

10 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題2008 International Symposium on Information Theory and its Applications, ISITA2008
DOIs
出版狀態Published - 1 十二月 2008
事件2008 International Symposium on Information Theory and its Applications, ISITA2008 - Auckland, New Zealand
持續時間: 7 十二月 200810 十二月 2008

出版系列

名字2008 International Symposium on Information Theory and its Applications, ISITA2008

Conference

Conference2008 International Symposium on Information Theory and its Applications, ISITA2008
國家/地區New Zealand
城市Auckland
期間7/12/0810/12/08

指紋

深入研究「Priority-first search decoding for convolutional tail-biting codes」主題。共同形成了獨特的指紋。

引用此