Abstract

A binary distributed detection system comprises a bank of local decision makers (LDMs) and a central information processor or data fusion center (DFC). All LDMs survey a common volume for a binary {H/sub 0/, H/sub 1/} phenomenon. Each LDM forms a binary decision: it either accepts H/sub 1/ (target-present) or H/sub 0/ (target-absent). The LDM is fully characterized by its performance probabilities. The decisions are transmitted to the DFC through noiseless communication channels. The DFC then optimally combines the local decisions to obtain a global decision which minimizes a Bayesian objective function. The DFC remembers and uses its most recent decision in synthesizing each new decision. When operating in a stationary environment, our architecture converges to a steady-state decision LDM in finite time with probability one, and its detection performance during convergence and in steady state is strictly determined. Once convergence is proven, we apply the results to the detection of signals with random phase and amplitude. We further provide a geometric interpretation for the behaviour of the system.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.