Performance comparison of short-length error-correcting codes

J. Van Wonterghem, A. Alloumf, Joseph Boutros, M. Moeneclaey

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

11 Citations (Scopus)

Abstract

We compare the performance of short-length linear binary codes on the binary erasure channel and the binary-input Gaussian channel. We use a universal decoder that can decode any linear binary block code: Gaussian-elimination based Maximum-Likelihood decoder on the erasure channel and probabilistic Ordered Statistics Decoder on the Gaussian channel. As such we compare codes and not decoders. The word error rate versus the channel parameter is found for LDPC, Reed-Muller, Polar, and BCH codes at length 256 bits. BCH codes outperform other codes in absence of cyclic redundancy check. Under joint decoding, the concatenation of a cyclic redundancy check makes all codes perform very close to optimal lower bounds.

Original languageEnglish
Title of host publication2016 IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509043613
DOIs
Publication statusPublished - 27 Dec 2016
Externally publishedYes
Event2016 IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2016 - Mons, Belgium
Duration: 22 Nov 2016 → …

Other

Other2016 IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2016
CountryBelgium
CityMons
Period22/11/16 → …

Fingerprint

Redundancy
Binary codes
Block codes
Maximum likelihood
Decoding
Statistics

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Wonterghem, J. V., Alloumf, A., Boutros, J., & Moeneclaey, M. (2016). Performance comparison of short-length error-correcting codes. In 2016 IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2016 [7797660] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SCVT.2016.7797660

Performance comparison of short-length error-correcting codes. / Wonterghem, J. Van; Alloumf, A.; Boutros, Joseph; Moeneclaey, M.

2016 IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2016. Institute of Electrical and Electronics Engineers Inc., 2016. 7797660.

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

Wonterghem, JV, Alloumf, A, Boutros, J & Moeneclaey, M 2016, Performance comparison of short-length error-correcting codes. in 2016 IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2016., 7797660, Institute of Electrical and Electronics Engineers Inc., 2016 IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2016, Mons, Belgium, 22/11/16. https://doi.org/10.1109/SCVT.2016.7797660
Wonterghem JV, Alloumf A, Boutros J, Moeneclaey M. Performance comparison of short-length error-correcting codes. In 2016 IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2016. Institute of Electrical and Electronics Engineers Inc. 2016. 7797660 https://doi.org/10.1109/SCVT.2016.7797660
Wonterghem, J. Van ; Alloumf, A. ; Boutros, Joseph ; Moeneclaey, M. / Performance comparison of short-length error-correcting codes. 2016 IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2016. Institute of Electrical and Electronics Engineers Inc., 2016.
@inproceedings{47fec609bf634002868cb840e8836b2d,
title = "Performance comparison of short-length error-correcting codes",
abstract = "We compare the performance of short-length linear binary codes on the binary erasure channel and the binary-input Gaussian channel. We use a universal decoder that can decode any linear binary block code: Gaussian-elimination based Maximum-Likelihood decoder on the erasure channel and probabilistic Ordered Statistics Decoder on the Gaussian channel. As such we compare codes and not decoders. The word error rate versus the channel parameter is found for LDPC, Reed-Muller, Polar, and BCH codes at length 256 bits. BCH codes outperform other codes in absence of cyclic redundancy check. Under joint decoding, the concatenation of a cyclic redundancy check makes all codes perform very close to optimal lower bounds.",
author = "Wonterghem, {J. Van} and A. Alloumf and Joseph Boutros and M. Moeneclaey",
year = "2016",
month = "12",
day = "27",
doi = "10.1109/SCVT.2016.7797660",
language = "English",
booktitle = "2016 IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Performance comparison of short-length error-correcting codes

AU - Wonterghem, J. Van

AU - Alloumf, A.

AU - Boutros, Joseph

AU - Moeneclaey, M.

PY - 2016/12/27

Y1 - 2016/12/27

N2 - We compare the performance of short-length linear binary codes on the binary erasure channel and the binary-input Gaussian channel. We use a universal decoder that can decode any linear binary block code: Gaussian-elimination based Maximum-Likelihood decoder on the erasure channel and probabilistic Ordered Statistics Decoder on the Gaussian channel. As such we compare codes and not decoders. The word error rate versus the channel parameter is found for LDPC, Reed-Muller, Polar, and BCH codes at length 256 bits. BCH codes outperform other codes in absence of cyclic redundancy check. Under joint decoding, the concatenation of a cyclic redundancy check makes all codes perform very close to optimal lower bounds.

AB - We compare the performance of short-length linear binary codes on the binary erasure channel and the binary-input Gaussian channel. We use a universal decoder that can decode any linear binary block code: Gaussian-elimination based Maximum-Likelihood decoder on the erasure channel and probabilistic Ordered Statistics Decoder on the Gaussian channel. As such we compare codes and not decoders. The word error rate versus the channel parameter is found for LDPC, Reed-Muller, Polar, and BCH codes at length 256 bits. BCH codes outperform other codes in absence of cyclic redundancy check. Under joint decoding, the concatenation of a cyclic redundancy check makes all codes perform very close to optimal lower bounds.

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

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

U2 - 10.1109/SCVT.2016.7797660

DO - 10.1109/SCVT.2016.7797660

M3 - Conference contribution

BT - 2016 IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -