{"title":"turbo译码算法有不动点","authors":"Long Duan, B. Rimoldi","doi":"10.1109/ISIT.1998.708882","DOIUrl":null,"url":null,"abstract":"It is shown that the iterative decoding algorithm proposed for decoding \"turbo codes\" has fixed points regardless of the specific constituent codes and regardless of the variance of the additive white Gaussian noise.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"The turbo decoding algorithm has fixed points\",\"authors\":\"Long Duan, B. Rimoldi\",\"doi\":\"10.1109/ISIT.1998.708882\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is shown that the iterative decoding algorithm proposed for decoding \\\"turbo codes\\\" has fixed points regardless of the specific constituent codes and regardless of the variance of the additive white Gaussian noise.\",\"PeriodicalId\":133728,\"journal\":{\"name\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1998.708882\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1998.708882","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
It is shown that the iterative decoding algorithm proposed for decoding "turbo codes" has fixed points regardless of the specific constituent codes and regardless of the variance of the additive white Gaussian noise.