基于PEG算法的分布式信源编码的自适应LDPC码设计

2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE Pub Date : 2010-10-01 DOI:10.1109/MILCOM.2010.5680317

Min Jang, J. Kang, Sang-Hyo Kim

{"title":"基于PEG算法的分布式信源编码的自适应LDPC码设计","authors":"Min Jang, J. Kang, Sang-Hyo Kim","doi":"10.1109/MILCOM.2010.5680317","DOIUrl":null,"url":null,"abstract":"We propose a method for constructing rate-adaptive low-density parity check (LDPC) codes with large girth by syndrome merging with progressive-edge-growth (PEG) algorithm. Proposed scheme has a different structure from LDPC accumulate (LDPCA) codes. As a result, the new construction method turns the girth up for each specific code, and eliminates error floor.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":"50 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"A design of rate-adaptive LDPC codes for distributed source coding using PEG algorithm\",\"authors\":\"Min Jang, J. Kang, Sang-Hyo Kim\",\"doi\":\"10.1109/MILCOM.2010.5680317\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a method for constructing rate-adaptive low-density parity check (LDPC) codes with large girth by syndrome merging with progressive-edge-growth (PEG) algorithm. Proposed scheme has a different structure from LDPC accumulate (LDPCA) codes. As a result, the new construction method turns the girth up for each specific code, and eliminates error floor.\",\"PeriodicalId\":330937,\"journal\":{\"name\":\"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE\",\"volume\":\"50 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MILCOM.2010.5680317\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2010.5680317","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

提出了一种基于渐进边缘增长(PEG)算法的自适应低密度奇偶校验(LDPC)码构造方法。该方案具有不同于LDPC累积码(LDPCA)的结构。因此，新的施工方法提高了每个特定代码的周长，并消除了误差层。

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

查看原文本刊更多论文

A design of rate-adaptive LDPC codes for distributed source coding using PEG algorithm

We propose a method for constructing rate-adaptive low-density parity check (LDPC) codes with large girth by syndrome merging with progressive-edge-growth (PEG) algorithm. Proposed scheme has a different structure from LDPC accumulate (LDPCA) codes. As a result, the new construction method turns the girth up for each specific code, and eliminates error floor.

求助全文

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

来源期刊

2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE

自引率

0.00%

发文量