On the Design of Variable-Length Error-Correcting Codes

檔案

日期

2013-09-01

類型

期刊名稱

IEEE TRANSACTIONS ON COMMUNICATIONS

卷期與頁次

第 61 卷第 9 期,頁 3553–3565

ISSN

0090-6778

語言

英文

摘要

A joint source-channel coding problem that combines the efficient compression of discrete memoryless sources with their reliable communication over memoryless channels via binary prefix-free variable-length error-correcting codes (VLECs) is considered. Under a fixed free distance constraint, a priority-first search algorithm is devised for finding an optimal VLEC with minimal average codeword length. Two variations of the priority-first-search-based code construction algorithm are also provided. The first one improves the resilience of the developed codes against channel noise by additionally considering a performance parameter B-dfree without sacrificing optimality in average codeword length. In the second variation, to accommodate a large free distance constraint as well as a large source alphabet such as the 26-symbol English data source, the VLEC construction algorithm is modified with the objective of significantly reducing its search complexity while still yielding near-optimal codes. A low-complexity sequence maximum a posteriori (MAP) decoder for all VLECs (including our constructed optimal code) is then proposed under the premise that the receiver knows the number of codewords being transmitted. Simulations show that the realized optimal and suboptimal VLECs compare favorably with existing codes in the literature in terms of coding efficiency, search complexity and error rate performance.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Wu, T.-Y., Chen, P.-N., Alajaji, F., & Han, Y. S. (2013). On the Design of Variable-Length Error-Correcting Codes. IEEE TRANSACTIONS ON COMMUNICATIONS, 61(9), 3553–3565. https://doi.org/10.1109/TCOMM.2013.072913.120564

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/22763