信源信道联合编码的一种方法
A JOINT SOURCE/CHANNEL CODING DESIGN
-
摘要: 对于单个符号组成的信源,该文提出了一种在Shannon编码中嵌入信道编码的编码方法,在[0,2)区间内选择最小汉明距离为dmin的一系列码字。在有信道误差的情况下,译码器运用码字间的最小汉明距离和码字与符号的对应关系以及信源的统计特性,恢复出原始的符号序列,而不用采用已知的信道编码技术。dmin提供了译码器所需的纠错能力。一般适用于带宽有限、误码率较高的二进制对称信道。
-
关键词:
- 信源信道联合编码; Shannon编码
Abstract: In this paper a method of joint source/channel coding is presented. For a source with separate symbols, codes having desired minimum Hamming distance dmin are selected within range [0,1). Then, under the case having channel error, the decoder utilizes the dmin, the corresponding relationship between code and symbol, and the statistical characteristic of source to recover the original sequence of symbols without the use of channel coding. The introduced scheme is suitable for bandwidth-limited binary symmetric channel (BSC) with fairly high error rates. -
C.E. Shannon, The mathematical theory of communication., BSTJ, 1949, 27, 379-423.[2]周炯磐,丁晓明,信源编码原理,北京,人民邮电出版社,1994,50 60.[3]G. Buch, F. Burkert, J. Hagenauer, B. Kukla, To compress or not to compress ? , Proc. of IEEEGlobecom Communication Theory Mini Conference, London, U. K., 1996, 198-203.[4]K. Ssyood, J. C. Borkenhagen, Use of residual redundancy in the design of joint source andchannel coders., IEEE Trans. on Commun., 1991, 39(6), 838-846.[5]K. Sayoof, F. Liu, J. D. Gibson, A constrained joint source/ channel coder design., IEEE J. onSAC, 1994, 12(9), 1584-1593.[6]G.F. Elmasry, Embedding channel coding in arithmetic coding., IEE Proc.-I, 1999, 146(2), 73-78. -
计量
- 文章访问数: 2284
- HTML全文浏览量: 142
- PDF下载量: 453
- 被引次数: 0
下载:
