信源信道聯(lián)合編碼的一種方法
A JOINT SOURCE/CHANNEL CODING DESIGN
-
摘要: 對(duì)于單個(gè)符號(hào)組成的信源,該文提出了一種在Shannon編碼中嵌入信道編碼的編碼方法,在[0,2)區(qū)間內(nèi)選擇最小漢明距離為dmin的一系列碼字。在有信道誤差的情況下,譯碼器運(yùn)用碼字間的最小漢明距離和碼字與符號(hào)的對(duì)應(yīng)關(guān)系以及信源的統(tǒng)計(jì)特性,恢復(fù)出原始的符號(hào)序列,而不用采用已知的信道編碼技術(shù)。dmin提供了譯碼器所需的糾錯(cuò)能力。一般適用于帶寬有限、誤碼率較高的二進(jìn)制對(duì)稱(chēng)信道。
-
關(guān)鍵詞:
- 信源信道聯(lián)合編碼; 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. -
計(jì)量
- 文章訪問(wèn)數(shù): 2301
- HTML全文瀏覽量: 146
- PDF下載量: 454
- 被引次數(shù): 0
下載:
