Construction of short block length irregular low-density parity-check codes
Authors:
- R. WeselRWR. Wesel
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 410-414
Abstract
We present a construction algorithm for short block length irregular low-density parity-check (LDPC) codes. Based on a novel interpretation of stopping sets in terms of the parity-check matrix, we present an approximate trellis-based search algorithm that detects many stopping sets. Growing the parity check matrix by a combination of random generation and the trellis-based search, we obtain codes that possess error floors orders of magnitude below randomly constructed codes and significantly better than other comparable constructions.Keywords
This publication has 6 references indexed in Scilit:
- Selective Avoidance of Cycles in Irregular LDPC Code ConstructionIEEE Transactions on Communications, 2004
- Asymptotic Enumeration Methods for Analyzing LDPC CodesIEEE Transactions on Information Theory, 2004
- Construction of irregular LDPC codes with low error floors2004
- Finite-length analysis of low-density parity-check codes on the binary erasure channelIEEE Transactions on Information Theory, 2002
- Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximationIEEE Transactions on Information Theory, 2001
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001