Shortened Array Codes of Large Girth
Olgica Milenkovic, Navin Kashyap, David Leyba

TL;DR
This paper introduces a method to increase the girth of array LDPC codes by selectively shortening their parity-check matrices, which reduces short cycles and improves communication performance.
Contribution
It presents a novel column-shortening technique based on solving cycle-governing equations, with theoretical estimates and practical simulation results.
Findings
Shortening array codes increases girth and reduces short cycles.
The method improves signal-to-noise ratio in communication channels.
Theoretical bounds on code shortening preserve high code rates.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
