# Low-density parity-check code

In , a **low-density parity-check** (**LDPC**) **code** is a , a method of transmitting a message over a transmission channel. An LDPC is constructed using a sparse . LDPC codes are , which means that practical constructions exist that allow the noise threshold to be set very close (or even *arbitrarily* close on the ) to the theoretical maximum (the ) for a symmetric memoryless channel. The noise threshold defines an upper bound for the channel noise, up to which the probability of lost information can be made as small as desired. Using iterative techniques, LDPC codes can be decoded in time linear to their block length.

LDPC codes are finding increasing use in applications requiring reliable and highly efficient information transfer over bandwidth or return channel-constrained links in the presence of corrupting noise. Implementation of LDPC codes has lagged behind that of other codes, notably turbo codes. The fundamental patent for Turbo Codes expired on August 29, 2013.[US5446747<nowiki></nowiki>]

LDPC codes are also known as **Gallager codes**, in honor of , who developed the LDPC concept in his doctoral dissertation at the in 1960.

## Contents

## History

Impractical to implement when first developed by Gallager in 1963, LDPC codes were forgotten until his work was rediscovered in 1996. Turbo codes, another class of capacity-approaching codes discovered in 1993, became the coding scheme of choice in the late 1990s, used for applications such as the and . However, the advances in low-density parity-check codes have seen them surpass turbo codes in terms of error floor and performance in the higher range, leaving turbo codes better suited for the lower code rates only.

## Applications

In 2003, an irregular repeat accumulate (IRA) style LDPC code beat six turbo codes to become the error correcting code in the new standard for the satellite transmission of . The DVB-S2 selection committee made decoder complexity estimates for the Turbo Code proposals using a much less efficient serial decoder architecture rather than a parallel decoder architecture.

This forced the Turbo Code proposals to use frame sizes on the order of one half the frame size of the LDPC proposals. In 2008, LDPC beat convolutional turbo codes as the forward error correction (FEC) system for the standard. G.hn chose LDPC codes over turbo codes because of their lower decoding complexity (especially when operating at data rates close to 1.0 Gbit/s) and because the proposed turbo codes exhibited a significant error floor at the desired range of operation.

LDPC codes are also used for Ethernet, which sends data at 10 gigabits per second over twisted-pair cables. As of 2009, LDPC codes are also part of the 802.11 standard as an optional part of and , in the High Throughput (HT) PHY specification.

Some systems add an additional outer error correction that fixes the occasional errors (the “error floor”) that get past the LDPC correction inner code even at low . For example: The with LDPC Coded Modulation (RS-LCM) uses a Reed-Solomon outer code. The DVB-S2, the DVB-T2 and the DVB-C2 standards all use a BCH code outer code to mop up residual errors after LDPC decoding.

## Operational use

LDPC codes functionally are defined by a sparse . This is often randomly generated, subject to the constraints—LDPC code construction is discussed later. These codes were first designed by Robert Gallager in 1962.

Below is a graph fragment of an example LDPC code using . In this graph, *n* variable nodes in the top of the graph are connected to (*n*−*k*) constraint nodes in the bottom of the graph.

This is a popular way of graphically representing an (*n*, *k*) LDPC code. The bits of a valid message, when placed on the **T’s** at the top of the graph, satisfy the graphical constraints. Specifically, all lines connecting to a variable node (box with an ‘=’ sign) have the same value, and all values connecting to a factor node (box with a ‘+’ sign) must sum, two, to zero (in other words, they must sum to an even number; or there must be an even number of odd values).

Ignoring any lines going out of the picture, there are eight possible six-bit strings corresponding to valid codewords: (i.e., 000000, 011001, 110010, 101011, 111100, 100101, 001110, 010111). This LDPC code fragment represents a three-bit message encoded as six bits. Redundancy is used, here, to increase the chance of recovering from channel errors. This is a (6, 3) , with *n* = 6 and *k* = 3.

