Non-binary low-density parity-check codes for the q-ary erasure channel

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 addressed. A low-complexity MAP decoding algorithm is reviewed for which a code design strategy is proposed. In particular, it is illustrated how a...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2013 IEEE International Conference on Communications (ICC) s. 3258 - 3263
Hlavní autori: Garrammone, Giuliano, Paolini, Enrico, Matuz, Balazs, Liva, Gianluigi, Chiani, Marco
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.06.2013
Predmet:
Algorithm design and analysis
Complexity theory
Maximum likelihood decoding
Parity check codes
Sparse matrices
Vectors
ISSN:1550-3607
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 addressed. 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 at least down to a CER of 10 -8 .
ISSN:1550-3607
DOI:10.1109/ICC.2013.6655047