可逆LDPC码的循环矩阵研究

IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004. Pub Date : 2004-10-26 DOI:10.1109/ISCIT.2004.1413866

Anchalee Puengnim

{"title":"可逆LDPC码的循环矩阵研究","authors":"Anchalee Puengnim","doi":"10.1109/ISCIT.2004.1413866","DOIUrl":null,"url":null,"abstract":"We investigate the error performance of reversible LDPC codes constructed from the circulant matrix (Haley, D. et al., IEEE Global Telecom. Conf., vol.1, p.1303-7, 2002) in the region of BER smaller than 10/sup -5/. We also propose and investigate other possible circulant matrices selected from some primitive polynomials over GF(2). We expect to offer another choice of block length and in some cases better error performance for reversible LDPC codes.","PeriodicalId":237047,"journal":{"name":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Investigation of circulant matrices for reversible LDPC codes\",\"authors\":\"Anchalee Puengnim\",\"doi\":\"10.1109/ISCIT.2004.1413866\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the error performance of reversible LDPC codes constructed from the circulant matrix (Haley, D. et al., IEEE Global Telecom. Conf., vol.1, p.1303-7, 2002) in the region of BER smaller than 10/sup -5/. We also propose and investigate other possible circulant matrices selected from some primitive polynomials over GF(2). We expect to offer another choice of block length and in some cases better error performance for reversible LDPC codes.\",\"PeriodicalId\":237047,\"journal\":{\"name\":\"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCIT.2004.1413866\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2004.1413866","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们研究了由循环矩阵构造的可逆LDPC码的错误性能(Haley, D. et al.， IEEE Global Telecom)。Conf. vol.1, p.1303-7, 2002)在BER小于10/sup -5/的区域。我们还提出并研究了从GF(2)上的一些原始多项式中选择的其他可能的循环矩阵。我们期望为可逆LDPC码提供另一种块长度选择，并在某些情况下提供更好的错误性能。

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

查看原文本刊更多论文

Investigation of circulant matrices for reversible LDPC codes

We investigate the error performance of reversible LDPC codes constructed from the circulant matrix (Haley, D. et al., IEEE Global Telecom. Conf., vol.1, p.1303-7, 2002) in the region of BER smaller than 10/sup -5/. We also propose and investigate other possible circulant matrices selected from some primitive polynomials over GF(2). We expect to offer another choice of block length and in some cases better error performance for reversible LDPC codes.

求助全文

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

来源期刊

IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.

自引率

0.00%

发文量