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

基于振荡信息修正的置信传播算法 被引量：1

BP Decoding Algorithm Based on Modified Oscillation Information
下载PDF
导出
摘要 置信传播(beliefpropagation,BP)算法的计算复杂度较高,且变量、校验节点间信息传递时的振荡现象导致了译码性能降低。为了提高其译码性能、降低该算法的计算复杂度,通过分析校验和与错误位数的关系,提出了一种提前结束迭代的判决准则;另外,通过对振荡信息的修正来改善其传递的信息的可靠性,进而来提高BP算法的译码性能。仿真结果显示,改进的译码算法在降低了低信噪比时的平均迭代次数的同时还提高了译码性能。 The computational complexity of BP algorithm is high,and the oscillation is observed when the information passed between variable nodes and check nodes,which leads to decoding performance degraded.In order to improve its decoding performance and reduce the computational complexity,by analyzing the relationship between checksum and the number of error bits,an method of early stopping criterion is proposed to reduce the number of iteration.In addition,through correction of the oscillation information to improve the reliability of the information transmission,and then to improve decoding performance of BP algorithm.Simulation results show that with the new decoding algorithm,the average number of iteration is reduced when SNR is low and the decoding performance is improved.
作者 黄河 赵泽茂 陈集炜
机构地区 杭州电子科技大学通信工程学院
出处 《科技通报》 北大核心 2013年第3期111-115,共5页 Bulletin of Science and Technology
基金 国家自然科学基金委员会与中国工程物理研究院联合基金资助项目(10776007)
关键词 低密度奇偶校验码 校验和 置信传播算法 振荡 LDPC code checksum BP algorithm oscillation
分类号 TN911.22 [电子电信—通信与信息系统]
  • 相关文献

参考文献8

  • 1Gallager R. Low-density parity-check codes [J]. IRE Transactions on Information Theory, 1962, 8(1):21-28.
  • 2MacKay D J C, Neal R M. Near Shannon limit performance of low density parity check codes [J]. Electronics Letters, 1996, 32(18):1645-1646.
  • 3Alghonaim E, El-Maleh A, Landolsi M A. New Technique for Improving Performance of LDPC Codes in the Presence of Trapping Sets [J]. EURASIP Journal on Wireless Communications and Networking, 2008:1-12.
  • 4韩国军,刘星成.LDPC码的信道自适应迭代译码算法[J].电路与系统学报,2010,15(1):102-107. 被引量：5
  • 5Donghyuk S, Kyoungwoo H, Sangbong O, et al. A Stopping Criterion for Low-Density Parity-Check Codes [C]//. Vehicular Technology Conference, 2007. VTC 2007- Spring. IEEE 65th. 2007. 1529-1533.
  • 6Kienle F, Wehn N. Low complexity stopping criterion for LDPC code decoders [C]//. IEEE VTC 2005-Spring, 2005, 1: 606-609.
  • 7Gounai S, Ohtsuki, T, Kaneko T. Modified Belief Propagation Decoding Algorithm for Low-Density Parity Check Code Based on Oscillation [C]//. IEEE 63rd Vehicular Technology Conference Melbourne, Australia, 2006, 3:1467-1471.
  • 8Eun A C, Dae-Ik C, Deock G, et al. Low computational complexity algorithms of LDPC decoder for DVB-$2 systems [C]//. IEEE Vehicular Technology Conference, 2005.1:536-539.

二级参考文献17

  • 1R G. Gallager. Low density parity check codes [J]. IRE Transactions Information Theory, 1962, 8(1): 21-28.
  • 2R J McEliece, D J C. MacKay, Jung-Fu Cheng. Turbo decoding as an instance of Pearl's "belief propagation" algorithm [J]. IEEE Journal on Selected Areas in Communications, 1998, 16(2): 140-152.
  • 3F R Kschischang, B J R.Frey, H A.Loeliger. Factor graphs and the sum-product algorithm [J]. IEEE Transactions on Information Theory, 2001, 47(2):498-519.
  • 4G Lechner, J Sayir. On the convergence of log-likelihood values in iterative decoding [A]. Proceedings of Mini-Workshop on Topics in Information Theory [C]. Essen, Germany, 2002. 1-4.
  • 5Kienle F, Wehn N. Low complexity stopping criterion for LDPC code decoders [A]. Proceedings of 61 the Vehicular Technology Conference [C]. Paris, France., 2005. 1-1.
  • 6Jin Li, Xiao-hu You, Jing Li. Early stopping for LDPC decoding: convergence of mean magnitude (CMM)[J]. IEEE Communications Letters, 2006, 10(9): 667-669.
  • 7Zhi-qiang Cui, Lu-pin Chen, Zhong-feng Wang. An efficient early stopping scheme for LDPC decoding based on check-node messages[A]. Proceedings of 11^th IEEE Singapore International Conference on Communication Systems[C]. Guangzhou, China, 2008,(1):1325-1329.
  • 8S. Landner, O.Milenkovic. Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes[A]. Proceedings of International Conference on Wireless Networks, Communications, and Mobile Computing [C]. Maui, HI, USA, 2005, (1): 655-660.
  • 9S H Lee, W H Lee, J J Bae, et al. Bit probability transition characteristics of LDPC code [A]. Proceedings of 10^th International Conference on Telecommunications [C]. Tahiti, Papeete-French Polynesia, 2003. 553-557.
  • 10Esa Alghonaim, Aiman El-Maleh, Mohamed Adnan Landolsi. New Technique for Improving Performance of LDPC Codes in the Presence of Trapping Sets [J]. EURASIP Journal on Wireless Communications and Networking, 2008. 1-10.

共引文献4

同被引文献3

引证文献1

二级引证文献1

科技通报
2013年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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