Finite-Length Analysis of Irregular Expurgated LDPC Codes under Finite Number of Iterations
| dc.creator | Mori, Ryuhei | |
| dc.creator | Tanaka, Toshiyuki | |
| dc.creator | Kasai, Kenta | |
| dc.creator | Sakaniwa, Kohichi | |
| dc.date | 2009-01-15 | |
| dc.date | 2009-05-23 | |
| dc.date.accessioned | 2026-07-07T13:17:13Z | |
| dc.date.available | 2026-07-07T13:17:13Z | |
| dc.description | Communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) codes and belief propagation (BP) decoding is considered. The average bit error probability of an irregular LDPC code ensemble after a fixed number of iterations converges to a limit, which is calculated via density evolution, as the blocklength $n$ tends to infinity. The difference between the bit error probability with blocklength $n$ and the large-blocklength limit behaves asymptotically like $α/n$, where the coefficient $α$ depends on the ensemble, the number of iterations and the erasure probability of the BEC\null. In [1], $α$ is calculated for regular ensembles. In this paper, $α$ for irregular expurgated ensembles is derived. It is demonstrated that convergence of numerical estimates of $α$ to the analytic result is significantly fast for irregular unexpurgated ensembles. | |
| dc.description | 5 pages, 3 figures, submitted to ISIT2009; revised | |
| dc.identifier | https://arxiv.org/abs/0901.2204 | |
| dc.identifier | http://arxiv.org/abs/0901.2204 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/231040 | |
| dc.subject | Information Theory | |
| dc.title | Finite-Length Analysis of Irregular Expurgated LDPC Codes under Finite Number of Iterations | |
| dc.type | text |