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

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

*此作品的通信作者

研究成果: Conference contribution同行評審

3 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
頁面2223-2227
頁數5
DOIs
出版狀態Published - 26 10月 2011
事件2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation
持續時間: 31 7月 20115 8月 2011

出版系列

名字IEEE International Symposium on Information Theory - Proceedings
ISSN(列印)2157-8104

Conference

Conference2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
國家/地區Russian Federation
城市St. Petersburg
期間31/07/115/08/11

指紋

深入研究「On the construction and MAP decoding of optimal variable-length error-correcting codes」主題。共同形成了獨特的指紋。

引用此