{"title":"基于累加器和LDPC码的错误层和消息缩放解码","authors":"M. Isaka","doi":"10.1109/ITW2.2006.323769","DOIUrl":null,"url":null,"abstract":"In this paper, we study the error floor of accumulator-based codes under iterative decoding and attempt to improve the performance. It is shown that the associated error events are often due to detectable errors, and proper design of an interleaver is effective for such weakness of the code. Subsequently, a simple modification of iterative decoding by scaling messages is shown to effectively achieve lower error probabilities in the error floor region, with an extension to LDPC codes.","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Error Floor and Decoding with Message Scaling for Accumulator-Based and LDPC Codes\",\"authors\":\"M. Isaka\",\"doi\":\"10.1109/ITW2.2006.323769\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study the error floor of accumulator-based codes under iterative decoding and attempt to improve the performance. It is shown that the associated error events are often due to detectable errors, and proper design of an interleaver is effective for such weakness of the code. Subsequently, a simple modification of iterative decoding by scaling messages is shown to effectively achieve lower error probabilities in the error floor region, with an extension to LDPC codes.\",\"PeriodicalId\":299513,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW2.2006.323769\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW2.2006.323769","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Error Floor and Decoding with Message Scaling for Accumulator-Based and LDPC Codes
In this paper, we study the error floor of accumulator-based codes under iterative decoding and attempt to improve the performance. It is shown that the associated error events are often due to detectable errors, and proper design of an interleaver is effective for such weakness of the code. Subsequently, a simple modification of iterative decoding by scaling messages is shown to effectively achieve lower error probabilities in the error floor region, with an extension to LDPC codes.