Once again ignoring lines going out of the picture, the parity-check matrix representing this graph fragment is

- <math>

mathbf{H} = begin{pmatrix} 1 & 1 & 1 & 1 & 0 & 0 \ 0 & 0 & 1 & 1 & 0 & 1 \ 1 & 0 & 0 & 1 & 1 & 0 \ end{pmatrix}. </math>

In this matrix, each row represents one of the three parity-check constraints, while each column represents one of the six bits in the received codeword.

In this example, the eight codewords can be obtained by putting the **H** into this form <math>begin{bmatrix} -P^T | I_{n-k} end{bmatrix}</math> through basic in :

- <math>mathbf{H}

= begin{pmatrix} 1 & 1 & 1 & 1 & 0 & 0 \ 0 & 0 & 1 & 1 & 0 & 1 \ 1 & 0 & 0 & 1 & 1 & 0 \ end{pmatrix}_1 sim begin{pmatrix} 1 & 1 & 1 & 1 & 0 & 0 \ 0 & 0 & 1 & 1 & 0 & 1 \ 0 & 1 & 1 & 0 & 1 & 0 \ end{pmatrix}_2 sim begin{pmatrix} 1 & 1 & 1 & 1 & 0 & 0 \ 0 & 1 & 1 & 0 & 1 & 0 \ 0 & 0 & 1 & 1 & 0 & 1 \ end{pmatrix}_3 sim begin{pmatrix} 1 & 1 & 1 & 1 & 0 & 0 \ 0 & 1 & 1 & 0 & 1 & 0 \ 1 & 1 & 0 & 0 & 0 & 1 \ end{pmatrix}_4. </math>

Step 1: H.

Step 2: Row 1 is added to row 3.

Step 3: Row 2 and 3 are swapped.

Step 4: Row 1 is added to row 3.

From this, the **G** can be obtained as <math>begin{bmatrix} I_k | P end{bmatrix}</math> (noting that in the special case of this being a binary code <math>P = -P</math>), or specifically:

- <math>mathbf{G}

= begin{pmatrix} 1 & 0 & 0 & 1 & 0 & 1 \ 0 & 1 & 0 & 1 & 1 & 1 \ 0 & 0 & 1 & 1 & 1 & 0 \ end{pmatrix}. </math>

Finally, by multiplying all eight possible 3-bit strings by **G**, all eight valid codewords are obtained. For example, the codeword for the bit-string ‘101’ is obtained by:

- <math>

begin{pmatrix} 1 & 0 & 1 \ end{pmatrix} cdot begin{pmatrix} 1 & 0 & 0 & 1 & 0 & 1 \ 0 & 1 & 0 & 1 & 1 & 1 \ 0 & 0 & 1 & 1 & 1 & 0 \ end{pmatrix} = begin{pmatrix} 1 & 0 & 1 & 0 & 1 & 1 \ end{pmatrix}. </math>

As a check, the row space of **G** is orthogonal to **H** such that <math> G H^T = 0 </math>

The bit-string ‘101’ is found in as the first 3 bits of the codeword ‘101011’.

## Example Encoder

Figure 1 illustrates the functional components of most LDPC encoders.

During the encoding of a frame, the input data bits (D) are repeated and distributed to a set of constituent encoders. The constituent encoders are typically accumulators and each accumulator is used to generate a parity symbol. A single copy of the original data (S<sub>0,K-1</sub>) is transmitted with the parity bits (P) to make up the code symbols. The S bits from each constituent encoder are discarded.

The parity bit may be used within another constituent code.

In an example using the DVB-S2 rate 2/3 code the encoded block size is 64800 symbols (N=64800) with 43200 data bits (K=43200) and 21600 parity bits (M=21600). Each constituent code (check node) encodes 16 data bits except for the first parity bit which encodes 8 data bits. The first 4680 data bits are repeated 13 times (used in 13 parity codes), while the remaining data bits are used in 3 parity codes (irregular LDPC code).

