Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels

Simple item page
dc.creatorHsu, Chun-Hao
dc.creatorAnastasopoulos, Achilleas
dc.date2006-07-06
dc.date2006-07-18
dc.date.accessioned2026-07-07T08:16:37Z
dc.date.available2026-07-07T08:16:37Z
dc.descriptionThe asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input output-symmetric (MBIOS) channels are analyzed in this paper. For MS decoding, the analysis is done by upper bounding the bit error probability of the root bit of a tree code by the sequence error probability of a subcode of the tree code assuming the transmission of the all-zero codeword. The result is a recursive upper bound on the bit error probability after each iteration. For SP decoding, we derive a recursively determined lower bound on the bit error probability after each iteration. This recursive lower bound recovers the density evolution equation of LDPC codes on the binary erasure channel (BEC) with inequalities satisfied with equalities. A significant implication of this result is that the performance of LDPC codes under SP decoding on the BEC is an upper bound of the performance on all MBIOS channels with the same uncoded bit error probability. All results hold for the more general multi-edge type LDPC codes.
dc.description10 pages, no figures. This paper is submitted to the 44rd Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, USA, Sept. 27-29, 2006
dc.identifierhttps://arxiv.org/abs/cs/0607020
dc.identifierhttp://arxiv.org/abs/cs/0607020
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133842
dc.subjectInformation Theory
dc.titleIterative Decoding Performance Bounds for LDPC Codes on Noisy Channels
dc.typetext

Files

Collections

arXiv