{"title":"一种基于随机构造技术的增量冗余短长度LDPC码","authors":"Shereen A. M. Baghdady, Y. Fahmy, M. El-Soudani","doi":"10.1109/ICTEL.2010.5478640","DOIUrl":null,"url":null,"abstract":"In this paper, a powerful class of irregular low-density parity check (LDPC) codes based on random construction techniques is presented. The resultant codes have accurate profile with the additional features of making them suitable for incremental redundancy systems. The proposed codes also have low encoding complexity and can be decoded efficiently. Moreover, these codes show better puncturing performance than irregular LDPC codes obtained by other techniques over a wide range of code rates (0.6~0.9) and become more distinctive at higher rates.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An incremental redundancy short length LDPC codes based on random construction techniques\",\"authors\":\"Shereen A. M. Baghdady, Y. Fahmy, M. El-Soudani\",\"doi\":\"10.1109/ICTEL.2010.5478640\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a powerful class of irregular low-density parity check (LDPC) codes based on random construction techniques is presented. The resultant codes have accurate profile with the additional features of making them suitable for incremental redundancy systems. The proposed codes also have low encoding complexity and can be decoded efficiently. Moreover, these codes show better puncturing performance than irregular LDPC codes obtained by other techniques over a wide range of code rates (0.6~0.9) and become more distinctive at higher rates.\",\"PeriodicalId\":208094,\"journal\":{\"name\":\"2010 17th International Conference on Telecommunications\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 17th International Conference on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTEL.2010.5478640\",\"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 17th International Conference on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTEL.2010.5478640","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An incremental redundancy short length LDPC codes based on random construction techniques
In this paper, a powerful class of irregular low-density parity check (LDPC) codes based on random construction techniques is presented. The resultant codes have accurate profile with the additional features of making them suitable for incremental redundancy systems. The proposed codes also have low encoding complexity and can be decoded efficiently. Moreover, these codes show better puncturing performance than irregular LDPC codes obtained by other techniques over a wide range of code rates (0.6~0.9) and become more distinctive at higher rates.