低密度奇偶校验码的改进最小和算法

2010 IEEE International Conference on Wireless Communications, Networking and Information Security Pub Date : 2010-06-25 DOI:10.1109/WCINS.2010.5541818

W. Han, Jianguo Huang, Fangfei Wu

{"title":"低密度奇偶校验码的改进最小和算法","authors":"W. Han, Jianguo Huang, Fangfei Wu","doi":"10.1109/WCINS.2010.5541818","DOIUrl":null,"url":null,"abstract":"A modified Min-Sum algorithm for low-density parity check codes is proposed in this paper. The inaccurate check node messages of the Min-Sum algorithm compared to the belief propagation (BP) algorithm are compensated by modified variable node messages, which is different from the normalized Min-Sum algorithm. The modified factor is obtained before decoding program and only one extra multiplication is needed in one cycle. So the increased complexity is fairly low. The simulation results show that the bit error rate (BER) and average number of iteration of the modified Min-Sum algorithm are very close to the BP algorithm, the modified algorithm can improve the BER performance compared to the Min-Sum algorithm while added complexity slightly.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"A modified Min-Sum algorithm for low-density parity-check codes\",\"authors\":\"W. Han, Jianguo Huang, Fangfei Wu\",\"doi\":\"10.1109/WCINS.2010.5541818\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A modified Min-Sum algorithm for low-density parity check codes is proposed in this paper. The inaccurate check node messages of the Min-Sum algorithm compared to the belief propagation (BP) algorithm are compensated by modified variable node messages, which is different from the normalized Min-Sum algorithm. The modified factor is obtained before decoding program and only one extra multiplication is needed in one cycle. So the increased complexity is fairly low. The simulation results show that the bit error rate (BER) and average number of iteration of the modified Min-Sum algorithm are very close to the BP algorithm, the modified algorithm can improve the BER performance compared to the Min-Sum algorithm while added complexity slightly.\",\"PeriodicalId\":156036,\"journal\":{\"name\":\"2010 IEEE International Conference on Wireless Communications, Networking and Information Security\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Wireless Communications, Networking and Information Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCINS.2010.5541818\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCINS.2010.5541818","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

提出了一种改进的低密度奇偶校验码最小和算法。与归一化最小和算法相比，最小和算法的检查节点消息不准确，通过修改的可变节点消息进行补偿。修改因子在译码前得到，一个周期内只需要增加一次乘法。所以增加的复杂性是相当低的。仿真结果表明，改进最小和算法的误码率(BER)和平均迭代次数与BP算法非常接近，与最小和算法相比，改进最小和算法的误码率性能有所提高，但复杂度略有增加。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A modified Min-Sum algorithm for low-density parity-check codes

A modified Min-Sum algorithm for low-density parity check codes is proposed in this paper. The inaccurate check node messages of the Min-Sum algorithm compared to the belief propagation (BP) algorithm are compensated by modified variable node messages, which is different from the normalized Min-Sum algorithm. The modified factor is obtained before decoding program and only one extra multiplication is needed in one cycle. So the increased complexity is fairly low. The simulation results show that the bit error rate (BER) and average number of iteration of the modified Min-Sum algorithm are very close to the BP algorithm, the modified algorithm can improve the BER performance compared to the Min-Sum algorithm while added complexity slightly.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 IEEE International Conference on Wireless Communications, Networking and Information Security

自引率

0.00%

发文量