{"title":"二进制标量检测中误差概率的凸性","authors":"M. Azizoglu","doi":"10.1109/ISIT.1994.395084","DOIUrl":null,"url":null,"abstract":"This paper obtains results on the convexity of error probability in the detection of binary-valued scalar signals corrupted by additive noise. It is shown that the error probability of the maximum likelihood receiver is a convex function of the signal-to-noise ratio (SNR) when the noise has a unimodal, differentiable probability density function. This result has some interesting implications on the optimum strategies of the transmitter and the jammer, as well as the optimal use of multiple channels.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"2022 17","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Convexity of error probability in binary scalar detection\",\"authors\":\"M. Azizoglu\",\"doi\":\"10.1109/ISIT.1994.395084\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper obtains results on the convexity of error probability in the detection of binary-valued scalar signals corrupted by additive noise. It is shown that the error probability of the maximum likelihood receiver is a convex function of the signal-to-noise ratio (SNR) when the noise has a unimodal, differentiable probability density function. This result has some interesting implications on the optimum strategies of the transmitter and the jammer, as well as the optimal use of multiple channels.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"2022 17\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"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.395084\",\"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.395084","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Convexity of error probability in binary scalar detection
This paper obtains results on the convexity of error probability in the detection of binary-valued scalar signals corrupted by additive noise. It is shown that the error probability of the maximum likelihood receiver is a convex function of the signal-to-noise ratio (SNR) when the noise has a unimodal, differentiable probability density function. This result has some interesting implications on the optimum strategies of the transmitter and the jammer, as well as the optimal use of multiple channels.<>