The design of GLDPC codes for the binary erasure channel with low error floor under iterative decoding is investigated. Both bounded distance and maximum a posteriori decoding at the check nodes are considered. For both check node decoding algorithms a key parameter is identified, discriminating between an exponentially small and exponentially large expected number of small size stopping sets. A code design technique is proposed based on this theoretical investigation.
On Design of Irregular GLDPC Codes with Low Error Floor Over the BEC / E. Paolini; M. Chiani; M. Fossorier. - STAMPA. - (2008), pp. 1532-1537. (Intervento presentato al convegno 2008 International Symposium on Information Theory and Its Applications, ISITA 2008 tenutosi a Auckland, New Zealand nel Dec. 2008).
On Design of Irregular GLDPC Codes with Low Error Floor Over the BEC
PAOLINI, ENRICO;CHIANI, MARCO;
2008
Abstract
The design of GLDPC codes for the binary erasure channel with low error floor under iterative decoding is investigated. Both bounded distance and maximum a posteriori decoding at the check nodes are considered. For both check node decoding algorithms a key parameter is identified, discriminating between an exponentially small and exponentially large expected number of small size stopping sets. A code design technique is proposed based on this theoretical investigation.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
