This study deals with adaptive detection of a signal with unknown complex amplitude and whose steering vector presents angle uncertainties. The background environment is assumed homogeneous and Gaussian with unknown covariance matrix. At the design stage, the authors devise a class of robust receivers accounting for the aforementioned uncertainty. To this end, the authors prove that the maximisation of the concentrated likelihood function over the phase parameter shares a hidden convexity property. Specifically, exploiting some recent results concerning trigonometric polynomials, the authors formulate the apparently non-convex maximisation over the phase as a semidefinite programming (SDP) convex optimisation problem. Then, the authors show that the receivers of the class (but for one) exhibit a bounded-constant false alarm rate (bounded-CFAR) behaviour and derive lower and upper bounds for both the false alarm and the detection performance. At the analysis stage, the authors assess the performance of the new receivers in comparison with some classic detectors available in open literature.
Adaptive detection of a signal with angle uncertainty / DE MAIO, Antonio; S., De Nicola; A., Farina; S., Iommelli. - In: IET RADAR, SONAR & NAVIGATION. - ISSN 1751-8784. - ELETTRONICO. - 4:(2010), pp. 537-547. [10.1049/iet-rsn.2009.0106]
Adaptive detection of a signal with angle uncertainty
DE MAIO, ANTONIO;
2010
Abstract
This study deals with adaptive detection of a signal with unknown complex amplitude and whose steering vector presents angle uncertainties. The background environment is assumed homogeneous and Gaussian with unknown covariance matrix. At the design stage, the authors devise a class of robust receivers accounting for the aforementioned uncertainty. To this end, the authors prove that the maximisation of the concentrated likelihood function over the phase parameter shares a hidden convexity property. Specifically, exploiting some recent results concerning trigonometric polynomials, the authors formulate the apparently non-convex maximisation over the phase as a semidefinite programming (SDP) convex optimisation problem. Then, the authors show that the receivers of the class (but for one) exhibit a bounded-constant false alarm rate (bounded-CFAR) behaviour and derive lower and upper bounds for both the false alarm and the detection performance. At the analysis stage, the authors assess the performance of the new receivers in comparison with some classic detectors available in open literature.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


