Code Design for Radar STAP via Optimization Theory

In this paper, we deal with the problem of constrained code optimization for radar space-time adaptive processing (STAP) in the presence of colored Gaussian disturbance. At the design stage, we devise a code design algorithm complying with the following optimality criterion: maximization of the dete...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing Vol. 58; no. 2; pp. 679 - 694
Main Authors: De Maio, A., De Nicola, S., Yongwei Huang, Palomar, D.P., Shuzhong Zhang, Farina, A.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.02.2010
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:1053-587X, 1941-0476
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we deal with the problem of constrained code optimization for radar space-time adaptive processing (STAP) in the presence of colored Gaussian disturbance. At the design stage, we devise a code design algorithm complying with the following optimality criterion: maximization of the detection performance under a control on the regions of achievable values for the temporal and spatial Doppler estimation accuracy, and on the degree of similarity with a pre-fixed radar code. The resulting quadratic optimization problem is solved resorting to a convex relaxation that belongs to the semidefinite program (SDP) class. An optimal solution of the initial problem is then constructed through a suitable rank-one decomposition of an optimal solution of the relaxed one. At the analysis stage, we assess the performance of the new algorithm both on simulated data and on the standard challenging the Knowledge-Aided Sensor Signal Processing and Expert Reasoning (KASSPER) datacube.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2009.2032993