Tarik Benaddi, Arti D. Yardi, C. Poulliat, I. Andriyanova
{"title":"串行串接Turbo码的最大后验阈值估计","authors":"Tarik Benaddi, Arti D. Yardi, C. Poulliat, I. Andriyanova","doi":"10.1109/ISIT.2019.8849536","DOIUrl":null,"url":null,"abstract":"We investigate the problem of estimating the maximum a posteriori (MAP) threshold for serially concatenated turbo codes. First, we provide a method to compute this MAP threshold using a numerical approximation of the EBP-GEXIT chart and the Maxwell construction. Second, we explore where the spatially coupled belief propagation (BP) threshold is located with respect to the previously computed MAP threshold and analyze the saturation phenomenon of such schemes. Simulation results indicate that the BP threshold of the spatially coupled turbo-codes saturates to the MAP threshold obtained using the EBP-GEXIT chart.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"5 1","pages":"1347-1351"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Estimating the Maximum a Posteriori Threshold for Serially Concatenated Turbo Codes\",\"authors\":\"Tarik Benaddi, Arti D. Yardi, C. Poulliat, I. Andriyanova\",\"doi\":\"10.1109/ISIT.2019.8849536\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the problem of estimating the maximum a posteriori (MAP) threshold for serially concatenated turbo codes. First, we provide a method to compute this MAP threshold using a numerical approximation of the EBP-GEXIT chart and the Maxwell construction. Second, we explore where the spatially coupled belief propagation (BP) threshold is located with respect to the previously computed MAP threshold and analyze the saturation phenomenon of such schemes. Simulation results indicate that the BP threshold of the spatially coupled turbo-codes saturates to the MAP threshold obtained using the EBP-GEXIT chart.\",\"PeriodicalId\":6708,\"journal\":{\"name\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"5 1\",\"pages\":\"1347-1351\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2019.8849536\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2019.8849536","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Estimating the Maximum a Posteriori Threshold for Serially Concatenated Turbo Codes
We investigate the problem of estimating the maximum a posteriori (MAP) threshold for serially concatenated turbo codes. First, we provide a method to compute this MAP threshold using a numerical approximation of the EBP-GEXIT chart and the Maxwell construction. Second, we explore where the spatially coupled belief propagation (BP) threshold is located with respect to the previously computed MAP threshold and analyze the saturation phenomenon of such schemes. Simulation results indicate that the BP threshold of the spatially coupled turbo-codes saturates to the MAP threshold obtained using the EBP-GEXIT chart.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
