Study on reduction on average computational complexity of GMD decoding using property of bounded distance decoding

Shunsuke Ueda; Takuya Kusaka

doi:10.1109/CANDAR.2017.10

Study on reduction on average computational complexity of GMD decoding using property of bounded distance decoding

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Recently, high reliability is required in digital communications. Research on error correcting codes are actively conducted to achieve high reliable communications. In this study, a method to reduce average computational complexity of Generalized Minimum Distance (GMD) decoding is proposed. GMD decoding can be implemented by several times bounded distance decoding (BDD). The proposed method reduces the average number of BDDs. The effectiveness of reduction on average execution time of the proposed method is confirmed against a simple method by computer simulations.

Original language	English
Title of host publication	Proceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	584-588
Number of pages	5
Volume	2018-January
ISBN (Electronic)	9781538620878
DOIs	https://doi.org/10.1109/CANDAR.2017.10
Publication status	Published - Apr 23 2018
Event	5th International Symposium on Computing and Networking, CANDAR 2017 - Aomori, Japan Duration: Nov 19 2017 → Nov 22 2017

Other

Other	5th International Symposium on Computing and Networking, CANDAR 2017
Country	Japan
City	Aomori
Period	11/19/17 → 11/22/17

Keywords

average computational complexity
bounded distance decoding
erasure decoding
erasure position
GMD decoding

ASJC Scopus subject areas

Artificial Intelligence
Computer Networks and Communications
Hardware and Architecture

Access to Document

10.1109/CANDAR.2017.10

Fingerprint Dive into the research topics of 'Study on reduction on average computational complexity of GMD decoding using property of bounded distance decoding'. Together they form a unique fingerprint.

Cite this

Ueda, S., & Kusaka, T. (2018). Study on reduction on average computational complexity of GMD decoding using property of bounded distance decoding. In Proceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017 (Vol. 2018-January, pp. 584-588). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CANDAR.2017.10

Study on reduction on average computational complexity of GMD decoding using property of bounded distance decoding. / Ueda, Shunsuke; Kusaka, Takuya.

Proceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017. Vol. 2018-January Institute of Electrical and Electronics Engineers Inc., 2018. p. 584-588.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Ueda, S & Kusaka, T 2018, Study on reduction on average computational complexity of GMD decoding using property of bounded distance decoding. in Proceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017. vol. 2018-January, Institute of Electrical and Electronics Engineers Inc., pp. 584-588, 5th International Symposium on Computing and Networking, CANDAR 2017, Aomori, Japan, 11/19/17. https://doi.org/10.1109/CANDAR.2017.10

@inproceedings{48ddd92a5ca24c0d9d8d825bd2788091,

title = "Study on reduction on average computational complexity of GMD decoding using property of bounded distance decoding",

abstract = "Recently, high reliability is required in digital communications. Research on error correcting codes are actively conducted to achieve high reliable communications. In this study, a method to reduce average computational complexity of Generalized Minimum Distance (GMD) decoding is proposed. GMD decoding can be implemented by several times bounded distance decoding (BDD). The proposed method reduces the average number of BDDs. The effectiveness of reduction on average execution time of the proposed method is confirmed against a simple method by computer simulations.",

keywords = "average computational complexity, bounded distance decoding, erasure decoding, erasure position, GMD decoding",

author = "Shunsuke Ueda and Takuya Kusaka",

year = "2018",

month = apr,

day = "23",

doi = "10.1109/CANDAR.2017.10",

language = "English",

volume = "2018-January",

pages = "584--588",

booktitle = "Proceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "5th International Symposium on Computing and Networking, CANDAR 2017 ; Conference date: 19-11-2017 Through 22-11-2017",

}

TY - GEN

T1 - Study on reduction on average computational complexity of GMD decoding using property of bounded distance decoding

AU - Ueda, Shunsuke

AU - Kusaka, Takuya

PY - 2018/4/23

Y1 - 2018/4/23

N2 - Recently, high reliability is required in digital communications. Research on error correcting codes are actively conducted to achieve high reliable communications. In this study, a method to reduce average computational complexity of Generalized Minimum Distance (GMD) decoding is proposed. GMD decoding can be implemented by several times bounded distance decoding (BDD). The proposed method reduces the average number of BDDs. The effectiveness of reduction on average execution time of the proposed method is confirmed against a simple method by computer simulations.

AB - Recently, high reliability is required in digital communications. Research on error correcting codes are actively conducted to achieve high reliable communications. In this study, a method to reduce average computational complexity of Generalized Minimum Distance (GMD) decoding is proposed. GMD decoding can be implemented by several times bounded distance decoding (BDD). The proposed method reduces the average number of BDDs. The effectiveness of reduction on average execution time of the proposed method is confirmed against a simple method by computer simulations.

KW - average computational complexity

KW - bounded distance decoding

KW - erasure decoding

KW - erasure position

KW - GMD decoding

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

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

U2 - 10.1109/CANDAR.2017.10

DO - 10.1109/CANDAR.2017.10

M3 - Conference contribution

AN - SCOPUS:85050112473

VL - 2018-January

SP - 584

EP - 588

BT - Proceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 5th International Symposium on Computing and Networking, CANDAR 2017

Y2 - 19 November 2017 through 22 November 2017

ER -