Details

Autor(en) / Beteiligte

• Liu, Lei
• Huang, Jie
• Zhou, Wuyang
• Zhou, Shengli

Titel

Computing the Minimum Distance of Nonbinary LDPC Codes

Ist Teil von

• IEEE transactions on communications, 2012-07, Vol.60 (7), p.1753-1758

Ort / Verlag

New York, NY: IEEE

Erscheinungsjahr

2012

Quelle

IEEE Electronic Library Online

Beschreibungen/Notizen

• Finding the minimum distance of low-density-parity-check (LDPC) codes is an NP-hard problem. Different from all existing works that focus on binary LDPC codes, we in this paper aim to compute the minimum distance of nonbinary LDPC codes, motivated by the fact that operating in a large Galois field provides one important degree of freedom to achieve both good waterfall and error-floor performance. Our method is based on the existing nearest nonzero codeword search (NNCS) method, but several modifications are incorporated for nonbinary LDPC codes, including the modified error impulse pattern, the dithering method, and the nonbinary decoder. Numerical results on the estimated minimum distances show that a code's minimum distance can be increased by careful selection of nonzero elements of the parity check matrix, or by increasing the mean column weight, or by increasing the size of the Galois field. These results support observations that have been made based on simulated performance in the literature. Finally, we provide an upper bound on the minimum distance for nonbinary quasi-cyclic LDPC codes.