{"title":"由结构化规则LDPC码设计结构化不规则LDPC码","authors":"V. Kulkarni, K. J. Sankar","doi":"10.1109/C3IT.2015.7060128","DOIUrl":null,"url":null,"abstract":"Irregular Low-Density Parity-Check (LDPC) codes exhibit a performance extremely close to the Shannon capacity formula. In this paper, we presented a method of developing structured irregular LDPC codes from structured regular LDPC codes. The design is based on the expansion of the column-weight two LDPC codes. We used our proposed technique of developing a column-weight two structured regular LDPC codes based on Gray code representations and adapted the expansion method proposed in literature to convert regular codes into irregular ones, and it is noticed that there is an improvement in obtained code rates using the proposed technique. It is also found that encoding process is simpler and requires less memory.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Design of structured irregular LDPC codes from structured regular LDPC codes\",\"authors\":\"V. Kulkarni, K. J. Sankar\",\"doi\":\"10.1109/C3IT.2015.7060128\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Irregular Low-Density Parity-Check (LDPC) codes exhibit a performance extremely close to the Shannon capacity formula. In this paper, we presented a method of developing structured irregular LDPC codes from structured regular LDPC codes. The design is based on the expansion of the column-weight two LDPC codes. We used our proposed technique of developing a column-weight two structured regular LDPC codes based on Gray code representations and adapted the expansion method proposed in literature to convert regular codes into irregular ones, and it is noticed that there is an improvement in obtained code rates using the proposed technique. It is also found that encoding process is simpler and requires less memory.\",\"PeriodicalId\":402311,\"journal\":{\"name\":\"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-03-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/C3IT.2015.7060128\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/C3IT.2015.7060128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Design of structured irregular LDPC codes from structured regular LDPC codes
Irregular Low-Density Parity-Check (LDPC) codes exhibit a performance extremely close to the Shannon capacity formula. In this paper, we presented a method of developing structured irregular LDPC codes from structured regular LDPC codes. The design is based on the expansion of the column-weight two LDPC codes. We used our proposed technique of developing a column-weight two structured regular LDPC codes based on Gray code representations and adapted the expansion method proposed in literature to convert regular codes into irregular ones, and it is noticed that there is an improvement in obtained code rates using the proposed technique. It is also found that encoding process is simpler and requires less memory.