Quick and Direct Encoding of Low-Density Parity-Check Codes
Wang Yi-ming · Suzhou Daxue xuebao. Faxue ban · 2006
LDPC code is a good error correct code which interests telecommunication field recently.However,the performance of LDPC code depends on the girth of its bipartite graph,that is it depends on its sparse parity-check matrices H,especially the complexity of encoding with H.This paper is mainly on how to construct a good matrix H.Based on the extended bit filling algorithm,the paper proposes a new method to construct matrix H which can be encoded directly and quickly.In different length of code,the simulation results show that this quick encoding has good random distribution and it doesn't need to compute the inverse of H and admits linear time encoding.So it can contribute to the LDPC code's application.