LDPC码中捕获集的识别技术

2014 21st IEEE International Conference on Electronics, Circuits and Systems (ICECS) Pub Date : 2014-12-01 DOI:10.1109/ICECS.2014.7050116

Christos Vasilopoulos, Vassilis Paliouras

{"title":"LDPC码中捕获集的识别技术","authors":"Christos Vasilopoulos, Vassilis Paliouras","doi":"10.1109/ICECS.2014.7050116","DOIUrl":null,"url":null,"abstract":"In this paper we consider the problem of identifying trapping sets in Low Density Parity Check codes (LDPC), which is a hard NP-complete problem, as conjectured in [1]. We introduce a method for identifying trapping sets in LDPC codes. The proposed method is flexible and parametric. Furthermore it achieves low complexity and execution time and low memory requirements.","PeriodicalId":133747,"journal":{"name":"2014 21st IEEE International Conference on Electronics, Circuits and Systems (ICECS)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A technique for the identification of trapping sets in LDPC codes\",\"authors\":\"Christos Vasilopoulos, Vassilis Paliouras\",\"doi\":\"10.1109/ICECS.2014.7050116\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider the problem of identifying trapping sets in Low Density Parity Check codes (LDPC), which is a hard NP-complete problem, as conjectured in [1]. We introduce a method for identifying trapping sets in LDPC codes. The proposed method is flexible and parametric. Furthermore it achieves low complexity and execution time and low memory requirements.\",\"PeriodicalId\":133747,\"journal\":{\"name\":\"2014 21st IEEE International Conference on Electronics, Circuits and Systems (ICECS)\",\"volume\":\"148 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 21st IEEE International Conference on Electronics, Circuits and Systems (ICECS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECS.2014.7050116\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 21st IEEE International Conference on Electronics, Circuits and Systems (ICECS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECS.2014.7050116","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文考虑低密度奇偶校验码(LDPC)中捕获集的识别问题，这是一个硬np完全问题，如文献[1]所推测的那样。介绍了一种LDPC码中捕获集的识别方法。该方法具有灵活性和参数化的特点。此外，它还实现了低复杂度、低执行时间和低内存需求。

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

查看原文本刊更多论文

A technique for the identification of trapping sets in LDPC codes

In this paper we consider the problem of identifying trapping sets in Low Density Parity Check codes (LDPC), which is a hard NP-complete problem, as conjectured in [1]. We introduce a method for identifying trapping sets in LDPC codes. The proposed method is flexible and parametric. Furthermore it achieves low complexity and execution time and low memory requirements.

求助全文

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

来源期刊

2014 21st IEEE International Conference on Electronics, Circuits and Systems (ICECS)

自引率

0.00%

发文量