{"title":"一种有效的LDPC码并行串接方法,降低了复杂度和译码延迟","authors":"R. P. Kumar, R. S. Kshetrimayum","doi":"10.1109/NCC.2013.6487947","DOIUrl":null,"url":null,"abstract":"Parallel concatenated Gallager codes (PCGC) is a class of concatenated codes based on LDPC component codes. Conventional attempts for concatenating LDPC in parallel using the well known ‘Turbo code structure’ without interleavers have not been widely successful, because of its performance limitation and decoding delay. In this paper we present an efficient methodology for parallel concatenation of LDPC codes. We show that proposed methodology for PCGC outperforms existing PCGC in terms of BER performance in both AWGN and flat fading Rayleigh channels. We also present that proposed PCGC outperforms existing PCGC in terms of complexity as well as decoding delay.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"An efficient methodology for parallel concatenation of LDPC codes with reduced complexity and decoding delay\",\"authors\":\"R. P. Kumar, R. S. Kshetrimayum\",\"doi\":\"10.1109/NCC.2013.6487947\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Parallel concatenated Gallager codes (PCGC) is a class of concatenated codes based on LDPC component codes. Conventional attempts for concatenating LDPC in parallel using the well known ‘Turbo code structure’ without interleavers have not been widely successful, because of its performance limitation and decoding delay. In this paper we present an efficient methodology for parallel concatenation of LDPC codes. We show that proposed methodology for PCGC outperforms existing PCGC in terms of BER performance in both AWGN and flat fading Rayleigh channels. We also present that proposed PCGC outperforms existing PCGC in terms of complexity as well as decoding delay.\",\"PeriodicalId\":202526,\"journal\":{\"name\":\"2013 National Conference on Communications (NCC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 National Conference on Communications (NCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCC.2013.6487947\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2013.6487947","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An efficient methodology for parallel concatenation of LDPC codes with reduced complexity and decoding delay
Parallel concatenated Gallager codes (PCGC) is a class of concatenated codes based on LDPC component codes. Conventional attempts for concatenating LDPC in parallel using the well known ‘Turbo code structure’ without interleavers have not been widely successful, because of its performance limitation and decoding delay. In this paper we present an efficient methodology for parallel concatenation of LDPC codes. We show that proposed methodology for PCGC outperforms existing PCGC in terms of BER performance in both AWGN and flat fading Rayleigh channels. We also present that proposed PCGC outperforms existing PCGC in terms of complexity as well as decoding delay.