Abstract

Distributed sensor networks with multiple antenna arrays are widely utilized for radar detection systems. When observations of network nodes are correlated, an optimal copula-based fusion (termed CBF) rule is designed for correlated binary decisions under the Neyman–Pearson (NP) framework. However, the CBF rule needs to determine the weights of all decisions in combination. Therefore, the high computational complexity of the CBF rule is unavoidable as the number of nodes increases. In this paper, we propose a fast copula-based fusion (F-CBF) algorithm for a multi-node radar system. The correlation between node decisions is simplified at the fusion center (FC) by taking logarithms of the weighted sum of node decisions. Specifically, the node decisions are weighted by a constant associated with the number of nodes. Thus the proposed method does not need to exhaust the weights of all combinations. Simulation results demonstrate that the proposed algorithm can efficiently reduce computational complexity. The detection performance of the proposed F-CBF method is significantly better than the independent detection method, although it is slightly inferior to the CBF method.

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.