{"title":"网格代码的后验概率与性能评价","authors":"Hans-Andrea Loeliger","doi":"10.1109/ISIT.1994.394683","DOIUrl":null,"url":null,"abstract":"A new method for the performance evaluation of (Viterbi decoded) trellis codes is investigated. The method is based on the fact that the a posteriori probability of individual decoded bits can be computed very efficiently. Unfortunately, the improvement of the new method over ordinary simulation is found to be only marginal, which reveals unexpectedly strong fluctuations of the reliability of individual decoded bits.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"A posteriori probabilities and performance evaluation of trellis codes\",\"authors\":\"Hans-Andrea Loeliger\",\"doi\":\"10.1109/ISIT.1994.394683\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new method for the performance evaluation of (Viterbi decoded) trellis codes is investigated. The method is based on the fact that the a posteriori probability of individual decoded bits can be computed very efficiently. Unfortunately, the improvement of the new method over ordinary simulation is found to be only marginal, which reveals unexpectedly strong fluctuations of the reliability of individual decoded bits.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1994.394683\",\"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 of 1994 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1994.394683","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A posteriori probabilities and performance evaluation of trellis codes
A new method for the performance evaluation of (Viterbi decoded) trellis codes is investigated. The method is based on the fact that the a posteriori probability of individual decoded bits can be computed very efficiently. Unfortunately, the improvement of the new method over ordinary simulation is found to be only marginal, which reveals unexpectedly strong fluctuations of the reliability of individual decoded bits.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
