The local circle removal algorithm for the LDPC code in communications

International Journal of Advancements in Computing Technology

Volumn 4, Issue 9, 2012, Pages 200-208

  Duanmu, Chunjiang ^a   Huang, Zhiliang ^b  

^a ZHEJIANG NORMAL UNIVERSITY   (China)

^b SOUTHEAST UNIVERSITY   (China)

Author keywords

Channel coding; Edge exchanging algorithm; Girth length; LDPC code

Indexed keywords

CHECK MATRIXES; CODING PERFORMANCE; DECODING PERFORMANCE; GIRTH LENGTH; LDPC CODES; NODE DEGREE; NODE DISTRIBUTION; SHANNON LIMIT; TANNER GRAPHS;

CHANNEL CODING; COMMUNICATION SYSTEMS; FORWARD ERROR CORRECTION;

ALGORITHMS;

EID: 84861908463     PISSN: 20058039     EISSN: 22339337     Source Type: Journal    
DOI: 10.4156/ijact.vol4.issue9.24     Document Type: Article

References (20)

1. Gallager, "Low-density parity-check codes", Cambridge, MA: MIT press, 1963.
2. D. J. C. Mackay and R. M. Neal, "Near Shannon limit performance of low density parity check codes", Electronic Letters, vol. 32, no. 18, pp. 1645-1645, 1996.
3. Thomas J. Richardson, M. Amin Shokrollahi, and Rudiger L. Urbanke, "Design of capacityapproaching irregular low-density parity-check codes", IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 619-637, 2001.
4. J. Pearl, "Probabilistic reasoning in intelligent systems: networks of plausible inference", San Francisco, CA: Morgan Kaufmann, 1988.
5. James A. McGowan and Robert C. Williamson, "Loop removal from LDPC codes", In Proceedings of ITW2003, Paris, France, pp. 230-232, 2003.
6. M G Luby, M Mitzenmacher, M A Shokrollah, and D A Spielman, "Improved low-density Parity-check Codes Using Irregular Graphs", IEEE Transactions on Information Theory, pp. 585-598, vol. 47, no. 2, 2001.
7. B. Bollobas and E. Szemeredi, "Girth of Sparse Graphs", Journal of Graph Theory, vol. 39, no. 3, pp.194-200, March 2002.
8. S. Hoory, "The size of Bipartite Graphs with a Given Girth", Journal of combinatorial Theoryseries B, vol. 86, no. 2, pp. 215-220, 2002.
9. Jie Huang, Lei Liu, Wuyang Zhou, and Shengli Zhou, "Large-girth nonbinary QC-LDPC codes of various lengths", IEEE Transactions on Communications, vol. 58, no. 12, pp. 3436-3447, December 2010.
10. Xiongfei Tao, Lixin Zheng, Weizhong Liu, and Dongsheng Liu, "Recursive design of high girth (2,k) LDPC codes from (k,k) LDPC codes", IEEE Communications Letters, vol. 15, no. 1, pp. 70-72, January 2011.
11. Arunkumar Subramanian, Andrew Thangaraj, Matthieu Bloch, and Steven W. McLaughlin, "Strong secrecy on the binary erasure wiretap channel using large-girth LDPC codes", IEEE Transactions on Information Forensics and Security, vol. 6, no. 3, PART 1, pp. 585-594, September 2011.
12. Samuele Bandi, Velio Tralli, Andrea Conti, and Maddalena Nonato, "On girth conditioning for low-density parity-check codes", IEEE Transactions on Communications, vol. 59, no. 2, pp. 357-362, February 2011.
13. Eric Psota, and Lance C.Pérez, "Iterative construction of regular LDPC codes from independent tree-based minimum distance bound", IEEE Communications Letters, vol. 15, no. 3, pp. 334-336, March 2011.
14. Shashi Kiran Chilappagari, Dung Viet Nguyen, Bane Vasic, and Michael W. Marcellin, "Error correction capability of column-weight-three LDPC codes under the Gallager A algorithm-part II", IEEE Transactions on Information Theory, vol. 56, no. 6, pp. 2626-2639, June 2010.
15. Nissim Halabi, and Guy Even, "LP decoding of regular LDPC codes in memoryless channels", IEEE Transactions on Information Theory, vol. 57, no. 2, pp. 887-897, February 2011.
16. Chao Chen, Baoming Bai, and Xinmei Wang, "Construction of nonbinary quasi-cyclic LDPC cycle codes based on singer perfect difference set", IEEE Communications Letters, vol. 14, no. 2, pp. 181-183, February 2010.
17. Chao Chen, Baoming Bai, Xinmei Wang, and Ming Xu, "Nonbinary LDPC codes constructed based on a cyclic MDS code and a low-complexity nonbinary message-passing decoding algorithm", IEEE Communications Letters, vol.14, no. 3, pp. 239-241, March 2010.
18. Wenhua Cui, "A base station environment remote surveillance and control system based on SMS and B/S", Journal of Zhejiang Normal University (Natural Sciences), vol. 33, no. 2, pp. 173-176, June 2010.
19. Wei Lin, and Baoming Bai, "Efficiently encodable Q-ary LDPC codes based on accumulators", Journal of AISS, vol. 3, no. 9, pp. 9-16, 2011.
20. Zijian Dong, and Xuyin Bi, "Improved Decoding Algorithms Based on Oscillation Loglikelihood Ratio for Low-density Parity Check Codes", Journal of AISS, vol. 3, no. 8, pp. 97-103, 2011.