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 para- meter is identified, discriminating between an exponen- tially small and exponentially large expected number of small size stopping sets. A code design technique is proposed based on this theoretical investigation.
On the Design of Irregular GLDPC Codes with Low Error Floor over the BEC / E. Paolini; M. Fossorier; M. Chiani. - STAMPA. - 1:(2008), pp. 1-6. (Intervento presentato al convegno Proc. IEEE Int. Symp. on Inform. Theory and Its Applications (ISITA) tenutosi a Auckland, New Zealand nel Dec. 2008).
On the 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 para- meter is identified, discriminating between an exponen- tially 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.
