期刊文献+

具有完全线性编码复杂度的QC-LDPC码的构造方法及短环优化算法 被引量:1

Construction of QC-LDPC codes with total linear encoding complexity and eliminating short cycles
下载PDF
导出
摘要 为了降低低密度奇偶校验(Low-density parity-check,LDPC)码编码实现的复杂度,提出了一种完全线性编码复杂度的准循环低密度奇偶校验(Quasi-cyclic low-density parity-check,QC-LDPC)码的构造方法,并提出了相应的短环优化算法。通过该短环优化算法,可以使得构造的QC-LDPC码具有良好的环路特性。仿真结果表明:在加性高斯白噪声(Additivewhite gaussian noise,AWGN)信道条件下,本文构造的QC-LDPC码与IEEE 802.16e标准的QC-LDPC码相比,不仅编码复杂度更低,而且性能更优。 In order to reduce the encoding complexity of Low-Density Parity Check(LDPC) codes,a method of constructing Quasi-Cyclic LDPC(QC-LDPC) codes with total linear encoding complexity and a short-cycle optimization algorithm for eliminating short cycles were proposed.Based on the short-cycle optimization algorithm,the constructed QC-LDPC codes can achieve good cycle distribution.Simulation was carried out under the Additive White Gaussian Noise(AWGN) channel.The simulation results show that the proposed QC-LDPC codes outperform the IEEE802.16e standard QC-LDPC codes in both error performance and encoding complexity.
出处 《吉林大学学报(工学版)》 EI CAS CSCD 北大核心 2013年第3期824-829,共6页 Journal of Jilin University:Engineering and Technology Edition
基金 陕西省电子信息系统综合集成重点实验室重点基金项目(2011.ZD01) 陕西省电子信息系统综合集成重点实验室基金项目(2011.02Y02)
关键词 通信技术 准循环低密度奇偶校验码 短环优化算法 线性编码复杂度 communication quasi-cyclic low-density parity-check(QC-LDPC) short-cycle optimization algorithm linear encoding complexity
  • 相关文献

参考文献12

  • 1Gallager R.Low-density parity-check codes[J].IRE Transactions on Information Theory,1962,8(1):21-28.
  • 2Mackay D J C.Near shannon limit performance oflow density parity check codes[J].Electronics Let-ters,1997,33(6):457-458.
  • 3Richardson T J,Urbanke R L.Efficient encoding oflow-density parity-check codes[J].IEEE Transac-tions on Information Theory,2001,47(2):638-656.
  • 4敬龙江,林竞力,朱维乐.一种高码率低复杂度准循环LDPC码设计研究[J].电子与信息学报,2008,30(6):1385-1389. 被引量:5
  • 5IEEE Standard 802.16e-2005.IEEE standard for lo-cal and metropolitan area networks,part 16:air in-terface for fixed and mobile broadband wireless ac-cess systems[R].
  • 6Tam W M,Lau F C M,Tse C K.A class of QC-LDPC codes with low encoding complexity and gooderror performance[J].IEEE Communications Let-ters,2010,14(2):169-171.
  • 7王鹏,王新梅.LDPC码的快速编码研究[J].西安电子科技大学学报,2004,31(6):934-938. 被引量:22
  • 8赵旦峰,佟宁宁,吴宇平.具有线性编码复杂度的非规则LDPC码[J].吉林大学学报(工学版),2009,39(2):504-507. 被引量:1
  • 9Myung S,Yang K,Kim J.Quasi-cyclic LDPC codesfor fast coding[J].IEEE Transactions on Informa-tion Theory,2005,51(8):2894-2901.
  • 10Hu X Y,Eleftheriou E,Arnold D M.Irregular pro-gressive edge-growth(PEG)tanner graphs[C]∥2002IEEE International Symposium on Information The-ory,Lausanne,Switzerland,2002.

