The low density parity check (LDPC) codes from irregular bipartite graphs were analyzed. A method was proposed to split columns and rows of parity check matrix of regular LDPC code to construct capacity achieving irregular LDPC code with a given distribution. The process of splitting rows and columns of a regular LDPC code preserves the number of edges in the irregular graph.
ASJC Scopus subject areas
- Electrical and Electronic Engineering