A Doppler robust max-min approach to radar code design

Authors:
Antonio De Maio;Yongwei Huang;Marco Piezzo
Affiliations:
Università degli Studi di Napoli "Federico II", Dipartimento di Ingegneria Biomedica Elettronica e delle Telecomunicazioni, Napoli, Italy;Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology, Kowloon, Hong Kong;Università degli Studi di Napoli "Federico II", Dipartimento di Ingegneria Biomedica Elettronica e delle Telecomunicazioni, Napoli, Italy
Venue:
IEEE Transactions on Signal Processing
Year:
2010

Citing 8
Cited 1

Convex Optimization

Convex Optimization
Discrete Transforms, Semidefinite Programming, and Sum-of-Squares Representations of Nonnegative Polynomials

SIAM Journal on Optimization
Positive Trigonometric Polynomials and Signal Processing Applications

Positive Trigonometric Polynomials and Signal Processing Applications
Complex Matrix Decomposition and Quadratic Programming

Mathematics of Operations Research
Design of phase codes for radar performance optimization with a similarity constraint

IEEE Transactions on Signal Processing
Code design for radar STAP via optimization theory

IEEE Transactions on Signal Processing
Code Design to Optimize Radar Detection Performance Under Accuracy and Similarity Constraints

IEEE Transactions on Signal Processing
Optimal transmit-receiver design in the presence of signal-dependent interference and channel noise

IEEE Transactions on Information Theory

Optimization of radar phase-coded signals for multiple target detection

Signal Processing

Quantified Score

Hi-index	35.68

Visualization

Abstract

This correspondence considers the problem of robust waveform design in the presence of colored Gaussian disturbance under a similarity and an energy constraint. We resort to a max-min approach, where the worst case detection performance (over the possible Doppler shifts) is optimized with respect to the radar waveform under the previously mentioned constraints. The resulting optimization problem is a non-convex Quadratically Constrained Quadratic Program (QCQP) with an infinite number of constraints, which is NP-hard in general and typically difficult to solve. Hence, we propose an algorithm with a polynomial computational complexity to generate a good sub-optimal solution for the aforementioned QCQP. The analysis, conducted in comparison with some known radar waveforms, shows that the sub-optimal solutions by the algorithm lead to high-quality radar signals.