New algorithm of detecting cycles in bipartite graphs of LDPC codes

Abstract:

In this paper,a logic algebraic algorithm in computing entire routes among the nodes of a communication network is improved,and a new algorithm of detecting cycles in bipartite graphs of LDPC codes is proposed.The algorithm obeys the logic algebraic calculation rules.Through integrating and deleting rows of relative matrix and correcting some elements of the matrix,the new algorithm can detect all the cycles in the bipartite graphs of LDPC codes.When the code length is n and information bits number is k,the integrating and deleting algorithm needs(n-1)×k times and the correcting algorithm needs k times.The validity and rationality of the algorithm are demonstrated in detail.The calculation course of the algorithm is shown by an example and the correctness is validated.