Constructing LDPC codes with given distribution pairs by quasi Tanner graphs

作     者：Lu Hongsheng Luo Xilin Zhang Jun School of Electronics and Information Engineering,Beijing University of Aeronautics and Astronautics,Beijing,10083,China 

会议名称：《第十三届全国青年通信学术会议》

会议日期：2008年

学科分类：07[理学] 08[工学] 070104[理学-应用数学] 081101[工学-控制理论与控制工程] 0701[理学-数学] 0811[工学-控制科学与工程] 

基　　金：supported by Astronautic Support Technology Foundation, National High Technology Research and Development Program of China (No. 2006AA11Z232) the Major Programs of China National Space Administration (D2120060013) 

关 键 词：Girth low-parity density-check(LDPC)codes quasi Tanner graphs 

摘      要：正In this paper,we advance a method for constructing low-parity density-check（LDPC）codes having a large girth greater than 6 by directly connecting variable nodes of the Tanner graphs,called quasi-Tanner graph（QTG）constructing ***- striction on distribution pairs for the method is provided in terms of code length,row and column *** upper bound on the girth of a Q-T graph is derived using initialization parameters of the graphs based on a connection strategy provided to approach the ***,simulation results show that LDPC codes constructed by QTG algorithm perform better than random codes with the same distribution pairs.