Efficient Computation and Optimization of the Free Distance of Variable-Length Finite-State Joint Source-Channel Codes

被引：9
|
作者：
Diallo, Amadou [1 ]
Weidmann, Claudio [2 ]
Kieffer, Michel [3 ]
机构：
[1] Univ Paris Sud, SUPELEC, CNRS, L2S, F-91192 Gif Sur Yvette, France
[2] Vienna Univ Technol, INTHFT, Vienna, Austria
[3] Telecom ParisTech, CNRS, LTCI, F-75014 Paris, France
来源：
IEEE TRANSACTIONS ON COMMUNICATIONS | 2011年 / 59卷 / 04期
关键词：
Variable length codes; finite state machines; source coding; channel coding; arithmetic codes; CONVOLUTIONAL-CODES; ERROR; PERFORMANCE; SPECTRUM;
D O I：
10.1109/TCOMM.2011.020411.090780
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
This paper considers the optimization of a class of joint source-channel codes described by finite-state encoders (FSEs) generating variable-length codes. It focuses on FSEs associated to joint source-channel integer arithmetic codes, which are uniquely decodable codes by design. An efficient method for computing the free distance of such codes using Dijkstra's algorithm is proposed. To facilitate the search for codes with good distance properties, FSEs are organized within a tree structure, which allows the use of efficient branch-and-prune techniques avoiding a search of the whole tree.
引用
收藏
页码：1043 / 1052
页数：10
相关论文
共 50 条
12345