On the Performance of Short Channel Codes for Ultra-Reliable and Low-Latency Communications

Eunyoung Cho; Hyosang Ju; Hyunjae Lee; Ji Woong Jang; Sang Hyo Kim

doi:10.7840/kics.2020.45.10.1667

On the Performance of Short Channel Codes for Ultra-Reliable and Low-Latency Communications

Eunyoung Cho, Hyosang Ju, Hyunjae Lee, Ji Woong Jang, Sang Hyo Kim

Research output: Contribution to journal › Article › peer-review

Abstract

In this paper, we analyzed the error performance and decoding complexity of various short channel codes for ultrareliable and low-latency communications. We confirmed the maximum error rate performances for four channel codes and also compared low-complexity error rate satisfying reference performance. Consequently, for code length 64, we verified that extended Bose-Chaudhuri-Hocquenghem codes decoded with ordered statistics decoding are the strongest channel code candidates since they acquire not only the best error performance but also competitive decoding complexity simultaneously. For code length 128, generalized Reed-Muller codes and polar codes of successive cancellation list (SCL) and cyclic redundancy check-aided SCL decoding respectively are the powerful channel code candidates, thanks to their prevailing error performance and decoding complexity.

Original language	English
Pages (from-to)	1667-1675
Number of pages	9
Journal	Journal of Korean Institute of Communications and Information Sciences
Volume	45
Issue number	10
DOIs	https://doi.org/10.7840/kics.2020.45.10.1667
State	Published - Oct 2020
Externally published	Yes

Keywords

BCH Codes
LDPC Codes
Polar Codes
Reed-Muller Codes
URLLC

Access to Document

10.7840/kics.2020.45.10.1667

Cite this

@article{99cb228c75cc4b2c82e673635190632f,

title = "On the Performance of Short Channel Codes for Ultra-Reliable and Low-Latency Communications",

abstract = "In this paper, we analyzed the error performance and decoding complexity of various short channel codes for ultrareliable and low-latency communications. We confirmed the maximum error rate performances for four channel codes and also compared low-complexity error rate satisfying reference performance. Consequently, for code length 64, we verified that extended Bose-Chaudhuri-Hocquenghem codes decoded with ordered statistics decoding are the strongest channel code candidates since they acquire not only the best error performance but also competitive decoding complexity simultaneously. For code length 128, generalized Reed-Muller codes and polar codes of successive cancellation list (SCL) and cyclic redundancy check-aided SCL decoding respectively are the powerful channel code candidates, thanks to their prevailing error performance and decoding complexity.",

keywords = "BCH Codes, LDPC Codes, Polar Codes, Reed-Muller Codes, URLLC",

author = "Eunyoung Cho and Hyosang Ju and Hyunjae Lee and Jang, \{Ji Woong\} and Kim, \{Sang Hyo\}",

year = "2020",

month = oct,

doi = "10.7840/kics.2020.45.10.1667",

language = "English",

volume = "45",

pages = "1667--1675",

journal = "Journal of Korean Institute of Communications and Information Sciences",

issn = "1226-4717",

publisher = "Korean Institute of Communications and Information Sciences",

number = "10",

}

TY - JOUR

T1 - On the Performance of Short Channel Codes for Ultra-Reliable and Low-Latency Communications

AU - Cho, Eunyoung

AU - Ju, Hyosang

AU - Lee, Hyunjae

AU - Jang, Ji Woong

AU - Kim, Sang Hyo

PY - 2020/10

Y1 - 2020/10

N2 - In this paper, we analyzed the error performance and decoding complexity of various short channel codes for ultrareliable and low-latency communications. We confirmed the maximum error rate performances for four channel codes and also compared low-complexity error rate satisfying reference performance. Consequently, for code length 64, we verified that extended Bose-Chaudhuri-Hocquenghem codes decoded with ordered statistics decoding are the strongest channel code candidates since they acquire not only the best error performance but also competitive decoding complexity simultaneously. For code length 128, generalized Reed-Muller codes and polar codes of successive cancellation list (SCL) and cyclic redundancy check-aided SCL decoding respectively are the powerful channel code candidates, thanks to their prevailing error performance and decoding complexity.

AB - In this paper, we analyzed the error performance and decoding complexity of various short channel codes for ultrareliable and low-latency communications. We confirmed the maximum error rate performances for four channel codes and also compared low-complexity error rate satisfying reference performance. Consequently, for code length 64, we verified that extended Bose-Chaudhuri-Hocquenghem codes decoded with ordered statistics decoding are the strongest channel code candidates since they acquire not only the best error performance but also competitive decoding complexity simultaneously. For code length 128, generalized Reed-Muller codes and polar codes of successive cancellation list (SCL) and cyclic redundancy check-aided SCL decoding respectively are the powerful channel code candidates, thanks to their prevailing error performance and decoding complexity.

KW - BCH Codes

KW - LDPC Codes

KW - Polar Codes

KW - Reed-Muller Codes

KW - URLLC

UR - https://www.scopus.com/pages/publications/85189005837

U2 - 10.7840/kics.2020.45.10.1667

DO - 10.7840/kics.2020.45.10.1667

M3 - Article

AN - SCOPUS:85189005837

SN - 1226-4717

VL - 45

SP - 1667

EP - 1675

JO - Journal of Korean Institute of Communications and Information Sciences

JF - Journal of Korean Institute of Communications and Information Sciences

IS - 10

ER -

On the Performance of Short Channel Codes for Ultra-Reliable and Low-Latency Communications

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this