Small loops in the graphical representations of low density parity-check codes are hypothesised to be detrimental to the code's performance.This paper analyzes the essential properties of LDPC codes, and then presents a kind of method for removing such loops from the graphs.
It is hypothesised that small loops in the graphical representations of low-density parity-check codes are detrimental to the code's performance. We demonstrate a procedure for removing such loops from the codes. An algorithm based on the code's adjacency matrix is used to locate unwanted loops, and then certain edges within the graph are exchanged to eliminate those loops (without simultaneously creating any others). This process can be repeated until there are no loops remaining with a size less than a particular limit. A comparison of some theoretical and experimental values for this limit is given.
Low-density parity-check (LDPC) codes can rightfully take their stand next to turbo codes as the most powerful and most popular error control codes known. They offer a performance spectacularly close to theoretical limits when decoded using iterative soft decision algorithms. This chapter explores the properties and structure of low-density parity-check codes. It begins with the fundamental construction of regular LDPC codes and their representation as bipartite graphs. The graphical representation of LDPC codes then leads to the notion of irregular LDPC codes, which have been used to improve performance, and to the density evolution analysis technique, which predicts the performance of these codes.
In low-density parity-check(LDPC) codes,the small loops between low degree nodes are more detrimental to the decoding performance than those between high degree nodes.In order to reduce small loops,we propose a method of exchanging the edges between nodes.It first removes the small loops between low degree nodes as much as possible,and then removes the small loops from whole LDPC codes under the condition of ensuring the smallest loop between low degree nodes not to be changed.Finally,the simulation result of constructing LDPC codes by the method is compared with that by only removing the small loops from whole LDPC codes.