Analysis of Check-Node Merging Decoding for Punctured LDPC Codes with Dual-Diagonal Parity Structure

In this paper, the authors propose new decoding scheme of punctured LDPC codes with dual-diagonal parity structure by merging check nodes connected to the punctured parity nodes. This check-node merging decoding not only needs smaller number of operations at each iteration but also shows faster decoding convergence speed than the conventional erasure decoding. For the binary erasure channel (BEC) and AWGN channel, the authors analyze and compare the check-node merging and the conventional erasure decoding schemes of the punctured LDPC codes with dual-diagonal parity structure using density evolution. Analytical results show that the check-node merging decoding gives faster convergence speed for both BEC and AWGN channel. Also, simulation results are provided to confirm the analytical results.

[1]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2]  Song-nam Hong,et al.  Optimal Puncturing of Block-Type LDPC Codes and Their Fast Convergence Decoding , 2006, 2006 IEEE International Symposium on Information Theory.

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

[4]  Li Ping,et al.  Simple erasure correcting codes with capacity achieving performance , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[5]  Li Ping,et al.  Concatenated tree codes: A low-complexity, high-performance approach , 2001, IEEE Trans. Inf. Theory.

[6]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[7]  Dong-Joon Shin,et al.  Optimal rate-compatible punctured concatenated zigzag codes , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[8]  J. Thorpe.  Low-Density Parity-Check (LDPC) Codes Constructed from Protographs , 2003 .

[9]  N. Phamdo,et al.  Zigzag codes and concatenated zigzag codes , 1999, 1999 Information Theory and Networking Workshop (Cat. No.99EX371).

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

[11]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[12]  Zixiang Xiong,et al.  Scalable image transmission using rate-compatible irregular repeat accumulate (IRA) codes , 2002, Proceedings. International Conference on Image Processing.

[13]  Dariush Divsalar,et al.  Accumulate repeat accumulate codes , 2004, ISIT.

[14]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.