For comparison, classic turbo codes typically use two constituent codes configured in parallel, each of which encodes the entire input block (K) of data bits. These constituent encoders are recursive convolutional codes (RSC) of moderate depth (8 or 16 states) that are separated by a code interleaver which interleaves one copy of the frame.

The LDPC code, in contrast, uses many low depth constituent codes (accumulators) in parallel, each of which encode only a small portion of the input frame. The many constituent codes can be viewed as many low depth (2 state) ‘convolutional codes’ that are connected via the repeat and distribute operations. The repeat and distribute operations perform the function of the interleaver in the turbo code.

The ability to more precisely manage the connections of the various constituent codes and the level of redundancy for each input bit give more flexibility in the design of LDPC codes, which can lead to better performance than turbo codes in some instances. Turbo codes still seem to perform better than LDPCs at low code rates, or at least the design of well performing low rate codes is easier for Turbo Codes.

As a practical matter, the hardware that forms the accumulators is reused during the encoding process. That is, once a first set of parity bits are generated and the parity bits stored, the same accumulator hardware is used to generate a next set of parity bits.

## Decoding

As with other codes, the of an LDPC code on the is an problem. Performing optimal decoding for a NP-complete code of any useful size is not practical.

However, sub-optimal techniques based on iterative decoding give excellent results and can be practically implemented. The sub-optimal decoding techniques view each parity check that makes up the LDPC as an independent single parity check (SPC) code. Each SPC code is decoded separately using soft-in-soft-out (SISO) techniques such as SOVA, BCJR, , and other derivates thereof. The soft decision information from each SISO decoding is cross-checked and updated with other redundant SPC decodings of the same information bit. Each SPC code is then decoded again using the updated soft decision information. This process is iterated until a valid code word is achieved or decoding is exhausted. This type of decoding is often referred to as sum-product decoding.

The decoding of the SPC codes is often referred to as the “check node” processing, and the cross-checking of the variables is often referred to as the “variable-node” processing.

In a practical LDPC decoder implementation, sets of SPC codes are decoded in parallel to increase throughput.

In contrast, belief propagation on the is particularly simple where it consists of iterative constraint satisfaction.

For example, consider that the valid codeword, 101011, from the example above, is transmitted across a binary erasure channel and received with the first and fourth bit erased to yield ?01?11. Since the transmitted message must have satisfied the code constraints, the message can be represented by writing the received message on the top of the factor graph.

In this example, the first bit cannot yet be recovered, because all of the constraints connected to it have more than one unknown bit. In order to proceed with decoding the message, constraints connecting to only one of the erased bits must be identified. In this example, only the second constraint suffices. Examining the second constraint, the fourth bit must have been zero, since only a zero in that position would satisfy the constraint.

This procedure is then iterated. The new value for the fourth bit can now be used in conjunction with the first constraint to recover the first bit as seen below. This means that the first bit must be a one to satisfy the leftmost constraint.

Thus, the message can be decoded iteratively. For other channel models, the messages passed between the variable nodes and check nodes are , which express probabilities and likelihoods of belief.

This result can be validated by multiplying the corrected codeword **r** by the parity-check matrix **H**:

- <math>mathbf{z} = mathbf{Hr}

= begin{pmatrix} 1 & 1 & 1 & 1 & 0 & 0 \ 0 & 0 & 1 & 1 & 0 & 1 \ 1 & 0 & 0 & 1 & 1 & 0 \ end{pmatrix}

begin{pmatrix} 1 \ 0 \ 1 \ 0 \ 1 \ 1 \ end{pmatrix}

= begin{pmatrix} 0 \ 0 \ 0 \ end{pmatrix}. </math>

Because the outcome **z** (the ) of this operation is the three × one zero vector, the resulting codeword **r** is successfully validated.

After the decoding is completed, the original message bits ‘101’ can be extracted by looking at the first 3 bits of the codeword.

