Technical Program

Paper Detail

Paper Title AVN-based elimination of short cycles in Tanner graphs of QC LDPC codes
Paper IdentifierMO1.R4.1
Authors Irina Bocharova, Boris Kudryashov, State University of Information Technologies, Mechanics and Optics, Russia; Vitaly Skachek, Tartu University, Estonia
Session Quasi-cyclic LDPC codes
Location Odéon, Level 3
Session Time Monday, 08 July, 09:50 - 11:10
Presentation Time Monday, 08 July, 09:50 - 10:10
Manuscript  Click here to download the manuscript
Abstract One of the most efficient approaches to improving the frame error rate (FER) performance of low-density parity-check (LDPC) codes is based on adding both auxiliary variable nodes (AVN) and the corresponding redundant parity checks (RPC) to the binary parity-check matrices of the code. It was shown that for the LDPC codes, whose Tanner graphs contain length-four cycles, this technique allows for substantial improvement in the FER performance of the belief-propagation (BP) decoding on the binary erasure channel (BEC) channel. The AVN-based technique followed by adding orthogonal redundant parity-checks is known to be efficient for both the BEC and additive white Gaussian noise (AWGN) channels. In this paper, firstly, the AVN-based approach is generalized to efficiently removing cycles of length larger than four. Secondly, the AVN-based technique is reformulated in terms of labeled base matrices of quasi-cyclic (QC) LDPC codes. An improved iterative decoding of QC LDPC codes is proposed, which is applied to the labeled base matrices of QC LDPC codes extended by the AVN-RPC technique.