Zhong-xun Wang, Xingcheng Wang, Xinqiao Yu, D. Guo
{"title":"基于节点残差的LDPC码BP译码算法","authors":"Zhong-xun Wang, Xingcheng Wang, Xinqiao Yu, D. Guo","doi":"10.1109/WCINS.2010.5541903","DOIUrl":null,"url":null,"abstract":"We researched BP decoding algorithm based on variable-to-check information residual for LDPC code (VC-RBP) in this paper. It is a dynamic scheduling belief propagation using residuals, and has some advantages, such as fast decoding, good performance, and low complexity. It is similar to residual belief propagation (RBP),but has some difference in computing the residual message. Simulation shows that it outperforms with only a maximum of ten iterations by about 0.28 dB compared with RBP at an BER of 10-4.","PeriodicalId":272940,"journal":{"name":"IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A BP decoding algorithm based on nodes residual for LDPC codes\",\"authors\":\"Zhong-xun Wang, Xingcheng Wang, Xinqiao Yu, D. Guo\",\"doi\":\"10.1109/WCINS.2010.5541903\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We researched BP decoding algorithm based on variable-to-check information residual for LDPC code (VC-RBP) in this paper. It is a dynamic scheduling belief propagation using residuals, and has some advantages, such as fast decoding, good performance, and low complexity. It is similar to residual belief propagation (RBP),but has some difference in computing the residual message. Simulation shows that it outperforms with only a maximum of ten iterations by about 0.28 dB compared with RBP at an BER of 10-4.\",\"PeriodicalId\":272940,\"journal\":{\"name\":\"IEEE International Conference on Wireless Communications, Networking and Information Security\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on Wireless Communications, Networking and Information Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCINS.2010.5541903\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Wireless Communications, Networking and Information Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCINS.2010.5541903","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A BP decoding algorithm based on nodes residual for LDPC codes
We researched BP decoding algorithm based on variable-to-check information residual for LDPC code (VC-RBP) in this paper. It is a dynamic scheduling belief propagation using residuals, and has some advantages, such as fast decoding, good performance, and low complexity. It is similar to residual belief propagation (RBP),but has some difference in computing the residual message. Simulation shows that it outperforms with only a maximum of ten iterations by about 0.28 dB compared with RBP at an BER of 10-4.