The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
IEEE Transactions on Information Theory
Analysis of the iterative decoding of LDPC and product codes using the Gaussian approximation
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
A novel Gaussian approximation algorithm is proposed for calculating the thresholds of low-density parity-check (LDPC) code ensembles under sum-product decoding. The updating rules of means and error probability are derived. Numerical results show that the thresholds obtained by the proposed algorithm closely coincide with the values computed by density evolution (DE). Moreover, our algorithm can calculate the thresholds of irregular LDPC codes with higher accuracy than the algorithm proposed by Lehmann and Maggio.