Peer-Reviewed Journal Details
Mandatory Fields
Spagnol C., Marnane W.P.
2009
September
IEEE Transactions On Communications
A class of quasi-cyclic LDPC codes over GF(2^m)
Published
()
Optional Fields
Low density parity check codes quasi-cyclic codes permutational codes FPGA
57
9
2524
2527
Low Density Parity Check (LDPC) codes over GF(2^𝑚) are an extension of binary LDPC codes. Performances of GF(2^𝑚) 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^𝑚) codes. This paper presents a class of quasi-cyclic LDPC codes over GF(2^𝑚). 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 𝑚 times bigger binary codes
and as good as 2𝑚 longer binary codes.
USA
0090-6778
10.1109/TCOMM.2009.09.070644
Grant Details
Irish Research Council for Science Engineering and Technology (RS/2004/144)