LDPC码的可变校验残差信念传播译码算法

2009 Fourth International Workshop on Signal Design and its Applications in Communications Pub Date : 2009-12-04 DOI:10.1109/IWSDA.2009.5346442

Junghyun Kim, Hong‐Yeop Song

{"title":"LDPC码的可变校验残差信念传播译码算法","authors":"Junghyun Kim, Hong‐Yeop Song","doi":"10.1109/IWSDA.2009.5346442","DOIUrl":null,"url":null,"abstract":"This paper proposes some new improved versions of node-wise VCRBP algorithm, called forced-convergence node-wise VCRBP and sign-based node-wise VCRBP, both of which significantly reduce the decoding complexity and latency, with only negligible deterioration in error correcting performance.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Reduced complexity-and-latency variable-to-check residual belief propagation decoding algorithms for LDPC codes\",\"authors\":\"Junghyun Kim, Hong‐Yeop Song\",\"doi\":\"10.1109/IWSDA.2009.5346442\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes some new improved versions of node-wise VCRBP algorithm, called forced-convergence node-wise VCRBP and sign-based node-wise VCRBP, both of which significantly reduce the decoding complexity and latency, with only negligible deterioration in error correcting performance.\",\"PeriodicalId\":120760,\"journal\":{\"name\":\"2009 Fourth International Workshop on Signal Design and its Applications in Communications\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fourth International Workshop on Signal Design and its Applications in Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWSDA.2009.5346442\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSDA.2009.5346442","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文提出了节点智能VCRBP算法的一些新的改进版本，称为强制收敛节点智能VCRBP和基于符号的节点智能VCRBP，两者都显著降低了解码复杂度和延迟，纠错性能几乎可以忽略不计。

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

查看原文本刊更多论文

Reduced complexity-and-latency variable-to-check residual belief propagation decoding algorithms for LDPC codes

This paper proposes some new improved versions of node-wise VCRBP algorithm, called forced-convergence node-wise VCRBP and sign-based node-wise VCRBP, both of which significantly reduce the decoding complexity and latency, with only negligible deterioration in error correcting performance.

求助全文

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

来源期刊

2009 Fourth International Workshop on Signal Design and its Applications in Communications

自引率

0.00%

发文量