信源-信道联合分组编码的一种设计算法  

A Design Algorithm of Joint Source-Channel Block Coding

作　　者：张豫伟[1] 鞠德航[1] 

机构地区：[1]西安电子科技大学,西安710071

出　　处：《通信学报》1992年第3期34-39,共6页Journal on Communications

基　　金：国家青年科学基金

摘　　要：本文给出了一种信源一信道联合分组编码的设计算法。在高斯独立分布信源及二进制对称信道的情况下,对该算法进行了计算机模拟,并与LBG算法及理论上的最佳性能限作了比较。结果表明,该算法具有很强的抗噪声能力,并且,对一给定的编码速率,码长越长,系统性能越接近理论上的最佳限。A Design algorithm of joint source-channel block coding is presented in this paper. Computer simulation results obtained from Gaussian distribution source and binary symmetric channels are compared with the LBG algorithm, as well as the optimum performance theoretically attainable. It is shown that this algorithm is powerful for resisting the channel noise. And for a given coding rate, the system performance tends to the optimum performance theoretically attainable as the coding length increases.

关 键 词：信道编码 分组编码 信源 设计 

分 类 号：TN911.22[电子电信—通信与信息系统]