Effects of Single-Cycle Structure on Iterative Decoding of Low-Density Parity-Check Codes

DOI10.1109/TIT.2012.2216252MaRDI QIDQ2989457zbMATH OpenFDO

Authors Ryuhei Mori, Toshiyuki Tanaka, Kenta Kasai, Kohichi Sakaniwa

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1010.0333

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Abstract: We consider communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) codes and belief propagation (BP) decoding. For fixed numbers of BP iterations, the bit error probability approaches a limit as blocklength tends to infinity, and the limit is obtained via density evolution. On the other hand, the difference between the bit error probability of codes with blocklength $n$ and that in the large blocklength limit is asymptotically $alpha(epsilon,t)/n+Theta(n^{-2})$ where $alpha(epsilon,t)$ denotes a specific constant determined by the code ensemble considered, the number $t$ of iterations, and the erasure probability $epsilon$ of the BEC. In this paper, we derive a set of recursive formulas which allows evaluation of the constant $alpha(epsilon,t)$ for standard irregular ensembles. The dominant difference $alpha(epsilon,t)/n$ can be considered as effects of cycle-free and single-cycle structures of local graphs. Furthermore, it is confirmed via numerical simulations that estimation of the bit error probability using $alpha(epsilon,t)$ is accurate even for small blocklengths.

This page was built for publication: Effects of Single-Cycle Structure on Iterative Decoding of Low-Density Parity-Check Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989457)