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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publication2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728111513
DOIs
Publication statusPublished - 2019 Apr 16
Event53rd Annual Conference on Information Sciences and Systems, CISS 2019 - Baltimore, United States
Duration: 2019 Mar 202019 Mar 22

Publication series

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

Conference

Conference53rd Annual Conference on Information Sciences and Systems, CISS 2019
CountryUnited States
CityBaltimore
Period19/3/2019/3/22

Fingerprint

Trellis codes
Block codes
Decoding
Data storage equipment

ASJC Scopus subject areas

  • Information Systems

Cite this

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. In 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

Exponential Error Bounds and Decoding Complexity for Block Codes Constructed by Unit Memory Trellis Codes of Branch Length Two. / Hirasawa, Shigeichi; Yagi, Hideki; Kobayashi, Manabu; Kasahara, Masao.

2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019. Institute of Electrical and Electronics Engineers Inc., 2019. 8692938 (2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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. in 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., 53rd Annual Conference on Information Sciences and Systems, CISS 2019, Baltimore, United States, 19/3/20. https://doi.org/10.1109/CISS.2019.8692938
Hirasawa S, Yagi H, Kobayashi M, Kasahara M. Exponential Error Bounds and Decoding Complexity for Block Codes Constructed by Unit Memory Trellis Codes of Branch Length Two. In 2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019. Institute of Electrical and Electronics Engineers Inc. 2019. 8692938. (2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019). https://doi.org/10.1109/CISS.2019.8692938
Hirasawa, Shigeichi ; Yagi, Hideki ; Kobayashi, Manabu ; Kasahara, Masao. / 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. Institute of Electrical and Electronics Engineers Inc., 2019. (2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019).
@inproceedings{e57bb963527a4e1da70c4d460df7b44e,
title = "Exponential Error Bounds and Decoding Complexity for Block Codes Constructed by Unit Memory Trellis Codes of Branch Length Two",
abstract = "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.",
author = "Shigeichi Hirasawa and Hideki Yagi and Manabu Kobayashi and Masao Kasahara",
year = "2019",
month = "4",
day = "16",
doi = "10.1109/CISS.2019.8692938",
language = "English",
series = "2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019",

}

TY - GEN

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

AU - Hirasawa, Shigeichi

AU - Yagi, Hideki

AU - Kobayashi, Manabu

AU - Kasahara, Masao

PY - 2019/4/16

Y1 - 2019/4/16

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85065193225&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85065193225&partnerID=8YFLogxK

U2 - 10.1109/CISS.2019.8692938

DO - 10.1109/CISS.2019.8692938

M3 - Conference contribution

T3 - 2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019

BT - 2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019

PB - Institute of Electrical and Electronics Engineers Inc.

ER -