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

QC LDPC码低复杂度消环算法 被引量：1

Low-complexity Cycle Elimination Algorithms for QC LDPC Codes
在线阅读 下载PDF
导出
摘要 QC LDPC(Quasi-cyclic Low-density Parity-check)是一类半结构化的低密度奇偶校验码,其分块的矩阵结构具有超大规模集成电路实现上的便利,同时保持了优异的纠错性能.本文针对QC LDPC码的基矩阵,提出一种移位因子的搜索方法及其改进版本。通过对基矩阵的扩展矩阵的Tanner图进行树形展开来进行环的检验,避免了传统算法中的复杂算术操作,降低了复杂度。在采用和IEEE 802.16e中码率为0.5的LDPC码方案相同的基矩阵条件下,本文的算法构造出的QC LDPC码具有更优的环长分布,同时纠错性能也有提升。 Quasi-cyclic LDPC code is a kind of half-structured low density parity check code. Its block-based property leads to highly structured integrated circuits implementation, without significant performance loss. An algorithm searching shift values for the nonzero entries in base matrix of a Quasi-cyclic LDPC code is proposed along with its improved version. By expanding the Tanner graph of the corresponding expansion matrix, cycles with given length can be detected. Unlike some former algorithms, arithmetic operations are avoided, which leads to a considerable complexity reduction. Given the same base matrix with code rate 0.5 as is used in the IEEE 802.16e standard, LI）PC codes constructed by the proposed algorithms have better cycle distributions and achieve slightly improved error-correction performance than the IEEE 802.16e LDPC code as well.
作者 李晓峰 冯大政 胡树楷
机构地区 西安电子科技大学雷达信号处理国家重点实验室 西安电子科技大学综合业务网理论及关键技术国家重点实验室
出处 《信号处理》 CSCD 北大核心 2013年第2期262-267,共6页 Journal of Signal Processing
基金 国家自然科学基金(60971111) 国家"九七三"重点基础研究发展计划项目(2010CB328300)
关键词 低密度校验码 准循环 围长 快速编码 low-density parity-check code quasi-cyclic girth efficient encoding
分类号 TN911 [电子电信—通信与信息系统]
  • 相关文献

参考文献18

  • 1GALLAGER R G. Low density parity check codes [ J]. IEEE Trans Inform Theory, 1962, 8( 1 ) : 21-28.
  • 2Chung S, Jr. Forney G D, Richardson T J, et al. On the design of low-density parity-cheek codes within 0.0045dB of the Shannon limit[J]. IEEE Commun Lett, 2001, 5 (2) : 58-60.
  • 3Kschischang F R, Frey B J, Loeliger H A. Factor graphs and the sum-product algorithm [ J ]. IEEE Trans Inform Theory. 2001,47(2) : 498-519.
  • 4Chen, J. and Dholakia, A. and Eleftheriou, et al. Re- duced-Complexity decoding of LDPC codes [ J ]. IEEE Trans on Communications. 2005, 53 ( 8 ) : 1288-1299.
  • 5MacKay, D. J. C. Good error-correcting codes based on very sparse matrices [ J ]. IEEE Trans Inform Theory. 1999, 45(2) : 399-431.
  • 6Tanner, R. A recursive approach to low complexity codes [J]. IEEE Trans Inform Theory. 1981, 27(5) : 533-547.
  • 7T. J. Richardson and R. Urbanke. Efficient encoding of low-density parity-check codes [ J ]. IEEE Trans on Com- munications. 2001, 47(2): 638-656.
  • 8张仲明,许拔,张尔扬.基于循环群的准循环LDPC码构造[J].信号处理,2009,25(9):1379-1382. 被引量：1
  • 9Sunghwan Kim, Jong-Seon No, Habong Chung, et al. Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than 12 [ J]. IEEE Trans Inform Theory. 2007, 53(8) : 2256-2260.
  • 10Myung S, Young K, Kim J. Quasi-cyclic LDPC codes forfast encoding[J]. IEEE Trans Inform Theory. 2005, 51 (8) : 2894 -2901.

