二进制擦除信道的原始LDPC码的阈值上限和优化设计

2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2015-09-01 DOI:10.1109/IWSDA.2015.7458400

Surajkumar Harikumar, Jayanthi Ramesh, Manikandan Srinivasan, A. Thangaraj

{"title":"二进制擦除信道的原始LDPC码的阈值上限和优化设计","authors":"Surajkumar Harikumar, Jayanthi Ramesh, Manikandan Srinivasan, A. Thangaraj","doi":"10.1109/IWSDA.2015.7458400","DOIUrl":null,"url":null,"abstract":"Exact density evolution of protograph Low Density Parity Check (LDPC) codes over the Binary Erasure Channel (BEC) is considered. Upper bounds on the threshold are derived and expressed as single-variable minimizations. A simplified version of the upper bound is expressed in closed form in terms of the degrees of the nodes in the protograph. By maximizing the upper bound, useful conditions are derived for optimizing protographs to get thresholds close to capacity bounds. Using these conditions, a randomized construction method for good small-sized protographs is presented.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Threshold upper bounds and optimized design of protograph LDPC codes for the Binary Erasure Channel\",\"authors\":\"Surajkumar Harikumar, Jayanthi Ramesh, Manikandan Srinivasan, A. Thangaraj\",\"doi\":\"10.1109/IWSDA.2015.7458400\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Exact density evolution of protograph Low Density Parity Check (LDPC) codes over the Binary Erasure Channel (BEC) is considered. Upper bounds on the threshold are derived and expressed as single-variable minimizations. A simplified version of the upper bound is expressed in closed form in terms of the degrees of the nodes in the protograph. By maximizing the upper bound, useful conditions are derived for optimizing protographs to get thresholds close to capacity bounds. Using these conditions, a randomized construction method for good small-sized protographs is presented.\",\"PeriodicalId\":371829,\"journal\":{\"name\":\"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWSDA.2015.7458400\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSDA.2015.7458400","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

研究了原始低密度奇偶校验码(LDPC)在二进制擦除信道(BEC)上的精确密度演化。阈值的上界被导出并表示为单变量最小化。上界的简化形式是用原始图中节点的度数来表示的。通过最大化上界，导出了优化原生图以获得接近容量边界的阈值的有用条件。在这些条件下，提出了一种小型原型机的随机构造方法。

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

查看原文本刊更多论文

Threshold upper bounds and optimized design of protograph LDPC codes for the Binary Erasure Channel

Exact density evolution of protograph Low Density Parity Check (LDPC) codes over the Binary Erasure Channel (BEC) is considered. Upper bounds on the threshold are derived and expressed as single-variable minimizations. A simplified version of the upper bound is expressed in closed form in terms of the degrees of the nodes in the protograph. By maximizing the upper bound, useful conditions are derived for optimizing protographs to get thresholds close to capacity bounds. Using these conditions, a randomized construction method for good small-sized protographs is presented.

求助全文

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

来源期刊

2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)

自引率

0.00%

发文量