Selective Avoidance of Cycles in Irregular LDPC Code Construction

Ting Tian, Chris Jones, John Villasenor, Richard D. Wesel

IEEE Transactions on Communications · 2004 · 400 citations · 15 references

Concepts

Abstract

This letter explains the effect of graph connectivity on error-floor performance of low-density parity-check (LDPC) codes under message-passing decoding. A new metric, called extrinsic message degree (EMD), measures cycle connectivity in bipartite graphs of LDPC codes. Using an easily computed estimate of EMD, we propose a Viterbi-like algorithm that selectively avoids small cycle clusters that are isolated from the rest of the graph. This algorithm is different from conventional girth conditioning by emphasizing the connectivity as well as the length of cycles. The algorithm yields codes with error floors that are orders of magnitude below those of random codes with very small degradation in capacity-approaching capability.

References

15