Irregular Low-Density Convolutional Codes Construction 

and Short Cycles Elimination Method

Ma Lin-hua; Chang Yi-lin

Volume 28 Issue 8

Sep. 2010

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2006 > 28(8): 1408-1411

Ma Lin-hua, Chang Yi-lin. Irregular Low-Density Convolutional Codes Construction and Short Cycles Elimination Method[J]. Journal of Electronics & Information Technology, 2006, 28(8): 1408-1411.

Citation:

Ma Lin-hua, Chang Yi-lin. Irregular Low-Density Convolutional Codes Construction and Short Cycles Elimination Method[J]. Journal of Electronics & Information Technology, 2006, 28(8): 1408-1411.

Ma Lin-hua, Chang Yi-lin. Irregular Low-Density Convolutional Codes Construction and Short Cycles Elimination Method[J]. Journal of Electronics & Information Technology, 2006, 28(8): 1408-1411.

Citation:

Ma Lin-hua, Chang Yi-lin. Irregular Low-Density Convolutional Codes Construction and Short Cycles Elimination Method[J]. Journal of Electronics & Information Technology, 2006, 28(8): 1408-1411.

PDF( 217 KB)

Irregular Low-Density Convolutional Codes Construction and Short Cycles Elimination Method

Received Date: 2005-04-21
Rev Recd Date: 2006-05-08
Publish Date: 2006-08-19

Abstract

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.

FullText(HTML)

References(1)

References

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.

Relative Articles

Supplements(0)

Cited By

Proportional views