By Topic

Signal detection games with power constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D. W. Sauder ; Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA ; E. Geraniotis

Formulates and solves maximin and minimax detection problems for signals with power constraints. These problems arise whenever it is necessary to distinguish between a genuine signal and a spurious one designed by an adversary with the principal goal of deceiving the detector. The spurious (or deceptive) signal is subject to certain constraints, such as limited power, which preclude it from replicating the genuine signal exactly. The detection problem is formulated as a zero-sum game involving two players: the detector designer and the signal designer. The payoff is the probability of error of the detector, which the detector designer tries to minimize and the deceptive signal designer to maximize. For this detection game, saddle point solutions-whenever possible-or otherwise maximin and minimax solutions are derived under three distinct constraints on the deceptive signal power; these distinct constraints involve lower bounds on (i) the signal amplitude, (ii) the time-averaged power, and (iii) the expected power. The cases of independent and identically distributed and correlated signals are considered

Published in:

IEEE Transactions on Information Theory  (Volume:40 ,  Issue: 3 )