DocumentCode :
2082106
Title :
Non-binary low-density parity-check codes for the q-ary erasure channel
Author :
Garrammone, Giuliano ; Paolini, Enrico ; Matuz, Balazs ; Liva, Gianluigi ; Chiani, Marco
Author_Institution :
Inst. of Commun. & Navig. of the Deutsches Zentrum fur Luft - und Raumfahrt (DLR), Wessling, Germany
fYear :
2013
fDate :
9-13 June 2013
Firstpage :
3258
Lastpage :
3263
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 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.
Keywords :
channel coding; maximum likelihood decoding; parity check codes; CER; LDPC codes; Singleton bound; code design strategy; codeword error rate; decoding complexity; finite-length design; judicious code design; low-complexity MAP decoding algorithm; maximum a posteriori decoding; memoryless 4-ary erasure channel; nonbinary low-density parity-check codes; q-ary erasure channel; Algorithm design and analysis; Complexity theory; Maximum likelihood decoding; Parity check codes; Sparse matrices; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications (ICC), 2013 IEEE International Conference on
Conference_Location :
Budapest
ISSN :
1550-3607
Type :
conf
DOI :
10.1109/ICC.2013.6655047
Filename :
6655047
Link To Document :
بازگشت