

浏览全部资源
扫码关注微信
电子科技大学通信抗干扰技术国防重点实验室,四川,成都,610054
Published:2007
移动端阅览
LIN Deng-sheng, LI Shao-qian. Computing the Minimum Distance of Several Kinds of LDPC Codes[J]. Acta Electronica Sinica, 2007, 35(6A): 69-73.
本文提出一种计算LDPC码的真实最小汉明距离的方法.该方法能够用来计算多种LDPC码方案的真实最小汉明距离
比如准循环LDPC码、pi-旋转LDPC码等.该方法是通过计算码的环长间接地找到LDPC码最小距离
由于计算环长的计算量要远比直接计算最小汉明距离来得低
因而该算法能够在有限时间内找到LDPC码的真实最小距离.通过仿真表明
用目前主流的个人计算机利用该方法找出一个有最小距离24的码率为1/4的准循环LDPC码最小距离大概需要花77分钟.
In this paper
we present a measurement method of the real minimum Elartuning distance of several kinds of LDPC codes
including quasi-cyclic LDPC codes
pirotation LDPC codes
etc.The minimum distance is indirectly obtained by computing the cycles of the LDPC code.Since the complexity of computing the cycles is much lower than that of direct computing the minimum distance
the method is efficient to compute the minimum distance of the LDPC code.From one of simulation results
it shows that it takes about 77 minutes to compute a minimum distance of 24 for a rate 1/4 quasi-cyclic LDPC code using a common personal computer.
0
Views
1244
下载量
1
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution
京公网安备11010802024621