Shortened Array Codes of Large Girth

DOI10.1109/TIT.2006.878179MaRDI QIDQ3547924zbMATH OpenOpenAlexFDO

Authors

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0504016

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: One approach to designing structured low-density parity-check (LDPC) codes with large girth is to shorten codes with small girth in such a manner that the deleted columns of the parity-check matrix contain all the variables involved in short cycles. This approach is especially effective if the parity-check matrix of a code is a matrix composed of blocks of circulant permutation matrices, as is the case for the class of codes known as array codes. We show how to shorten array codes by deleting certain columns of their parity-check matrices so as to increase their girth. The shortening approach is based on the observation that for array codes, and in fact for a slightly more general class of LDPC codes, the cycles in the corresponding Tanner graph are governed by certain homogeneous linear equations with integer coefficients. Consequently, we can selectively eliminate cycles from an array code by only retaining those columns from the parity-check matrix of the original code that are indexed by integer sequences that do not contain solutions to the equations governing those cycles. We provide Ramsey-theoretic estimates for the maximum number of columns that can be retained from the original parity-check matrix with the property that the sequence of their indices avoid solutions to various types of cycle-governing equations. This translates to estimates of the rate penalty incurred in shortening a code to eliminate cycles. Simulation results show that for the codes considered, shortening them to increase the girth can lead to significant gains in signal-to-noise ratio in the case of communication over an additive white Gaussian noise channel.

Recommendations

• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
• scientific article; zbMATH DE number 2127872
• Girth expanding algorithm for LDPC code based on cyclic iterative
• TS-LDPC Codes: Turbo-Structured Codes With Large Girth
• Algebraic construction of sparse matrices with large girth

Cited in

(4)

• An effective algorithm for the spark of sparse binary measurement matrices
• A class of quasi-cyclic LDPC codes from \(B_2\pmod m\) sequences
• TS-LDPC Codes: Turbo-Structured Codes With Large Girth
• Improving a power line communications standard with LDPC codes

This page was built for publication: Shortened Array Codes of Large Girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547924)