基于BEG的LDPC码最大似然译码算法设计

2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI:10.1109/CISS.2007.4298350

Ki-Moon Lee, H. Radha

{"title":"基于BEG的LDPC码最大似然译码算法设计","authors":"Ki-Moon Lee, H. Radha","doi":"10.1109/CISS.2007.4298350","DOIUrl":null,"url":null,"abstract":"We improve the design of the maximum likelihood decoding algorithm (MLDA) for the development of LDPC codes. Furthermore, we apply the improved design to the decoding of progressive edge growth (PEG) LDPC codes over binary erasure channels (BEC). We also demonstrate clear improvements over current LDPC decoding algorithms.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The Design of the Maximum-Likelihood Decoding Algorithm of LDPC Codes over BEG\",\"authors\":\"Ki-Moon Lee, H. Radha\",\"doi\":\"10.1109/CISS.2007.4298350\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We improve the design of the maximum likelihood decoding algorithm (MLDA) for the development of LDPC codes. Furthermore, we apply the improved design to the decoding of progressive edge growth (PEG) LDPC codes over binary erasure channels (BEC). We also demonstrate clear improvements over current LDPC decoding algorithms.\",\"PeriodicalId\":151241,\"journal\":{\"name\":\"2007 41st Annual Conference on Information Sciences and Systems\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 41st Annual Conference on Information Sciences and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2007.4298350\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 41st Annual Conference on Information Sciences and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2007.4298350","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

针对LDPC码的开发，改进了最大似然译码算法(MLDA)的设计。此外，我们将改进的设计应用于二进制擦除信道(BEC)上的逐行边缘增长(PEG) LDPC码的解码。我们还演示了对当前LDPC解码算法的明显改进。

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

查看原文本刊更多论文

The Design of the Maximum-Likelihood Decoding Algorithm of LDPC Codes over BEG

We improve the design of the maximum likelihood decoding algorithm (MLDA) for the development of LDPC codes. Furthermore, we apply the improved design to the decoding of progressive edge growth (PEG) LDPC codes over binary erasure channels (BEC). We also demonstrate clear improvements over current LDPC decoding algorithms.

求助全文

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

来源期刊

2007 41st Annual Conference on Information Sciences and Systems

自引率

0.00%

发文量