The finite-length design of non-binary low-density parity-check (LDPC) codes for the q-ary erasure channel under maximum a posteriori (MAP) decoding is considered. A low-complexity MAP decoding algorithm is reviewed for which a code design strategy is proposed. In particular, it is illustrated how a judicious code design permits to find a trade-off between performance in terms of codeword error rate (CER) and decoding complexity. As an example, the performance curve of a short (400, 200) code on the memoryless 4-ary erasure channel tightly approaches the Singleton bound down to a CER of 10−8.
Non-Binary Low-Density Parity-Check Codes for the q-ary Erasure Channel / G. Garrammone; E. Paolini; B. Matuz; G. Liva; M. Chiani. - ELETTRONICO. - (2013), pp. 1-6. (Intervento presentato al convegno IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS tenutosi a Budapest, Hungary nel 9-13 June 2013).
Non-Binary Low-Density Parity-Check Codes for the q-ary Erasure Channel
PAOLINI, ENRICO;CHIANI, MARCO
2013
Abstract
The finite-length design of non-binary low-density parity-check (LDPC) codes for the q-ary erasure channel under maximum a posteriori (MAP) decoding is considered. A low-complexity MAP decoding algorithm is reviewed for which a code design strategy is proposed. In particular, it is illustrated how a judicious code design permits to find a trade-off between performance in terms of codeword error rate (CER) and decoding complexity. As an example, the performance curve of a short (400, 200) code on the memoryless 4-ary erasure channel tightly approaches the Singleton bound down to a CER of 10−8.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
