Read full paper at: http://www.scirp.org/journal/PaperInformation.aspx?PaperID=51523#.VG2v12fHRK0 Author(s) Huanming Zhang Affiliation(s) Electronics and Information Engineering Institute, Foshan University, Foshan, China . ABSTRACT LDPC codes are finding increasing use in applications requiring reliable and highly efficient information transfer over bandwidth. An LDPC code is defined by a sparse parity-check matrix and can be described by a bipartite graph called Tanner graph. Loops in Tanner graph prevent the sum-product algorithm from converging. Further, loops, especially short loops, degrade the performance of LDPC decoder, because they affect the independence of the extrinsic information exchanged in the it...
Scientific Research Publishing