On the construction and MAP decoding of optimal variable-length error-correcting codes

Ting Yi Wu; Po-Ning Chen; Fady Alajaji; Yunghsiang S. Han

doi:10.1109/ISIT.2011.6033955

On the construction and MAP decoding of optimal variable-length error-correcting codes

Ting Yi Wu^*, Po-Ning Chen, Fady Alajaji, Yunghsiang S. Han

^*Corresponding author for this work

Department of Electrical and Computer Engineering

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

3 Scopus citations

Abstract

In this paper, we present a novel algorithm that guarantees of finding a variable-length error-correcting code (VLEC) with minimal average codeword length for a fixed free distance d_free. We also propose a low complexity maximum a posterior (MAP) decoding algorithm for our codes under the premise that the receiver knows the number of codewords being transmitted. The resulting VLEC provides significant gains over other codes from the literature. When compared with separate source-channel tandem codes with identical d _free, such as a tandem code consisting of a Huffman source code concatenated with a (2, 1, 4) tail-biting convolutional channel code, our system has only a 0.3 dB performance loss at a bit error rate of 10^-5 while requiring significantly less decoding complexity.

Original language	English
Title of host publication	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages	2223-2227
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2011.6033955
State	Published - 26 Oct 2011
Event	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation Duration: 31 Jul 2011 → 5 Aug 2011

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8104

Conference

Conference	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Country/Territory	Russian Federation
City	St. Petersburg
Period	31/07/11 → 5/08/11

Access to Document

10.1109/ISIT.2011.6033955

Cite this

Wu, T. Y., Chen, P.-N., Alajaji, F., & Han, Y. S. (2011). On the construction and MAP decoding of optimal variable-length error-correcting codes. In 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 (pp. 2223-2227). Article 6033955 (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2011.6033955

@inproceedings{e0d44ceb6dd847b8a7b8eb63c48bf2e5,

title = "On the construction and MAP decoding of optimal variable-length error-correcting codes",

abstract = "In this paper, we present a novel algorithm that guarantees of finding a variable-length error-correcting code (VLEC) with minimal average codeword length for a fixed free distance dfree. We also propose a low complexity maximum a posterior (MAP) decoding algorithm for our codes under the premise that the receiver knows the number of codewords being transmitted. The resulting VLEC provides significant gains over other codes from the literature. When compared with separate source-channel tandem codes with identical d free, such as a tandem code consisting of a Huffman source code concatenated with a (2, 1, 4) tail-biting convolutional channel code, our system has only a 0.3 dB performance loss at a bit error rate of 10-5 while requiring significantly less decoding complexity.",

author = "Wu, {Ting Yi} and Po-Ning Chen and Fady Alajaji and Han, {Yunghsiang S.}",

year = "2011",

month = oct,

day = "26",

doi = "10.1109/ISIT.2011.6033955",

language = "English",

isbn = "9781457705953",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "2223--2227",

booktitle = "2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011",

note = "2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 ; Conference date: 31-07-2011 Through 05-08-2011",

}

Wu, TY, Chen, P-N, Alajaji, F & Han, YS 2011, On the construction and MAP decoding of optimal variable-length error-correcting codes. in 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011., 6033955, IEEE International Symposium on Information Theory - Proceedings, pp. 2223-2227, 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russian Federation, 31/07/11. https://doi.org/10.1109/ISIT.2011.6033955

On the construction and MAP decoding of optimal variable-length error-correcting codes. / Wu, Ting Yi; Chen, Po-Ning; Alajaji, Fady et al.
2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011. 2011. p. 2223-2227 6033955 (IEEE International Symposium on Information Theory - Proceedings).

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

TY - GEN

T1 - On the construction and MAP decoding of optimal variable-length error-correcting codes

AU - Wu, Ting Yi

AU - Chen, Po-Ning

AU - Alajaji, Fady

AU - Han, Yunghsiang S.

PY - 2011/10/26

Y1 - 2011/10/26

N2 - In this paper, we present a novel algorithm that guarantees of finding a variable-length error-correcting code (VLEC) with minimal average codeword length for a fixed free distance dfree. We also propose a low complexity maximum a posterior (MAP) decoding algorithm for our codes under the premise that the receiver knows the number of codewords being transmitted. The resulting VLEC provides significant gains over other codes from the literature. When compared with separate source-channel tandem codes with identical d free, such as a tandem code consisting of a Huffman source code concatenated with a (2, 1, 4) tail-biting convolutional channel code, our system has only a 0.3 dB performance loss at a bit error rate of 10-5 while requiring significantly less decoding complexity.

AB - In this paper, we present a novel algorithm that guarantees of finding a variable-length error-correcting code (VLEC) with minimal average codeword length for a fixed free distance dfree. We also propose a low complexity maximum a posterior (MAP) decoding algorithm for our codes under the premise that the receiver knows the number of codewords being transmitted. The resulting VLEC provides significant gains over other codes from the literature. When compared with separate source-channel tandem codes with identical d free, such as a tandem code consisting of a Huffman source code concatenated with a (2, 1, 4) tail-biting convolutional channel code, our system has only a 0.3 dB performance loss at a bit error rate of 10-5 while requiring significantly less decoding complexity.

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

U2 - 10.1109/ISIT.2011.6033955

DO - 10.1109/ISIT.2011.6033955

M3 - Conference contribution

AN - SCOPUS:80054805667

SN - 9781457705953

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2223

EP - 2227

BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

Y2 - 31 July 2011 through 5 August 2011

ER -

On the construction and MAP decoding of optimal variable-length error-correcting codes

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this