Creating a Parity Check Matrix

This software deals only with linear block codes for binary (ie, modulo-2, GF(2)) vectors. The set of valid codewords for a linear code can be specified by giving a parity check matrix, H, with M rows and N columns. The valid codewords are the vectors, x, of length N, for which Hx=0, where all arithmetic is done modulo-2. Each row of H represents a parity check on a subset of the bits in x; all these parity checks must be satisfied for x to be a codeword. Note that the parity check matrix for a given code (ie, for a given set of valid codewords) is not unique, even after eliminating rows of H that are redundant because they are linear combinations of other rows.

This software stores parity check matrices in files in a sparse format. These parity-check files are not human-readable (except by using the print-pchk program). However, they are readable on a machine with a different architecture than they were written on.

Methods for constructing LDPC codes

This software is primarily intended for experimentation with Low Density Parity Check (LDPC) codes. These codes can be constructed by various methods, which generally involve some random selection of where to put 1s in a parity check matrix. Any such method for constructing LDPC codes will have the property that it produces parity check matrices in which the number of 1s in a column is approximately the same (perhaps on average) for any size parity check matrix. For a given code rate, these matrices therefore become increasingly sparse as the length of a codeword, and hence the number of parity checks, increases.

Many methods for constructing LDPC matrices are described in the references. Two simple methods are currently implemented by this software, both of which operate according to the following scheme:

1. Create a preliminary parity check matrix by one of the methods.
2. Add 1s to the parity check matrix in order to avoid rows that have no 1s in them, and hence are redundant, or which have only one 1 in them, in which case the corresponding codeword bits will always be zero. The places within such a row to add these 1s are selected randomly.
3. If the preliminary parity check matrix constructed in step (1) had an even number of 1s in each column, add further 1s to avoid the problem that this will cause the rows to add to zero, and hence at least one check will be redundant. Up to two 1s are added (since it is also undesirable for the sum of the rows to have only one 1 in it), at positions selected randomly from the entire matrix. However, the number of 1s to add in this step is reduced by the number already added in step (2). (Note that although redundant checks are not disastrous, they are better avoided; see the discussion of linear dependence in parity check matrices.)
4. If requested, try to eliminate situations where a pair of columns both have 1s in a particular pair of rows, which correspond to cycles of length four in the factor graph of the parity check matrix. When such a situation is detected, one of the 1s involved is moved randomly within its column. This continues until no such situations remain, or until 10 passes over all columns have failed to eliminate all such situations.

The evencol method is the simplest way of performing step (1) of the above procedure. For each column of the parity check matrix, independently, it places a specified number of 1s in positions selected uniformly at random, with the only constraint being that these 1s be in distinct rows.

The evenboth method also puts a specified number of 1s in each column, but it tries as well to keep the numbers of 1s in the rows approximately the same. Initially, it creates indicators for all the 1s that will be required, and assigns these 1s to rows as evenly as it can, favouring earlier rows if an exactly even split is not possible. It then assigns 1s to successive columns by selecting randomly, without replacement, from this initial supply of 1s, subject only to the constraint that the 1s assigned to a column must be in distinct rows. If at some point it is impossible to put the required number of 1s in a column by picking from the 1s remaining, a 1 is set in that column without reference to other columns, creating a possible unevenness.

Note that regardless of how evenly 1s are distributed in the preliminary parity check matrix created in step (1), steps (2) and (3) can make the numbers of 1s in the both rows and columns be uneven, and step (4), if done, can make the numbers of 1s in rows be uneven.

Example: The parity check matrix for the Hamming code created by the example for make-pchk would print as follows:

print-pchk ham7.pchk

Parity check matrix in ham7.pchk (sparse format):

0: 0 3 4 5
1: 1 3 4 6
2: 2 4 5 6

print-pchk -d ham7.pchk

Parity check matrix in ham7.pchk (dense format):

 1 0 0 1 1 1 0
 0 1 0 1 1 0 1
 0 0 1 0 1 1 1

See the discussion above for more details on how these methods construct LDPC matrices.

Example: The make-ldpc command below creates a 20 by 40 low density parity check matrix with three 1s per column and six 1s per row. The matrix is then printed in sparse format using print-pchk.

make-ldpc ldpc.pchk 20 40 1 evenboth 3
print-pchk ldpc.pchk

Parity check matrix in ldpc.pchk (sparse format):

 0: 10 14 18 27 38 39
 1:  2  3  5 11 27 30
 2: 15 19 20 21 24 26
 3:  2  4 25 28 32 38
 4:  7  9 12 22 33 34
 5:  5  6 21 22 26 32
 6:  1  4 13 24 25 28
 7:  1 14 28 29 30 36
 8: 11 13 22 23 32 37
 9:  6  8 13 20 31 33
10:  0  3 24 29 31 38
11:  7 12 15 16 17 23
12:  3 16 29 34 35 39
13:  0  8 10 18 36 37
14:  6 11 18 20 35 39
15:  0  7 14 16 25 37
16:  2  4  9 19 30 31
17:  5  9 10 17 19 23
18:  8 15 17 21 26 27
19:  1 12 33 34 35 36