Array Design Based on the Worst-Case Cramér-Rao Bound to Account for Multiple Targets
conference paper
Sensor selection is a useful method to help reduce computational, hardware, and power requirements while maintaining acceptable performance. Although minimizing the Cramér-Rao bound has been adopted previously for sparse sensing, it did not consider multiple targets and unknown target directions. We propose to tackle the sensor selection problem for direction of arrival estimation using the worst-case Cramér Rao bound of two uncorrelated equal power sources on planar arrays. We cast the problem as a convex semi-definite program and retrieve the binary selection by randomized rounding. We illustrate the proposed method through numerical examples related to planar arrays. We show that our method selects a combination of edge and center elements, which contrasts with solutions obtained by minimizing the single-target Cramér-Rao bound.
TNO Identifier
991654
Source title
Proceedings Asilomar Conference on Signals, Systems, and Computers, Pacific Grove,USA October/November 2023
Files
To receive the publication files, please send an e-mail request to TNO Repository.