基于独立子群的低密度奇偶校验码

2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems Pub Date : 2012-10-25 DOI:10.1109/RED.2012.6338401

F. Ivanov, V. Zyablov, V. Potapov

{"title":"基于独立子群的低密度奇偶校验码","authors":"F. Ivanov, V. Zyablov, V. Potapov","doi":"10.1109/RED.2012.6338401","DOIUrl":null,"url":null,"abstract":"Two criteria of cyclic subgroups independence are proved. The ensemble of regular binary LDPC codes which are based on independent subgroups, is built. The condition of absence of the cycles of the length 4 is proved for the resulting code construction. The results of the received code constructions are presented for the iterative algorithm Sum-Product when the codeword is transmitted over channel with additive Gaussian white noise (AGWN).","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Low-density parity-check codes based on the independent subgroups\",\"authors\":\"F. Ivanov, V. Zyablov, V. Potapov\",\"doi\":\"10.1109/RED.2012.6338401\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Two criteria of cyclic subgroups independence are proved. The ensemble of regular binary LDPC codes which are based on independent subgroups, is built. The condition of absence of the cycles of the length 4 is proved for the resulting code construction. The results of the received code constructions are presented for the iterative algorithm Sum-Product when the codeword is transmitted over channel with additive Gaussian white noise (AGWN).\",\"PeriodicalId\":403644,\"journal\":{\"name\":\"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RED.2012.6338401\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RED.2012.6338401","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

证明了循环子群独立的两个判据。建立了基于独立子群的正则二进制LDPC码集合。对于所得到的编码结构，证明了不存在长度为4的循环的条件。给出了码字在加性高斯白噪声(AGWN)信道上传输时用Sum-Product迭代算法接收到的码结构的结果。

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

查看原文本刊更多论文

Low-density parity-check codes based on the independent subgroups

Two criteria of cyclic subgroups independence are proved. The ensemble of regular binary LDPC codes which are based on independent subgroups, is built. The condition of absence of the cycles of the length 4 is proved for the resulting code construction. The results of the received code constructions are presented for the iterative algorithm Sum-Product when the codeword is transmitted over channel with additive Gaussian white noise (AGWN).

求助全文

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

来源期刊

2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems

自引率

0.00%

发文量