By Topic

Design of Phase Codes for Radar Performance Optimization With a Similarity Constraint

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
De Maio, Antonio ; Dipt. di Ing. Elettron. e delle Telecomun., Univ. degli Studi di Napoli Federico II, Naples ; De Nicola, S. ; Huang, Yongwei ; Zhi-Quan Luo
more authors

This paper deals with the design of coded waveforms which optimize radar performances in the presence of colored Gaussian disturbance. We focus on the class of phase coded pulse trains and determine the radar code which approximately maximizes the detection performance under a similarity constraint with a prefixed radar code. This is tantamount to forcing a similarity between the ambiguity functions of the devised waveform and of the pulse train encoded with the prefixed sequence. We consider the cases of both continuous and finite phase alphabet, and formulate the code design in terms of a nonconvex, NP-hard quadratic optimization problem. In order to approximate the optimal solutions, we propose techniques (with polynomial computational complexity) based on the method of semidefinite program (SDP) relaxation and randomization. Moreover, we also derive approximation bounds yielding a ldquomeasure of goodnessrdquo of the devised algorithms. At the analysis stage, we assess the performance of the new encoding techniques both in terms of detection performance and ambiguity function, under different choices for the similarity parameter. We also show that the new algorithms achieve an accurate approximation of the optimal solution with a modest number of randomizations.

Published in:

Signal Processing, IEEE Transactions on  (Volume:57 ,  Issue: 2 )