A class of quasi-cyclic LDPC codes over GF(2m)

• Published in: IEEE transactions on communications Vol. 57; no. 9; pp. 2524 - 2527
• Main Authors: Spagnol, C., Marnane, W.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.09.2009; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Applied sciences; Arithmetic; Binary codes; Circuits; Coding, codes; Complexity; Decoders; Decoding; Density; Encoders; Encoding; Error correction codes; Exact sciences and technology; Field programmable gate arrays; FPGA; Galois fields; Information, signal and communications theory; Iterative decoding; Low density parity check codes; Parity; Parity check codes; permutational codes; quasi-cyclic codes; Routing; Signal and communications theory; Telecommunications and information theory; Turbo codes; Performance evaluation; Cyclic code; FPGA; Field programmable gate array; Binary code; quasi-cyclic codes; Implementation; permutational codes; Codec; Coding; Low density parity check codes; Algorithm complexity; Parity check codes; Error correcting code
• DOI: 10.1109/TCOMM.2009.09.070644
• ISSN: 0090-6778

Low Density Parity Check (LDPC) codes over GF(2 m, )are an extension of binary LDPC codes. Performances of GF(2 m, ) LDPC codes have been shown to be higher than binary LDPC codes, but the complexity of the encoders/decoders increases. Hence there is a substantial lack of implementations for LDPC codes over GF(2 m, )codes. This paper presents a class of quasi-cyclic LDPC codes over GF(2 m, ). These codes can alleviate the encoding/decoding complexity without excessive loss of performances. It is shown how, from a performance point of view, such codes are better than m times bigger binary codes and as good as (2 m, )longer binary codes.