Convexity properties in binary detection problems

Abstract

The author investigates the convexity properties 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 power when the noise has a unimodal distribution. Based on this property, the results of the optimal time-sharing strategies of transmitters and jammers, and of the optimal use of multiple channels are obtained.