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

基于循环差集的准循环LDPC码设计 被引量：2

The Design of Quasi-cyclic LDPC Codes Based on Cyclic Difference Sets
在线阅读 下载PDF
导出
摘要 该文将完备循环差集和准循环码的特性相结合,提出一种基于循环差集的准循环LDPC码构造方法,首先由完备循环差集得到行列较小的满足权重要求的初始矩阵,然后再将初始矩阵中的零元素、非零元素分别用全零矩阵、循环移位矩阵代替,得到最终的校验矩阵。在移位系数的确定上,采用计算机搜索方法去除了长度为6的短环。仿真表明,该方法构造的准循环码在AWGN信道下采用BP译码算法在误码率方面优于随机LDPC码且更方便于硬件实现。 Combining the perfect cyclic difference sets with the quasi-cyclic codes,a new algorithm for constructing QC-LDPC codes based on cyclic difference sets is proposed.First,the author obtains a small initial matrix that meet the requirements of the weights based on cyclic difference sets,and then the zeros elements,non-zero elements of the initial matrix are replaced by all-zero matrices and cyclic shift matrices.For the purpose of determining the shift coefficient,the cycle length of six is eliminated by comp...
作者 张丽丽 赵泽茂
机构地区 杭州电子科技大学通信工程学院
出处 《杭州电子科技大学学报（自然科学版）》 2011年第1期32-36,共5页 Journal of Hangzhou Dianzi University：Natural Sciences
基金 国家自然科学基金委员会与中国工程物理研究院联合基金资助项目(10076007)
关键词 低密度奇偶校验码 准循环低密度奇偶校验码 循环差集 LDPC codes quasi-cyclic LDPC codes cyclic difference sets
分类号 TN911.22 [电子电信—通信与信息系统]
  • 相关文献

参考文献7

  • 1刘星成,程浩辉.基于PEG算法的准循环LDPC码构造方法研究[J].电路与系统学报,2009,14(4):115-119. 被引量：10
  • 2何善宝,赵春明,姜明.LDPC码的一种循环差集构造方法[J].通信学报,2004,25(11):112-118. 被引量：11
  • 3Y Kou,S Lin,MPC Fossorier.Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Transactions on Information Theory . 2001
  • 4Richardson TJ,Shokrollahi MA,Urbanke RL.Design of capacity-approaching irregular low-density parity-check codes. IEEE Transactions on Information Theory . 2001
  • 5Hu Xiao-Yu,Eleftheriou Evangelos,Arnold Dieter Michael,et al.Efficient implementations of the sum-product algorithm for decoding LDPC codes. Global Telecommunications Conference, 2001. GLOBECOM ’01 . 2001
  • 6SONG S M,,ZHOU B,LIN S.A unified approach to the constructionof binary and nonbinary quasi-cyclic LDPC codes based on finitefields. IEEE Transactions on Communications . 2009
  • 7MACKAY D J C.Encyclopedia of sparse graph codes. http://www.inference.phy.cam.ac.uk/mackay/codes/data.html . 2008

二级参考文献22

  • 1R G Gallager. Low-Density Parity-Check Codes [J]. IRE Trans. Inform. Theory, 1962, 8(1): 21-28.
  • 2D J C MacKay, R M Neak Near Shannon Limit Performance of Low Density Parity Check Codes [J]. Electronics Letters, 1996, 32(18): 1645.
  • 3T J Richardson, M A Shokrollahi, R L Urbanke. Design of Capacityapproaching Irregular Low-Density Parity-Check Codes [J]. IEEE Trans. Inform. Theory, 2001, 47(2): 619-637.
  • 4D J C Mackay. Good Error-correcting Codes Based on Very Sparse Matrices [J]. IEEE Trans. Inform. Theory, 1999, 45(2): 399-432.
  • 5Z W Li, L Chen, L Q Zeng, S Lin, W H Fong. Efficient Encoding of Quasi-Cyclic Low-Density Parity-Check Codes [J]. IEEE Trans. Comm., 2006, 54(1): 71-81.
  • 6S Lin, L Chen, J Xu, I Djurdjevic. Near Shannon Limit Quasi-Cyclic Low-Density Parity-Check Codes [A]. IEEE Global Telecomm. Conf. [C]. 2003-12, 4: 2030-2035.
  • 7Y Kou, S Lin, M Fossorier. Low-Density Parity-Check Codes Based on Finite Geometries: A Rediscovery and New Result [J]. IEEE Trans. Inform. Theory, 2001, 47(7): 2711-2736.
  • 8B Ammar, B Honary, Y Kou, Construction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs [J]. IEEE Trans. Inform. Theory, 2004, 50(6): 1257-1269.
  • 9X Y Hu, E Eleftheriou, D M Arnold. Progressive Edge-Growth Tanner Graphs [A]. IEEE GLOBECOM [C]. San Antonio, TX, USA, 2001, 2: 995-1001.
  • 10X Y Hu, E Eleftheriou, D M Arnold. Regular and Irregular Progressive Edge-Growth Tanner Graphs [J]. IEEE Trans. Inform. Theory, 2002, 51(1): 386-398.

共引文献19

同被引文献10

引证文献2

二级引证文献2

杭州电子科技大学学报（自然科学版）
2011年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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