期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

几种LDPC码的最小汉明距离的计算 被引量：3

Computing the Minimum Distance of Several Kinds of LDPC Codes
在线阅读 下载PDF
导出
摘要 本文提出一种计算LDPC码的真实最小汉明距离的方法.该方法能够用来计算多种LDPC码方案的真实最小汉明距离,比如准循环LDPC码、pi-旋转LDPC码等.该方法是通过计算码的环长间接地找到LDPC码最小距离,由于计算环长的计算量要远比直接计算最小汉明距离来得低,因而该算法能够在有限时间内找到LDPC码的真实最小距离.通过仿真表明,用目前主流的个人计算机利用该方法找出一个有最小距离24的码率为1/4的准循环LDPC码最小距离大概需要花77分钟. In this paper, we present a measurement method of the real minimum Hamming distance of several kinds of LDPC codes,including quasi-cyclic LDPC codes,pi-rotation 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.
作者 林灯生 李少谦
机构地区 电子科技大学通信抗干扰技术国防重点实验室
出处 《电子学报》 EI CAS CSCD 北大核心 2007年第B06期69-73,共5页 Acta Electronica Sinica
基金 国家自然科学基金(No.60496313) 企业项目:Intel Research Project on the Key Techniques for TDD MIMO OFDM Systems
关键词 低密度奇偶校验(LDPC)码 环长 最小汉明距离 Low- density parity- check（ LDPC ） codes cycle minimum distance
分类号 TN911.22 [电子电信—通信与信息系统]
  • 相关文献

参考文献9

  • 1D J C MacKay, R M Neal. Near Shannon limit performance of low density parity check codes[J] .IEE Electron Lett, 1996,32 (18) : 1645 - 1646,.
  • 2C Y Di, D Proietti, I E Telatar, T J Richardson, R L Urbanke. Finite-length analysis of low-density parity-check codes on the binary erasure channel [ J ]. IEEE Trans Inform Theory, June 2002 48(6) : 1570 - 1579.
  • 3L Wei. Several properties of short LDPC codes [J]. IEEE Trans. Commun, May 2004,52(5) : 721 - 727.
  • 4C Berrou, S Vaton, M Jezequel, C Douillard. Computing the minimum distance of linear codes by the error impulse method [A] .Proc IEEE Global Telecommunications Conference[ C]. Taipei, Taiwan: IEEE Press. 2002,2 : 1017 - 1020.
  • 5X Y Hu, M P C Fossorier, E. Eleftheriou. On the computation of the minimum distance of low-density parity-check codes [ A ]. Proc 2004 IEEE Int Conf Communications [C]. Paris,France: IEEE Press, 2004,2: 767 - 771.
  • 6R Garello, P Pierleoni, S Benedetto. Computing the free distance of turbo codes and serially concatenated codes with Interleavers: algorithms and applications [J]. IEEE. J Select Areas Commun., May 2001,19(5) :800 - 812.
  • 7Y Kou, S Lin, M Fossorier. Low-density parity-check codes based on finite geometries a rediscovery and new results [J]. IEEE Trans Inform. Theory, Nov. 2001,47(7 ) : 2711 - 2736.
  • 8B Ammar, B Honary, Y Kou, J Xu, S Lin. Construction of low-density parity-check codes based on balanced incomplete block designs[J] .IEEE Trans Inform Theory,June 2004,50(6) : 1257 - 1268.
  • 9R Echard, S C Chang. Design considera-fions leading to the development of good π-rotation LDPC codes[ J]. IEEE Commun Lett, May, 2005,9(5) :447 - 449.

同被引文献25

  • 1HOLUB A,MOREELS P, PERONA P. Unsupervised clus- tering for Google searches of celebrity images[C]//Proc of IEEE Conference on Face and Gesture Recognition. [S.l.]: IEEE, 2008:1-8.
  • 2CAO Zhimin, YIN Qi, TANG Xiao-cu, et al. Face recogni- tion with learning-based descriptor[C]//Proc of IEEE Con- ference on Computer Vision and Pattern Recognition. [S. l.]: IEEE, 2010: 2707-2714.
  • 3Zhao W, Chellappa R, Phillips P J, et al. Face recognition a literature survey [J]. ACM Computing Surveys. 2003, 35 (4) : 399-458.
  • 4Nabatchian A,Raheem E A, Ahmadi M. Illumination in- variant feature extraction and mutual-information-based local matching for recogniton under illumination vari- ation [J]. PatternRecogniton (S0031-3203), 2011,44 (10): 2576-2587.
  • 5LIAO SHENG-CAI, ZHU XIANG-XIN, LE I ZH EN, etal. Learning multi-scale block local binary patterns for face rec- ognition [C]//ICB2007.
  • 6AHONEN T, HADID A, PIETIKAINEN M. Face Descrip- tion with local binary patterns: application to lace recogni- tion [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2006, 28 (12):2047-2041.
  • 7Gallager R G. Low-Density Parity-Check Codes [J]. Information Theory, IRE Transactions on, 1963,8(1) .. 21-28.
  • 8MacKay D J C, Neal R M. Near Shannon limit per- formance of low density parity check codes[J]. Elec- tronics Letters, 1996,32(18) : 1645-1646.
  • 9Di C, Proietti D, Telatar 1 E, et al. Finite-length anal- ysis of low-density parity-check codes on the binary e-rasure channel[J]. Information Theory, IEEE Trans- actions on,2002,48(6) .. 1570 1579.
  • 10Ashrafi R A, Sariduman A, Pusane A E. Asymptotic and finite-length performance of irregular spatially cou- pled codes [ C]//Communications and Networking (BlackSeaCom), 2014 IEEE International Black Sea Conference on. IEEE, 2014 116-120.

引证文献3

二级引证文献3

电子学报
2007年 第B06期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部