A class of quasi-cyclic LDPC codes over GF(2m)
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 co...
Saved in:
Published in | IEEE transactions on communications Vol. 57; no. 9; pp. 2524 - 2527 |
---|---|
Main Authors | , |
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 | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0090-6778 1558-0857 |
DOI: | 10.1109/TCOMM.2009.09.070644 |