On the Design of Near-Optimal Variable-Length Error-Correcting Codes for Large Source Alphabets

Yen Ming Chen; Feng Tsang Wu; Chih Peng Li; Pramod K. Varshney

doi:10.1109/TCOMM.2020.3024192

On the Design of Near-Optimal Variable-Length Error-Correcting Codes for Large Source Alphabets

Yen Ming Chen, Feng Tsang Wu, Chih Peng Li, Pramod K. Varshney

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

2 Scopus citations

Abstract

In this paper, we focus on near-optimal designs for variable-length error-correcting (VLEC) codes, while considering the performance in terms of both the average codeword length (ACL) and the symbol-error rate (SER). The criteria for narrowing the search space and enhancing the SER performance are investigated. An efficient code construction algorithm is then devised based on a random search process. Taking advantage of the significantly reduced search complexity, we are able to construct near-optimal VLEC codes for large source alphabets. Numerical results obtained for various free distance values and alphabet sizes show that constructed VLEC codes have both reduced ACL values and enhanced SER performances. Performance improvement is more notable for large source alphabets.

Original language	English (US)
Article number	9197658
Pages (from-to)	7896-7910
Number of pages	15
Journal	IEEE Transactions on Communications
Volume	68
Issue number	12
DOIs	https://doi.org/10.1109/TCOMM.2020.3024192
State	Published - Dec 2020
Externally published	Yes

Keywords

Joint source-channel coding (JSSC)
average codeword length (ACL)
digital communications
variable-length error-correcting (VLEC) codes

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/TCOMM.2020.3024192

Cite this

@article{fdfa36b01e0a47daa78e4e6ccee80a0f,

title = "On the Design of Near-Optimal Variable-Length Error-Correcting Codes for Large Source Alphabets",

abstract = "In this paper, we focus on near-optimal designs for variable-length error-correcting (VLEC) codes, while considering the performance in terms of both the average codeword length (ACL) and the symbol-error rate (SER). The criteria for narrowing the search space and enhancing the SER performance are investigated. An efficient code construction algorithm is then devised based on a random search process. Taking advantage of the significantly reduced search complexity, we are able to construct near-optimal VLEC codes for large source alphabets. Numerical results obtained for various free distance values and alphabet sizes show that constructed VLEC codes have both reduced ACL values and enhanced SER performances. Performance improvement is more notable for large source alphabets.",

keywords = "Joint source-channel coding (JSSC), average codeword length (ACL), digital communications, variable-length error-correcting (VLEC) codes",

author = "Chen, {Yen Ming} and Wu, {Feng Tsang} and Li, {Chih Peng} and Varshney, {Pramod K.}",

note = "Publisher Copyright: {\textcopyright} 1972-2012 IEEE.",

year = "2020",

month = dec,

doi = "10.1109/TCOMM.2020.3024192",

language = "English (US)",

volume = "68",

pages = "7896--7910",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

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

number = "12",

}

TY - JOUR

T1 - On the Design of Near-Optimal Variable-Length Error-Correcting Codes for Large Source Alphabets

AU - Chen, Yen Ming

AU - Wu, Feng Tsang

AU - Li, Chih Peng

AU - Varshney, Pramod K.

PY - 2020/12

Y1 - 2020/12

N2 - In this paper, we focus on near-optimal designs for variable-length error-correcting (VLEC) codes, while considering the performance in terms of both the average codeword length (ACL) and the symbol-error rate (SER). The criteria for narrowing the search space and enhancing the SER performance are investigated. An efficient code construction algorithm is then devised based on a random search process. Taking advantage of the significantly reduced search complexity, we are able to construct near-optimal VLEC codes for large source alphabets. Numerical results obtained for various free distance values and alphabet sizes show that constructed VLEC codes have both reduced ACL values and enhanced SER performances. Performance improvement is more notable for large source alphabets.

AB - In this paper, we focus on near-optimal designs for variable-length error-correcting (VLEC) codes, while considering the performance in terms of both the average codeword length (ACL) and the symbol-error rate (SER). The criteria for narrowing the search space and enhancing the SER performance are investigated. An efficient code construction algorithm is then devised based on a random search process. Taking advantage of the significantly reduced search complexity, we are able to construct near-optimal VLEC codes for large source alphabets. Numerical results obtained for various free distance values and alphabet sizes show that constructed VLEC codes have both reduced ACL values and enhanced SER performances. Performance improvement is more notable for large source alphabets.

KW - Joint source-channel coding (JSSC)

KW - average codeword length (ACL)

KW - digital communications

KW - variable-length error-correcting (VLEC) codes

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

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

U2 - 10.1109/TCOMM.2020.3024192

DO - 10.1109/TCOMM.2020.3024192

M3 - Article

AN - SCOPUS:85097990865

SN - 0090-6778

VL - 68

SP - 7896

EP - 7910

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 12

M1 - 9197658

ER -

On the Design of Near-Optimal Variable-Length Error-Correcting Codes for Large Source Alphabets

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this