Computer Science – Information Theory
Scientific paper
2010-10-02
Computer Science
Information Theory
16 pages, 7 figures, submitted to IEEE Transactions on Information Theory
Scientific paper
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.
Kasai Kenta
Mori Ryuhei
Sakaniwa Kohichi
Tanaka Toshiyuki
No associations
LandOfFree
Effects of Single-Cycle Structure on Iterative Decoding for Low-Density Parity-Check Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Effects of Single-Cycle Structure on Iterative Decoding for Low-Density Parity-Check Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Effects of Single-Cycle Structure on Iterative Decoding for Low-Density Parity-Check Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-519670