On the Design of Variable-Length Error-Correcting Codes

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 prior...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on communications Ročník 61; číslo 9; s. 3553 - 3565
Hlavní autoři:	Ting-Yi Wu, Po-Ning Chen, Alajaji, Fady, Han, Yunghsiang S.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.09.2013 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithm design and analysis Algorithms Applied sciences average codeword length Channels Codes Coding Coding, codes Complexity Complexity theory Construction Decoding Encoding Error correction Error correction codes error resilient data compression Exact sciences and technology Information, signal and communications theory Joint source-channel coding Measurement Optimization Receivers Searching sequence maximum a posteriori decoding Signal and communications theory Studies symbol error rate Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) variable-length codes Alphabet Performance evaluation Error estimation Data compression Error rate Joint source channel coding error resilient data compression A posteriori estimation sequence maximum a posteriori decoding Symbol error rate Variable length code Joint source-channel coding average codeword length Transmission channel Decoding Search algorithm Resilience English variable-length codes Memoryless channel Simulation Optimal code Error detection Error correcting code Error correction Memoryless source
ISSN:	0090-6778, 1558-0857
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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.
Bibliografie:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
ISSN:	0090-6778 1558-0857
DOI:	10.1109/TCOMM.2013.072913.120564