While illustrative, this erasure example does not show the use of soft-decision decoding or soft-decision message passing, which is used in virtually all commercial LDPC decoders.

### Updating node information

In recent years, there has also been a great deal of work spent studying the effects of alternative schedules for variable-node and constraint-node update. The original technique that was used for decoding LDPC codes was known as *flooding*. This type of update required that, before updating a variable node, all constraint nodes needed to be updated and vice versa. In later work by Vila Casado *et al.*, alternative update techniques were studied, in which variable nodes are updated with the newest available check-node information.

The intuition behind these algorithms is that variable nodes whose values vary the most are the ones that need to be updated first. Highly reliable nodes, whose (LLR) magnitude is large and does not change significantly from one update to the next, do not require updates with the same frequency as other nodes, whose sign and magnitude fluctuate more widely. These scheduling algorithms show greater speed of convergence and lower error floors than those that use flooding. These lower error floors are achieved by the ability of the Informed Dynamic Scheduling (IDS)

When nonflooding scheduling algorithms are used, an alternative definition of iteration is used. For an (*n*, *k*) LDPC code of rate *k*/*n*, a full *iteration* occurs when *n* variable and *n* − *k* constraint nodes have been updated, no matter the order in which they were updated.

### Lookup table decoding

It is possible to decode LDPC codes on a relatively low-power microprocessor by the use of .

While codes such as the LDPC are generally implemented on high-power processors, with long block lengths, there are also applications which use lower-power processors and short block lengths (1024).

Therefore, it is possible to precalculate the output bit based upon predetermined input bits. A table is generated which contains *n* entries (for a block length of 1024 bits, this would be 1024 bits long), and contains all possible entries for different input states (both errored and nonerrored).

As a bit is input, it is then added to a FIFO register, and the value of the FIFO register is then used to look up in the table the relevant output from the precalculated values.

By this method, very high iterations can be used, with little processor overhead, the only cost being that of the memory for the lookup table, such that LDPC decoding is possible even on a 4.0 MHz PIC chip.

## Code construction

For large block sizes, LDPC codes are commonly constructed by first studying the behaviour of decoders. As the block size tends to infinity, LDPC decoders can be shown to have a noise threshold below which decoding is reliably achieved, and above which decoding is not achieved, colloquially referred to as the . This threshold can be optimised by finding the best proportion of arcs from check nodes and arcs from variable nodes. An approximate graphical approach to visualising this threshold is an EXIT chart.

The construction of a specific LDPC code after this optimization falls into two main types of techniques:

- Pseudorandom approaches
- Combinatorial approaches

Construction by a pseudo-random approach builds on theoretical results that, for large block size, a random construction gives good decoding performance. Various constraints are often applied to help ensure that the desired properties expected at the theoretical limit of infinite block size occur at a finite block size.

Combinatorial approaches can be used to optimize the properties of small block-size LDPC codes or to create codes with simple encoders.

Some LDPC codes are based on , such as the RS-LDPC code used in the standard. Compared to randomly generated LDPC codes, structured LDPC codes—such as the LDPC code used in the standard—can have simpler and therefore lower-cost hardware—in particular, codes constructed such that the H matrix is a .

Yet another way of constructing LDPC codes is to use . This method was proposed by Y. Kou *et al.* in 2001.

## See Also on BitcoinWiki

### People

### Theory

### Applications

- (ITU-T Standard for networking over power lines, phone lines and coaxial cable)
- (10 Giga-bit/s Ethernet over Twisted pair)
- (China Multimedia Mobile Broadcasting)
- / / (Digital video broadcasting, 2nd Generation)
- (Digital video broadcasting)
- (IEEE 802.16e standard for microwave communications)
- ( standard)
- 3.1

### Other capacity-approaching codes

- Turbo codes
- Serial concatenated convolutional codes
- Repeat-accumulate codes (a class of simple turbo codes)
- (LDPC codes designed for )
- Polar codes