高速率LDPC码的扩展PEG算法

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI:10.1109/ISPA.2009.80

Zhiheng Zhou, Xiangxue Li, D. Zheng, Kefei Chen, Jianhua Li

{"title":"高速率LDPC码的扩展PEG算法","authors":"Zhiheng Zhou, Xiangxue Li, D. Zheng, Kefei Chen, Jianhua Li","doi":"10.1109/ISPA.2009.80","DOIUrl":null,"url":null,"abstract":"Progressive Edge-Growth(PEG) Algorithm is a good candidate to generate Tanner Graphs with a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner. In this paper, we propose an extended PEG algorithm for constructing Low-Density Parity-Check (LDPC) codes with very high rate when given a lower bound of girth. Simulation results show the bit error rates of constructed LDPC codes with very high rate or large girth.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"146 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Extended PEG Algorithm for High Rate LDPC Codes\",\"authors\":\"Zhiheng Zhou, Xiangxue Li, D. Zheng, Kefei Chen, Jianhua Li\",\"doi\":\"10.1109/ISPA.2009.80\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Progressive Edge-Growth(PEG) Algorithm is a good candidate to generate Tanner Graphs with a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner. In this paper, we propose an extended PEG algorithm for constructing Low-Density Parity-Check (LDPC) codes with very high rate when given a lower bound of girth. Simulation results show the bit error rates of constructed LDPC codes with very high rate or large girth.\",\"PeriodicalId\":346815,\"journal\":{\"name\":\"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications\",\"volume\":\"146 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPA.2009.80\",\"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 IEEE International Symposium on Parallel and Distributed Processing with Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPA.2009.80","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

渐进边缘增长算法(Progressive Edge-Growth, PEG)通过在符号节点和校验节点之间逐边建立边或连接来生成周长较大的坦纳图，是一种很好的算法。在本文中，我们提出了一种扩展的PEG算法，用于在给定环下界时构造具有很高率的低密度奇偶校验(LDPC)码。仿真结果表明，所构造的LDPC码具有很高的误码率和较大的码周。

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

查看原文本刊更多论文

Extended PEG Algorithm for High Rate LDPC Codes

Progressive Edge-Growth(PEG) Algorithm is a good candidate to generate Tanner Graphs with a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner. In this paper, we propose an extended PEG algorithm for constructing Low-Density Parity-Check (LDPC) codes with very high rate when given a lower bound of girth. Simulation results show the bit error rates of constructed LDPC codes with very high rate or large girth.

求助全文

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

来源期刊

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications

自引率

0.00%

发文量