IEICE Transactions on Communications
Online ISSN : 1745-1345
Print ISSN : 0916-8516

この記事には本公開記事があります。本公開記事を参照してください。
引用する場合も本公開記事を引用してください。

Performance Comparison of List Viterbi Algorithm of Tail-Biting Convolutional Code for Future Machine Type Communications
Shunichi BUSHISUESatoshi SUYAMASatoshi NAGATANobuhiko MIKI
著者情報
ジャーナル 認証あり 早期公開

論文ID: 2016FGP0018

この記事には本公開記事があります。
詳細
抄録

In the future, 5G radio access and support for the internet of things (IoT) is becoming more important, which is called machine type communications. Different from current mobile communication systems, machine type communications generates relatively small packets. In order to support such small packets with high reliability, channel coding techniques are inevitable. One of the most effective channel codes in such conditions is the tail-biting convolutional code, since it is used in LTE systems due to its good performance for small packet sizes. By employing a list Viterbi algorithm for the tail-biting convolutional code, the block error rate (BLER) performances is further improved. Therefore, this paper evaluates the BLER performances of several list Viterbi algorithms, i.e., circular parallel list Viterbi algorithm (CPLVA), per stage CPLVA (PSCPLVA), and successive state and sequence estimation (SSSE). In the evaluation, computational complexity is also taken into account. It is shown that the performance of the CPLVA is better in the wide range of computational complexity defined in this paper.

著者関連情報
© 2017 The Institute of Electronics, Information and Communication Engineers
feedback
Top