{"title":"Iterative reliability based decoding of LDPC codes","authors":"M. Fossorier","doi":"10.1109/ISIT.2001.936096","DOIUrl":null,"url":null,"abstract":"In this work, reliability based decoding is combined with belief propagation (BP) decoding for low-density parity check (LDPC) codes. At each iteration, the soft output values delivered by the BP algorithm are used as reliability values to perform reduced complexity soft decision decoding of the code considered. This approach allows to bridge the error performance gap between BP decoding which remains suboptimum, and maximum likelihood decoding (MLD) which is too complex to be implemented for the codes considered. A stopping criterion which reduces the average number of iterations at the expense of very little performance degradation is also proposed for this combined decoding approach. Simulations results for several Gallager LDPC codes and different set cyclic (DSC) codes of hundreds of information bits are given and elaborated.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"371 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.936096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
Abstract
In this work, reliability based decoding is combined with belief propagation (BP) decoding for low-density parity check (LDPC) codes. At each iteration, the soft output values delivered by the BP algorithm are used as reliability values to perform reduced complexity soft decision decoding of the code considered. This approach allows to bridge the error performance gap between BP decoding which remains suboptimum, and maximum likelihood decoding (MLD) which is too complex to be implemented for the codes considered. A stopping criterion which reduces the average number of iterations at the expense of very little performance degradation is also proposed for this combined decoding approach. Simulations results for several Gallager LDPC codes and different set cyclic (DSC) codes of hundreds of information bits are given and elaborated.