一类可分解有限几何LDPC码的多级编码

2008 4th IEEE International Conference on Circuits and Systems for Communications Pub Date : 2008-05-26 DOI:10.1109/ICCSC.2008.16

Ya Liu, Hui-fang Chen, Lei Xie, Ming Gao

{"title":"一类可分解有限几何LDPC码的多级编码","authors":"Ya Liu, Hui-fang Chen, Lei Xie, Ming Gao","doi":"10.1109/ICCSC.2008.16","DOIUrl":null,"url":null,"abstract":"This paper proposes a class of decomposable LDPC codes based on finite geometry EG(m, ps) over bandlimited AWGN channel. These LDPC codes defined as the origin LDPC codes are decomposed into a few small LDPC codes as component codes in multilevel coding. It is shown that the origin LDPC codes demand generic M-ary Min-Sum algorithm while the component codes only require a few binary Min-Sum algorithm implementations in multi-stages decoding. The method proposed simplifies the decoding complexity.","PeriodicalId":137660,"journal":{"name":"2008 4th IEEE International Conference on Circuits and Systems for Communications","volume":"275 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multilevel Coding with a Class of Decomposable Finite-Geometry LDPC Codes\",\"authors\":\"Ya Liu, Hui-fang Chen, Lei Xie, Ming Gao\",\"doi\":\"10.1109/ICCSC.2008.16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a class of decomposable LDPC codes based on finite geometry EG(m, ps) over bandlimited AWGN channel. These LDPC codes defined as the origin LDPC codes are decomposed into a few small LDPC codes as component codes in multilevel coding. It is shown that the origin LDPC codes demand generic M-ary Min-Sum algorithm while the component codes only require a few binary Min-Sum algorithm implementations in multi-stages decoding. The method proposed simplifies the decoding complexity.\",\"PeriodicalId\":137660,\"journal\":{\"name\":\"2008 4th IEEE International Conference on Circuits and Systems for Communications\",\"volume\":\"275 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 4th IEEE International Conference on Circuits and Systems for Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSC.2008.16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 4th IEEE International Conference on Circuits and Systems for Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSC.2008.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在有限带宽AWGN信道上，提出了一类基于有限几何EG(m, ps)的可分解LDPC码。在多级编码中，这些被定义为原始LDPC码的LDPC码被分解成几个小的LDPC码作为分量码。结果表明，原始LDPC码在多段译码中需要通用的M-ary最小和算法，而组件码只需要少量的二进制最小和算法实现。该方法简化了译码复杂度。

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

查看原文本刊更多论文

Multilevel Coding with a Class of Decomposable Finite-Geometry LDPC Codes

This paper proposes a class of decomposable LDPC codes based on finite geometry EG(m, ps) over bandlimited AWGN channel. These LDPC codes defined as the origin LDPC codes are decomposed into a few small LDPC codes as component codes in multilevel coding. It is shown that the origin LDPC codes demand generic M-ary Min-Sum algorithm while the component codes only require a few binary Min-Sum algorithm implementations in multi-stages decoding. The method proposed simplifies the decoding complexity.

求助全文

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

来源期刊

2008 4th IEEE International Conference on Circuits and Systems for Communications

自引率

0.00%

发文量