{"title":"不规则重复累加代码，改进了错误层性能","authors":"David F. Hayes, Sarah J. Johnson, S. Weller","doi":"10.1109/CIG.2010.5592734","DOIUrl":null,"url":null,"abstract":"In this paper, we present a new class of iteratively decoded error correction codes. These codes, which are a modification of irregular repeat-accumulate (IRA) codes, are termed generalized IRA (GIRA) codes, and are designed for improved error floor performance. GIRA codes are systematic, easily encodable, and are decoded with the sum-product algorithm. In this paper we present a density evolution algorithm to compute the threshold of GIRA codes, and find GIRA degree distributions which produce codes with good thresholds. We then propose inner code designs and show using simulation results that they improve upon the error floor performance of IRA codes.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"328 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Irregular repeat-accumulate-like codes with improved error floor performance\",\"authors\":\"David F. Hayes, Sarah J. Johnson, S. Weller\",\"doi\":\"10.1109/CIG.2010.5592734\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a new class of iteratively decoded error correction codes. These codes, which are a modification of irregular repeat-accumulate (IRA) codes, are termed generalized IRA (GIRA) codes, and are designed for improved error floor performance. GIRA codes are systematic, easily encodable, and are decoded with the sum-product algorithm. In this paper we present a density evolution algorithm to compute the threshold of GIRA codes, and find GIRA degree distributions which produce codes with good thresholds. We then propose inner code designs and show using simulation results that they improve upon the error floor performance of IRA codes.\",\"PeriodicalId\":354925,\"journal\":{\"name\":\"2010 IEEE Information Theory Workshop\",\"volume\":\"328 \",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Information Theory Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIG.2010.5592734\",\"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 Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIG.2010.5592734","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Irregular repeat-accumulate-like codes with improved error floor performance
In this paper, we present a new class of iteratively decoded error correction codes. These codes, which are a modification of irregular repeat-accumulate (IRA) codes, are termed generalized IRA (GIRA) codes, and are designed for improved error floor performance. GIRA codes are systematic, easily encodable, and are decoded with the sum-product algorithm. In this paper we present a density evolution algorithm to compute the threshold of GIRA codes, and find GIRA degree distributions which produce codes with good thresholds. We then propose inner code designs and show using simulation results that they improve upon the error floor performance of IRA codes.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
