最大功率约束下高斯信道最优码的误差概率

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI:10.1109/ISIT.2019.8849543

G. Vazquez-Vilar

{"title":"最大功率约束下高斯信道最优码的误差概率","authors":"G. Vazquez-Vilar","doi":"10.1109/ISIT.2019.8849543","DOIUrl":null,"url":null,"abstract":"978-1-5386-9291-2/19/$31.00 ©2019 IEEEFor an additive white Gaussian noise channel, we prove that Th. 41 in [Polyanskiy, Poor, Verdú 2010] is a lower bound to the error probability of any channel code satisfying the maximal power constraint. In contrast, the (tighter) lower bound to the error probability in Eq. (20) in [Shannon 1959] only holds under equal power constraint.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"30 1","pages":"2943-2946"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Error Probability of Optimal Codes in Gaussian Channels under Maximal Power Constraint\",\"authors\":\"G. Vazquez-Vilar\",\"doi\":\"10.1109/ISIT.2019.8849543\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"978-1-5386-9291-2/19/$31.00 ©2019 IEEEFor an additive white Gaussian noise channel, we prove that Th. 41 in [Polyanskiy, Poor, Verdú 2010] is a lower bound to the error probability of any channel code satisfying the maximal power constraint. In contrast, the (tighter) lower bound to the error probability in Eq. (20) in [Shannon 1959] only holds under equal power constraint.\",\"PeriodicalId\":6708,\"journal\":{\"name\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"30 1\",\"pages\":\"2943-2946\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"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.8849543\",\"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.8849543","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

对于加性高斯白噪声信道，我们证明了[Polyanskiy, Poor, Verdú 2010]中的Th. 41是满足最大功率约束的任何信道码的错误概率的下界。相比之下，[Shannon 1959]中Eq.(20)中误差概率的(更严格的)下界仅在等功率约束下成立。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the Error Probability of Optimal Codes in Gaussian Channels under Maximal Power Constraint

978-1-5386-9291-2/19/$31.00 ©2019 IEEEFor an additive white Gaussian noise channel, we prove that Th. 41 in [Polyanskiy, Poor, Verdú 2010] is a lower bound to the error probability of any channel code satisfying the maximal power constraint. In contrast, the (tighter) lower bound to the error probability in Eq. (20) in [Shannon 1959] only holds under equal power constraint.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2019 IEEE International Symposium on Information Theory (ISIT)

自引率

0.00%

发文量