{"title":"Spatially coupled protograph-based LDPC codes for incremental redundancy","authors":"Walter P. Nitzold, M. Lentmaier, G. Fettweis","doi":"10.1109/ISTC.2012.6325218","DOIUrl":null,"url":null,"abstract":"We investigate a family of protograph based rate-compatible LDPC convolutional codes. The code family shows improved thresholds close to the Shannon limit compared to their uncoupled versions for the binary erasure channel as well as the AWGN channel. In fact, the gap to Shannon limit is almost uniform for all members of the code family ensuring good performance for all subsequent incremental redundancy transmissions. Compared to similar code families based on regular LDPC codes [1] the complexity of our approach grows slower for the considered rates.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTC.2012.6325218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
We investigate a family of protograph based rate-compatible LDPC convolutional codes. The code family shows improved thresholds close to the Shannon limit compared to their uncoupled versions for the binary erasure channel as well as the AWGN channel. In fact, the gap to Shannon limit is almost uniform for all members of the code family ensuring good performance for all subsequent incremental redundancy transmissions. Compared to similar code families based on regular LDPC codes [1] the complexity of our approach grows slower for the considered rates.