二级参考文献13

  • 1R. G. Gallager. "Low Density Parity Check Codes" [ M ]. Cambridge : MIT Press, 1963.
  • 2D. J. C. MacKay, R. M. Neal. "Near Shannon Limit Performance of Lo Density Parity Check Codes" [ J ]. Electronics Letters, 1997,32 ( 18 ) : 1645-1 646.
  • 3Jos M. F. Morua, J, Lun and Haotian Zhang," Structured Low-Density Parity-Check Codes" IEEE Signal Processing Magazie ,January 2004.
  • 4Y. Kou, S. Lin, and M. Fossorier, "Low density parity check codes based on finite geometries: A rediscovery and new results, "IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
  • 5D. Divsalar, H. Jin, and R. McEliece, " Coding theorems for turbo-like codes, "in Proc. 36th Allerton Conf. Communications, Control and Computing, Urbana, IL, Sep. 1998.
  • 6J. Fan," Array codes as low-density parity check codes," in Proc. 2nd Int. Syrup. Turbo Codes and Related Topics, Brest, France, Sep. 2000, pp. 543-546.
  • 7B. Vasic, O. Milenkovic, " Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding," IEEE Trans on IT, Vol. 50, No. 6, pp: 1156-1176, June 2004.
  • 8I. Djurdjevic, J. Xu, K. Abdel-Ghaffar, and S. Lin, "A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols," IEEE Commun. Lett. ,vol. 7 ,no. 7 ,pp. 317-319 ,Jul. 2003.
  • 9Zongwang Li, et. al. , Efficient Encoding of Quasi-Cyclic Low-Density Parity-Check Codes, IEEE Trans. on Com. , Vol. 54, No. 1, January 2006.
  • 10L. Lan, L. -Q. Zeng, Y. Y. Tai, S. Lin and K. Abdel-Ghaf- far," Constructions of quasi-cyclic LDPC codes for the AWGN and binary erasure channels based on finite fields and affine mappings, "Proc. IEEE Int. Symp. Inform. Theory, Adelaide, Australia, Sep. 4-9,2005.

同被引文献16

  • 1李丹,白宝明,孙蓉.多元LDPC码与二元LDPC码的性能比较[J].无线通信技术,2007,16(3):1-6. 被引量：10
  • 2MacKay D. J. C. and Neal R. M. . Near Shannon limitperformance of low density parity check codes [ J] . Elec-tron. Lett.,1996, 32(18) : 1645-1646.
  • 3Sipser M. and Spielman D. A.. Expander codes [J].IEEE Trans. Inform. Theory, 1996’42( 11 ) :1710-1722.
  • 4Richardson T. J.,Shokrollahi M. A.,and Urbanke R.L. . Design of capacity-approaching irregular low-densityparity-check codes [ J]. IEEE Trans. Inform. Theory,2001, 47(2) :619-637.
  • 5Kou Y. , Lin S.,and Fossorier M. P. C. Low-densityparity-check codes based on finite geometries : A redis-covery and new results [J]. IEEE Trans. Inform. Theo-ry, 2001,47(7) :2711-2736.
  • 6Chung S. -Y.,Fomey G. D.,Richardson T. J. , and Ur-banke R. On the design of low-density parity-check codeswithin 0.0045 dB of the shannon limit [ J ]. IEEE Com-mun. Lett.,2001, 5(2) :58-60.
  • 7Hu Xiao-yu and Eleftheriou E. Binary representation ofcycle Tanner-graph GF(^ ) codes [ C ]. IEEE Interna-tional Conference on Communications, Paris, France,Jun. 20-24 , 2004, 1; 528-532.
  • 8Huang Jie, Zhou Sheng-li and Willett P. Structure,prop-erty ,and design of nonbinary regular cycle codes [ J ].IEEE Transactions on Communications, 2010,58(4):1060-1071.
  • 9Ha J. , Kim J. , McLaughlin S. W. Rate-compatible punc-turing of low-density parity-check codes [ J] . IEEE Trans-actions on Information Theory,2004,50( 11) ;2824-2836.
  • 10Ha J. , Kim J. , McLaughlin S. W. Rate-compatible punc-tured low-density parity-check codes with short blocklengths [ J]. IEEE Transactions on Information Theory,2006, 52(2) : 728-738.

引证文献1

二级引证文献3

信号处理
2013年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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