Convexity properties in binary detection problems

Authors:
M. Azizoglu
Affiliations:
Dept. of Electr. Eng., Washington Univ., Seattle, WA
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 7

Optimal noise benefits in Neyman-Pearson and inequality-constrained statistical signal detection

IEEE Transactions on Signal Processing
Log-concavity property of the error probability with application to local bounds for wireless communications

IEEE Transactions on Information Theory
Optimal signaling and detector design for power-constrained binary communications systems over non-Gaussian channels

IEEE Communications Letters
Error rates of the maximum-likelihood detector for arbitrary constellations: convex/concave behavior and applications

IEEE Transactions on Information Theory
Optimal stochastic signaling for power-constrained binary communications systems

IEEE Transactions on Wireless Communications
Stochastic signaling in the presence of channel state information uncertainty

Digital Signal Processing
Optimal signaling and detector design for M-ary communication systems in the presence of multiple additive noise channels

Digital Signal Processing

Quantified Score

Hi-index	754.96

Visualization

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