{"title":"自校正的udp - app解码LDPC码","authors":"V. Vityazev, E. Likhobabin","doi":"10.1109/MECO.2016.7525774","DOIUrl":null,"url":null,"abstract":"In this paper we propose a very simple but powerful self-correction method for the UMP-APP decoding of LDPC codes. Like self-corrected min-sum decoding, our method does not try to correct the check node processing approximation, but it modifies the variable node processing by erasing unreliable messages. Monte-Carlo simulations show that the proposed self-corrected UMP-APP decoding performs better then common UMP-APP decoding. Estimation of the complexity and average number of iteration for self-corrected UMP-APP algorithm are also shown.","PeriodicalId":253666,"journal":{"name":"2016 5th Mediterranean Conference on Embedded Computing (MECO)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Self-corrected UMP-APP decoding of LDPC codes\",\"authors\":\"V. Vityazev, E. Likhobabin\",\"doi\":\"10.1109/MECO.2016.7525774\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose a very simple but powerful self-correction method for the UMP-APP decoding of LDPC codes. Like self-corrected min-sum decoding, our method does not try to correct the check node processing approximation, but it modifies the variable node processing by erasing unreliable messages. Monte-Carlo simulations show that the proposed self-corrected UMP-APP decoding performs better then common UMP-APP decoding. Estimation of the complexity and average number of iteration for self-corrected UMP-APP algorithm are also shown.\",\"PeriodicalId\":253666,\"journal\":{\"name\":\"2016 5th Mediterranean Conference on Embedded Computing (MECO)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 5th Mediterranean Conference on Embedded Computing (MECO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MECO.2016.7525774\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 5th Mediterranean Conference on Embedded Computing (MECO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MECO.2016.7525774","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we propose a very simple but powerful self-correction method for the UMP-APP decoding of LDPC codes. Like self-corrected min-sum decoding, our method does not try to correct the check node processing approximation, but it modifies the variable node processing by erasing unreliable messages. Monte-Carlo simulations show that the proposed self-corrected UMP-APP decoding performs better then common UMP-APP decoding. Estimation of the complexity and average number of iteration for self-corrected UMP-APP algorithm are also shown.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
