Array Design Based on the Worst-Case Cramér-Rao Bound to Account for Multiple Targets

Conference Paper (2023)
Author(s)

Costas A. Kokke (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Mario Coutino (Netherlands Defence Academy)

Richard Heusdens (TU Delft - Electrical Engineering, Mathematics and Computer Science, Netherlands Defence Academy)

Geert Leus (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Research Group
Signal Processing Systems
DOI related publication
https://doi.org/10.1109/IEEECONF59524.2023.10476966 Final published version
More Info
expand_more
Publication Year
2023
Language
English
Research Group
Signal Processing Systems
Bibliographical Note
Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.
Pages (from-to)
1174-1178
Publisher
IEEE
ISBN (print)
979-8-3503-2575-1
ISBN (electronic)
979-8-3503-2574-4
Event
2023 Asilomar Conference on Signals, Systems, and Computers (2023-10-29 - 2023-11-01), Pacific Grove, United States
Page Views
259
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

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.

Files

Array_Design_Based_on_the_Wors... (pdf)
(pdf | 0.684 Mb)
- Embargo expired in 01-10-2024
License info not available