{"title":"多个并行连接代码的最佳穿刺","authors":"F. Brannstrom, L. Rasmussen, A. Grant","doi":"10.1109/ISIT.2004.1365188","DOIUrl":null,"url":null,"abstract":"Optimal puncturing ratios for parallel concatenated codes with two or more constituent codes are found using extrinsic information transfer functions. These ratios minimize the signal-to-noise ratio convergence threshold and provide additional degrees of freedom for constructing codes with low thresholds over a wide range of code rates.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Optimal puncturing for multiple parallel concatenated codes\",\"authors\":\"F. Brannstrom, L. Rasmussen, A. Grant\",\"doi\":\"10.1109/ISIT.2004.1365188\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optimal puncturing ratios for parallel concatenated codes with two or more constituent codes are found using extrinsic information transfer functions. These ratios minimize the signal-to-noise ratio convergence threshold and provide additional degrees of freedom for constructing codes with low thresholds over a wide range of code rates.\",\"PeriodicalId\":269907,\"journal\":{\"name\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2004.1365188\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2004.1365188","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal puncturing for multiple parallel concatenated codes
Optimal puncturing ratios for parallel concatenated codes with two or more constituent codes are found using extrinsic information transfer functions. These ratios minimize the signal-to-noise ratio convergence threshold and provide additional degrees of freedom for constructing codes with low thresholds over a wide range of code rates.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