二级参考文献35

  • 1童胜,王鹏,王单,王新梅.LDPC码量化和积译码的高效实现[J].西安电子科技大学学报,2004,31(5):709-713. 被引量:13
  • 2王鹏,王新梅.LDPC码的快速编码研究[J].西安电子科技大学学报,2004,31(6):934-938. 被引量:22
  • 3姜明,赵春明,何善宝,单鸣.低复杂度的LDPC码联合编译码构造方法研究[J].通信学报,2005,26(2):80-86. 被引量:6
  • 4CHUNG S Y,FORNEY G D,et al.On the design of low-density parity-check codes within 0.0045dB of the Shannon limit[J].IEEE Commun Letters,2001,5(2):58-60.
  • 5PING L,LEUNG W k.Decoding low density parity check codes with finite quantization bits[J].IEEE Commun Lett,2000,4(2):62-64.
  • 6HE Y C,SUN S H,WANG X M.Fast decoding of LDPC codes using quantization[J].IEEE Electronics Letters,2002,38(4):189-190.
  • 7HEO J,CHUGG K M.Optimization of scaling soft information in iterative decoding via density evolution methods[J].IEEE Transactions on Communications,2005,53(6):957-961.
  • 8RICHARDSON T J,URBANKE R L.The capacity of low-density parity-check codes under message-passing decoding[J].IEEE Trans Inf Theory,2001,47(2):599-618.
  • 9CHEN J H,DHOLAKIA A,HU X Y Reduced-complexity decoding of LDPC codes[J].IEEE Trans Commun,2005,53(8):1288-1299.
  • 10袁李林,李贵勇.LDPC码及其应用[J].通信技术,2007,40(9):11-12. 被引量:10

共引文献37

同被引文献15

  • 1Ding Y,Zhang K, Wong K M. Ergodic channel capacities for amplify-and-forward half-duplex cooperative systems [ J ]. IEEE Transactions on Information Theory,2009,55 (2) :713-730.
  • 2Razaghi P, Yu W. Bilayer LDPC codes for decode-and-forward in relay channeI[ J ]. IEEE Transactions on Information Theory, 2007,53 ( 10 ) :3723-3739.
  • 3Li C X, Yue G S, Khojastepour M A, et al. LDPC-coded coopera-tive relay system: Performance analysis and code design [ J ]. IEEE Transactions on Communications,2008,56(3 ) :485-488.
  • 4Hunter T E, Nosratinia A. Diversity through coded cooperation [J]. IEEE Transactions on Wireless Communications, 2006, 5(2) :283-289.
  • 5Bao X K,Jing L. Efficient message relay for wireless user cooper- ation:Decode-amplify-forward (DAF) and hybrid DAF and co- ded-cooperation [ J ]. IEEE Transactions on Wireless Communica- tions, 2007,6 ( 11 ) : 3975-3984.
  • 6Azmi M H,Li J, Yuan J H, et al. LDPC codes for soft decode- and-forward in half-duplex relay channels [ J ]. IEEE Journal on Selected Areas in Communicaions ,2013,31 (8) : 1-12.
  • 7Mansour M M. A turbo-decoding message-passing algorithm for sparse parity-check matrix codes[ J ]. IEEE Transactions on Sig- nal Processing,2006,54( 11 ) :4376-4392.
  • 8Li C,Yue X,Wang X,et al. LDPC code design for half-duplex cooperative relay[ J]. IEEE Transactions on Wireless Communi- cations ,2008,7 ( 11 ) :4558-4567.
  • 9Hou J L, SiegelP H, MilsteinL B. Performance analysis and code optimization of low-density parity-cheek codes on Rayteigh fading channels[ J ]. 1EEE Journal on Selected Areas in Com- municaions,2001,19 (5) :924-934.
  • 10Xie K, Li J. On accuracy of Gaussian assumption in iterative a- nalysis for LDPC codes[ C ]//1EEE International Symposium on Information Theory. Piscataway, NJ: 1EEE Press, 2006: 2398 -2402.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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