Exponential Error Bounds and Decoding Complexity for Block Codes Constructed by Unit Memory Trellis Codes of Branch Length Two

Shigeichi Hirasawa, Hideki Yagi, Manabu Kobayashi, Masao Kasahara

研究成果: Conference contribution

1 引用 (Scopus)

抜粋

Performance of block codes constructed by unit memory (UM) trellis codes is discussed from random coding arguments. There are three methods to obtain block codes from trellis codes, i.e., those of (a) Tail Termination (TT), (b) Direct Truncation (DT), and (c) Tail Biting (TB). In this paper, we derive exponential error bounds and decoding complexity for block codes constructed by the UM trellis codes of branch length two based on the above three methods to uniformly discuss their performance. For the UM trellis codes of branch length two, the error exponent of the tail biting unit memory (TB-UM) trellis codes is shown to be larger than or equal to those of the ordinary block codes, the tail termination unit memory (TT-UM) and the direct truncation unit memory (DT-UM) trellis codes for all rates less than the capacity. Decoding complexity for the TB-UM trellis codes of branch length two exhibits interesting property since their trellis diagrams become simple. Taking into account of the asymptotic decoding complexity, the TB-UM trellis codes are also shown to have a smaller upper bound on the probability of decoding error compared to the ordinary block codes for the same rate with the same decoding complexity.

元の言語English
ホスト出版物のタイトル2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019
出版者Institute of Electrical and Electronics Engineers Inc.
ISBN(電子版)9781728111513
DOI
出版物ステータスPublished - 2019 4 16
イベント53rd Annual Conference on Information Sciences and Systems, CISS 2019 - Baltimore, United States
継続期間: 2019 3 202019 3 22

出版物シリーズ

名前2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019

Conference

Conference53rd Annual Conference on Information Sciences and Systems, CISS 2019
United States
Baltimore
期間19/3/2019/3/22

ASJC Scopus subject areas

  • Information Systems

フィンガープリント Exponential Error Bounds and Decoding Complexity for Block Codes Constructed by Unit Memory Trellis Codes of Branch Length Two' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Hirasawa, S., Yagi, H., Kobayashi, M., & Kasahara, M. (2019). Exponential Error Bounds and Decoding Complexity for Block Codes Constructed by Unit Memory Trellis Codes of Branch Length Two. : 2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019 [8692938] (2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CISS.2019.8692938