Generalized Dual Diagonal Matrices for Efficient Encoding of Non-binary LDPC codes

摘要

The weak point of LDPC encoding is the complexity. Richardson accomplished making codeword by using parity check matrices with the low complexity. In this paper, in order to encode non-binary LDPC over GF(q) we propose new non-binary dual diagonal matrix T in Richardson' parity check matrix which can be used for non-binary LDPC encoding over GF(q). We drive that the inverse of proposed matrix T can be easily obtained. Proposed scheme has low complexity and accomplish that the matrix Φ{sup}(-1) of Richardson's encoding is identity.