Efficient encoding of cycle codes on graphs with large girths

Low-density parity-check (LDPC) codes of column weight two, also called cycle codes, can be constructed based on connected simple graphs. In this paper, efficiently encodable cycle codes and modified Repeat-Accumulate codes based on Hamiltonian graphs with large girths are devised. Specifically, the Hamiltonian property of the graphs is exploited to obtain efficient encoder structures and a concise description for the Hamiltonian graph named LCF (Lederberg-Coxeter-Frucht) notation is used to reduce the complexity of the encoders, especially the storage requirement. Then, using the Hamiltonian property and the LCF notation, structured cycle codes with large girths and low encoding complexity are devised. Simulation results also reveal that the proposed structured codes exhibit better performance compared with other structured cycle codes.

[1]  José M. F. Moura,et al.  The design of structured regular LDPC codes with large girth , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[2]  Michael Liebelt,et al.  High Girth Column-Weight-Two LDPC Codes Based on Distance Graphs , 2007, EURASIP J. Wirel. Commun. Netw..

[3]  Rüdiger L. Urbanke,et al.  Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[4]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[5]  Ralf Koetter,et al.  Wheel codes: turbo-like codes on graphs of small order , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[6]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[7]  Dariush Divsalar,et al.  Coding theorems for 'turbo-like' codes , 1998 .

[8]  Geoffrey Exoo.  A trivalent graph of girth 17 , 2001, Australas. J Comb..

[9]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[10]  Jose M. F. Moura,et al.  Efficient encoding of cycle codes: a graphical approach , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.

[11]  S. Louis Hakimi,et al.  Graph theoretic error-correcting codes , 1968, IEEE Trans. Inf. Theory.

[12]  B. V. K. Vijaya Kumar,et al.  Low complexity LDPC codes for partial response channels , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[13]  H. S. M. Coxeter,et al.  Zero-symmetric graphs: Trivalent graphical regular representations of groups , 1981 .

[14]  Hongwei Song,et al.  Large girth cycle codes for partial response channels , 2004, IEEE Transactions on Magnetics.