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 | |
| 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 |
Fingerprint
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
Cite this
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
}
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.
ER -