{"title":"关于迭代信念传播的收敛性","authors":"A. Heim, U. Sorger","doi":"10.1109/ISIT.2009.5205780","DOIUrl":null,"url":null,"abstract":"The convergence of iterative decoding schemes utilizing belief propagation is considered. A quantitative bound for the output L-values of a Turbo decoder is given that only depends on the received word and thus is independent from the decoder iterations. Further, it is shown that the exponential increase of the L-values in each iteration within an LDPC decoder is limited by the degree of the variable nodes.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the convergence of iterative belief propagation\",\"authors\":\"A. Heim, U. Sorger\",\"doi\":\"10.1109/ISIT.2009.5205780\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The convergence of iterative decoding schemes utilizing belief propagation is considered. A quantitative bound for the output L-values of a Turbo decoder is given that only depends on the received word and thus is independent from the decoder iterations. Further, it is shown that the exponential increase of the L-values in each iteration within an LDPC decoder is limited by the degree of the variable nodes.\",\"PeriodicalId\":412925,\"journal\":{\"name\":\"2009 IEEE International Symposium on Information Theory\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2009.5205780\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2009.5205780","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the convergence of iterative belief propagation
The convergence of iterative decoding schemes utilizing belief propagation is considered. A quantitative bound for the output L-values of a Turbo decoder is given that only depends on the received word and thus is independent from the decoder iterations. Further, it is shown that the exponential increase of the L-values in each iteration within an LDPC decoder is limited by the degree of the variable nodes.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
