Deterministic Design of Low-Density Parity-Check Codes for Binary Erasure Channels

Simple item page
dc.creatorSaeedi, Hamid
dc.creatorBanihashemi, Amir H.
dc.date2008-01-23
dc.date.accessioned2026-07-07T08:56:03Z
dc.date.available2026-07-07T08:56:03Z
dc.descriptionWe propose a deterministic method to design irregular Low-Density Parity-Check (LDPC) codes for binary erasure channels (BEC). Compared to the existing methods, which are based on the application of asymptomatic analysis tools such as density evolution or Extrinsic Information Transfer (EXIT) charts in an optimization process, the proposed method is much simpler and faster. Through a number of examples, we demonstrate that the codes designed by the proposed method perform very closely to the best codes designed by optimization. An important property of the proposed designs is the flexibility to select the number of constituent variable node degrees P. The proposed designs include existing deterministic designs as a special case with P = N-1, where N is the maximum variable node degree. Compared to the existing deterministic designs, for a given rate and a given d > 0, the designed ensembles can have a threshold in d-neighborhood of the capacity upper bound with smaller values of P and N. They can also achieve the capacity of the BEC as N, and correspondingly P and the maximum check node degree tend to infinity.
dc.descriptionSubmitted to IEEE Transactions on Communications, Sept. 2007
dc.identifierhttps://arxiv.org/abs/0801.3511
dc.identifierhttp://arxiv.org/abs/0801.3511
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/146473
dc.subjectInformation Theory
dc.titleDeterministic Design of Low-Density Parity-Check Codes for Binary Erasure Channels
dc.typetext

Files

Collections

arXiv