一種非規(guī)則卷積低密度校驗(yàn)碼的構(gòu)造和短環(huán)去除方法
Irregular Low-Density Convolutional Codes Construction and Short Cycles Elimination Method
-
摘要: 該文研究了使用為分組低密度校驗(yàn)(Low-Density Parity-Check，LDPC)碼優(yōu)化的度序列分布來構(gòu)造卷積低密度(Low-Density Convolutional，LDC)碼的方法，詳細(xì)討論了LDC碼的編碼、譯碼和短環(huán)的消除算法，實(shí)驗(yàn)結(jié)果說明用為分組LDPC碼優(yōu)化的非規(guī)則度序列分布所構(gòu)造的LDC碼，其性能要優(yōu)于目前文獻(xiàn)上提出的規(guī)則(homogeneous)LDC碼。
-
關(guān)鍵詞:
- 非規(guī)則低密度校驗(yàn)碼; 卷積低密度校驗(yàn)碼; 環(huán)路
Abstract: A method for constructing Low-Density Convolutional (LDC) codes with degree distributions optimized for block Low-Density Parity-Check (LDPC) codes is presented. The encoding, decoding, and short cycles elimination methods are discussed in detail. Experimental results show that the LDC codes constructed with the optimized irregular degree distributions for block LDPC codes are superior to homogeneous (i.e., regular) LDC codes. -
Richardson T, Shokrollahi M, Urbanke R. Design of capacity-approaching irregular low-density parity-check codes[J].IEEE Trans. on Info. Theory.2001, 47(2):619-637[2]Felstrom A J, Zigangirov K S. Time-varying periodic convolutional codes with low-density parity-check matrix[J].IEEE Trans. on Info. Theory.1999, 45(6):2181-2191[3]Lentmaier M, Truhachev D, Zigangirov K S. On the theory of low-density convolutional codes II[J].Problems of Information Transmission.2001, 37(4):288-306[4]Hu X, Eleftheriou E, Arnold D M. Progressive edge-growth tanner graphs. GLOBECOM 2001- IEEE Global Telecommunications Conference, Texas, USA, IEEE, 2001, no. 1: 995-2001. -
計(jì)量
- 文章訪問數(shù): 2337
- HTML全文瀏覽量: 67
- PDF下載量: 813
- 被引次數(shù): 0
下載:
