Title :
Short Erasure Correcting LDPC IRA Codes over GF(q)
Author :
Garrammone, Giuliano ; Matuz, Balázs
Author_Institution :
Inst. of Commun. & Navig., German Aerosp. Center (DLR), Wessling, Germany
Abstract :
This paper investigates non-binary low-density parity-check (LDPC) erasure correcting codes suitable to guarantee reliable transmission in wireless communications systems. In particular, irregular repeat-accumulate (IRA) codes are considered, characterized by linear-time encoding complexity. The performance of non-binary IRA codes is compared with their binary counterparts on the packet erasure channel (PEC), with considerable advantages for the non-binary construction. Particularly, it is illustrated that the performance of short-block-length erasure correcting IRA codes over Galois fields (GFs) of order q >; 2 approaches, under maximum-likelihood (ML) decoding, the performance of ideal maximum distance separable (MDS) codes. This is especially appealing in the context of satellite communications, where efficient codes are required to cope with small link margins.
Keywords :
Galois fields; binary codes; block codes; error correction codes; linear codes; maximum likelihood decoding; parity check codes; radiocommunication; Galois fields; ML decoding; irregular repeat-accumulate codes; linear-time encoding complexity; maximum distance separable codes; maximum-likelihood decoding; nonbinary low-density parity-check erasure correcting codes; packet erasure channel; satellite communications; short erasure correcting LDPC IRA codes; short-block-length erasure correcting IRA codes; wireless communications systems; Complexity theory; Decoding; Digital video broadcasting; Encoding; IP networks; Parity check codes; Systematics;
Conference_Titel :
Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE
Conference_Location :
Miami, FL
Print_ISBN :
978-1-4244-5636-9
Electronic_ISBN :
1930-529X
DOI :
10.1109/GLOCOM.2010.5683889