By Topic

Decentralized sequential detection

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)
H. R. Hashemi ; Univ. of Miami Sch. of Med., Coral Gables, FL, USA ; I. B. Rhodes

A class of decentralized sequential detection problems is investigated. Under appropriate independence assumptions, it is shown that at each time instant the optimal local strategies are given by threshold tests on the likelihood of ratios. Furthermore, local decisions depend not only on the present and past observations, but on the past local decision as well. That is, for each local processor a different threshold exists for every different sequence of past decisions. Examples, computational techniques, discussions of the difficulties at hand, and suggestions for further exploration of the problem are presented

Published in:

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