FDA antenna selection for localizing targets
(2024) In Signal Processing 216.- Abstract
In this paper, we propose a joint transmit and receive antenna selection scheme for frequency diverse array (FDA) radar that aims at finding an optimal selection of employed FDA antennas, formed by minimizing the Cramér–Rao lower bound (CRLB) of the target localization problem given the available a priori knowledge of potential target locations. The resulting problem is a non-convex Boolean problem in which the objective function is a quadratic objective function with respect to the optimization variables. To allow for an efficient solution, an iterative relaxed algorithm is proposed, substantially simplifying the resulting minimization. Numerical simulations are provided to demonstrate the effectiveness of the proposed approach.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/e5c877ea-ebb9-4e15-8b06-8db830254390
- author
- Jia, Wenkai ; Jakobsson, Andreas LU and Wang, Wen Qin
- organization
- publishing date
- 2024-03
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- Antenna selection, Boolean optimization, Cramér–Rao lower bound, Frequency diverse array
- in
- Signal Processing
- volume
- 216
- article number
- 109261
- publisher
- Elsevier
- external identifiers
-
- scopus:85172781506
- ISSN
- 0165-1684
- DOI
- 10.1016/j.sigpro.2023.109261
- language
- English
- LU publication?
- yes
- additional info
- Publisher Copyright: © 2023 Elsevier B.V.
- id
- e5c877ea-ebb9-4e15-8b06-8db830254390
- date added to LUP
- 2023-12-21 10:55:49
- date last changed
- 2024-02-09 10:39:14
@article{e5c877ea-ebb9-4e15-8b06-8db830254390, abstract = {{<p>In this paper, we propose a joint transmit and receive antenna selection scheme for frequency diverse array (FDA) radar that aims at finding an optimal selection of employed FDA antennas, formed by minimizing the Cramér–Rao lower bound (CRLB) of the target localization problem given the available a priori knowledge of potential target locations. The resulting problem is a non-convex Boolean problem in which the objective function is a quadratic objective function with respect to the optimization variables. To allow for an efficient solution, an iterative relaxed algorithm is proposed, substantially simplifying the resulting minimization. Numerical simulations are provided to demonstrate the effectiveness of the proposed approach.</p>}}, author = {{Jia, Wenkai and Jakobsson, Andreas and Wang, Wen Qin}}, issn = {{0165-1684}}, keywords = {{Antenna selection; Boolean optimization; Cramér–Rao lower bound; Frequency diverse array}}, language = {{eng}}, publisher = {{Elsevier}}, series = {{Signal Processing}}, title = {{FDA antenna selection for localizing targets}}, url = {{http://dx.doi.org/10.1016/j.sigpro.2023.109261}}, doi = {{10.1016/j.sigpro.2023.109261}}, volume = {{216}}, year = {{2024}}, }