{"title":"基于扩展技术的有限长度速率兼容LDPC码","authors":"Jingjing Liu, R. D. Lamare","doi":"10.1109/ISWCS.2011.6125306","DOIUrl":null,"url":null,"abstract":"We propose two innovative extension schemes for Rate-Compatible (RC) Low-Density Parity-Check (LDPC) codes with short/moderate block lengths. The proposed designs are based on the counting cycles algorithm and the Approximate Cycle Extrinsic Message Degree (EMD). Our layer-structured extension schemes enjoy a linear-time encodable ability and relatively low decoding complexity thanks to low degree profiles with limited decoding iterations, such that they intrinsically fit in a type-II hybrid automatic repeat-request (ARQ) system. Simulation results show that the proposed approaches manage to yield a performance gain of up to 0.3 dB when compared to the existing extension technique.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Finite-length rate-compatible LDPC codes based on extension techniques\",\"authors\":\"Jingjing Liu, R. D. Lamare\",\"doi\":\"10.1109/ISWCS.2011.6125306\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose two innovative extension schemes for Rate-Compatible (RC) Low-Density Parity-Check (LDPC) codes with short/moderate block lengths. The proposed designs are based on the counting cycles algorithm and the Approximate Cycle Extrinsic Message Degree (EMD). Our layer-structured extension schemes enjoy a linear-time encodable ability and relatively low decoding complexity thanks to low degree profiles with limited decoding iterations, such that they intrinsically fit in a type-II hybrid automatic repeat-request (ARQ) system. Simulation results show that the proposed approaches manage to yield a performance gain of up to 0.3 dB when compared to the existing extension technique.\",\"PeriodicalId\":414065,\"journal\":{\"name\":\"2011 8th International Symposium on Wireless Communication Systems\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 8th International Symposium on Wireless Communication Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISWCS.2011.6125306\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 8th International Symposium on Wireless Communication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2011.6125306","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Finite-length rate-compatible LDPC codes based on extension techniques
We propose two innovative extension schemes for Rate-Compatible (RC) Low-Density Parity-Check (LDPC) codes with short/moderate block lengths. The proposed designs are based on the counting cycles algorithm and the Approximate Cycle Extrinsic Message Degree (EMD). Our layer-structured extension schemes enjoy a linear-time encodable ability and relatively low decoding complexity thanks to low degree profiles with limited decoding iterations, such that they intrinsically fit in a type-II hybrid automatic repeat-request (ARQ) system. Simulation results show that the proposed approaches manage to yield a performance gain of up to 0.3 dB when compared to the existing extension technique.