IEEE International Symposium on Information Theory (ISIT)

Improving the Performance of Protograph LDPC Codes by Using Different Transmission Energies

Gerd Richter, Martin Bossert

Published Jun 1, 2007• 1 citation

Abstract

Irregular low-density parity-check (LDPC) codes constructed from small protographs are one of the most powerful LDPC codes. In this paper, we show that the performance of LDPC codes based on small protographs can be further improved by using different transmission energies for every variable node of the protograph. Thus, a protograph is now described by a set of variable nodes, a set of check nodes, edges connecting variable nodes and check nodes, and the transmission energy used for every variable node, which is called the energy distribution. We optimize the energy distribution of protographs by choosing the energy distribution with the highest threshold calculated with a generalization of the discretized density evolution. Furthermore, we show by simulations that the performance of long LDPC codes based on protographs can be improved as expected from the thresholds.

DOI: 10.1109/isit.2007.4557166

Related papers

Quasi-cyclic expansion and encoding algorithms for protograph LDPC codes

Zhongliang Li, Guojiang Xia

Recently, a new class of Low-Density Parity-Check (LDPC) codes constructed from a template was introduced. This kind of codes were called protograph codes. The protograph serves as a blueprint for constructing LDPC codes of arbitrary size whose performance can be predicted by analyzing the protograph. Protograph LDPC codes perform very well and suit for high-speed encoding and decoding. However, there are few researches on expansion and encoding algorithms for them. In this paper, using isomorphism between matrix ring and polynomial ring, we propose efficient quasi-cyclic expansion and encoding algorithms for protograph LDPC codes. Simulation results show that the protograph LDPC codes which were constructed by the algorithm proposed in this paper, outperform the best known unstructured irregular LDPC codes with the same maximum node degrees.

Chinese Journal of Space ScienceJan 1, 20110 citations

Protograph-Based LDPC Codes with Local Irregularity

Vincent Wüst, Erdem Eray Cil, Laurent Schmalen

Forward error correcting (FEC) codes are used in many communication standards with a wide range of requirements. FEC codes should work close to capacity, achieve low error floors, and have low decoding complexity. In this paper, we propose a novel category of low-density parity-check (LDPC) codes, based on protograph codes with local irregularity. This new code family generalizes conventional protograph-based LDPC codes and is capable of reducing the iterative decoding threshold of the conventional counterpart. We introduce an adapted version of the protograph extrinsic information transfer (PEXIT) algorithm to estimate decoding thresholds on the binaryinput additive white Gaussian noise channel, perform optimizations on the local irregularity, and simulate the performance of some constructed codes.

IEEE International Symposium on Information Theory (ISIT)Jun 22, 20250 citations

Approaching capacity with asymptotically regular LDPC codes

Michael Lentmaier, Gerhard Paul Fettweis, Kamil Sh. Zigangirov +1 more

We present a family of protograph based LDPC codes that can be derived from permutation matrix based regular (J,K) LDPC convolutional codes by termination. In the terminated protograph, all variable nodes still have degree J but some check nodes at the start and end of the protograph have degrees smaller than K. Since the fraction of these stronger nodes vanishes as the termination length L increases, we call the codes asymptotically regular. The density evolution thresholds of these protographs are better than those of regular (J, K) block codes. Interestingly, this threshold improvement gets stronger with increasing node degrees (at a fixed rate) and it does not decay as L increases. Terminated convolutional protographs can also be derived from standard irregular protographs and may exhibit a significant threshold improvement.

Information Theory and Applications Workshop (ITA)Feb 1, 200994 citations

Deterministic constructions for large girth protograph LDPC codes

Asit Kumar Pradhan, Arunkumar Subramanian, Andrew Thangaraj

For certain degree-distribution pairs with non-zero fraction of degree-two bit nodes, the bit-error threshold of the standard ensemble of Low Density Parity Check (LDPC) codes is known to be close to capacity. However, the degree-two bit nodes preclude the possibility of a block-error threshold. Interestingly, LDPC codes constructed using protographs allow the possibility of having both degree-two bit nodes and a block-error threshold. In this paper, we analyze density evolution for protograph LDPC codes over the binary erasure channel and show that their bit-error probability decreases double exponentially with the number of iterations when the erasure probability is below the bit-error threshold and long chain of degree-two variable nodes are avoided in the protograph. We present deterministic constructions of such protograph LDPC codes with girth logarithmic in blocklength, resulting in an exponential fall in bit-error probability below the threshold. We provide optimized protographs, whose block-error thresholds are better than that of the standard ensemble with minimum bit-node degree three. These protograph LDPC codes are theoretically of great interest, and have applications, for instance, in coding with strong secrecy over wiretap channels.

IEEE International Symposium on Information Theory (ISIT)Jul 1, 201317 citations

Protograph LDPC Codes With Block Thresholds: Extension to Degree-One and Generalized Nodes

Asit Kumar Pradhan, Andrew Thangaraj

Protograph low-density-parity-check (LDPC) codes are considered to design near-capacity low-rate codes over the binary erasure channel and the binary additive white Gaussian noise channel. For protographs with degree-one variable nodes and doubly-generalized LDPC (DGLDPC) codes, conditions are derived to ensure the equality of bit-error threshold and block-error threshold. Using this condition, low-rate codes with block-error threshold close to capacity are designed and shown to have better error rate performance than other existing codes.

IEEE Transactions on CommunicationsAug 14, 20189 citations

Deterministic Constructions for Large Girth Protograph LDPC Codes

Asit Kumar Pradhan, Arunkumar Subramanian, Andrew Thangaraj

The bit-error threshold of the standard ensemble of Low Density Parity Check (LDPC) codes is known to be close to capacity, if there is a non-zero fraction of degree-two bit nodes. However, the degree-two bit nodes preclude the possibility of a block-error threshold. Interestingly, LDPC codes constructed using protographs allow the possibility of having both degree-two bit nodes and a block-error threshold. In this paper, we analyze density evolution for protograph LDPC codes over the binary erasure channel and show that their bit-error probability decreases double exponentially with the number of iterations when the erasure probability is below the bit-error threshold and long chain of degree-two variable nodes are avoided in the protograph. We present deterministic constructions of such protograph LDPC codes with girth logarithmic in blocklength, resulting in an exponential fall in bit-error probability below the threshold. We provide optimized protographs, whose block-error thresholds are better than that of the standard ensemble with minimum bit-node degree three. These protograph LDPC codes are theoretically of great interest, and have applications, for instance, in coding with strong secrecy over wiretap channels.

arXiv:1301.6301Jan 27, 20132 citations