Design of Optimized Radar Codes With a Peak to Average Power Ratio Constraint

被引:191
作者
De Maio, Antonio [1 ]
Huang, Yongwei [2 ]
Piezzo, Marco [1 ]
Zhang, Shuzhong [3 ]
Farina, Alfonso [4 ]
机构
[1] Univ Naples Federico II, Dipartimento Ingn Biomed Elettron & Telecomunicaz, I-80125 Naples, Italy
[2] Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Shatin, Hong Kong, Peoples R China
[3] Univ Minnesota, Program Ind & Syst Engn, Minneapolis, MN 55455 USA
[4] SELEX Sistemi Integrati, I-00131 Rome, Italy
关键词
Approximation bound; nonconvex quadratic optimization; nonnegative trigonometric polynomials; radar waveform design; randomized algorithm; semidefinite programming relaxation; waveform diversity; IMPROVED APPROXIMATION ALGORITHMS; COMPLEX QUADRATIC OPTIMIZATION; SEMIDEFINITE RELAXATION; FORM; MAXIMIZATION; PERFORMANCE; CUT;
D O I
10.1109/TSP.2011.2128313
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper considers the problem of radar waveform design in the presence of colored Gaussian disturbance under a peak-to-average-power ratio (PAR) and an energy constraint. First of all, we focus on the selection of the radar signal optimizing the signal-to-noise ratio (SNR) in correspondence of a given expected target Doppler frequency (Algorithm 1). Then, through a max-min approach, we make robust the technique with respect to the received Doppler (Algorithm 2), namely we optimize the worst case SNR under the same constraints as in the previous problem. Since Algorithms 1 and 2 do not impose any condition on the waveform phase, we also devise their phase quantized versions (Algorithms 3 and 4, respectively), which force the waveform phase to lie within a finite alphabet. All the problems are formulated in terms of non-convex quadratic optimization programs with either a finite or an infinite number of quadratic constraints. We prove that these problems are NP-hard and, hence, introduce design techniques, relying on semidefinite programming (SDP) relaxation and randomization as well as on the theory of trigonometric polynomials, providing high-quality suboptimal solutions with a polynomial time computational complexity. Finally, we analyze the performance of the new waveform design algorithms in terms of detection performance and robustness with respect to Doppler shifts.
引用
收藏
页码:2683 / 2697
页数:15
相关论文
共 37 条
[1]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[2]  
[Anonymous], 1998, FUNDEMENTALS STAT SI
[3]   Waveform Diversity in Radar Signal Processing A focus on the use and control of degrees of freedom [J].
Calderbank, Robert ;
Howard, Stephen D. ;
Moran, Bill .
IEEE SIGNAL PROCESSING MAGAZINE, 2009, 26 (01) :32-41
[4]   Waveform Libraries Measures of effectiveness for radar scheduling [J].
Cochran, Douglas ;
Suvorova, Sofia ;
Howard, Stephen D. ;
Moran, Bill .
IEEE SIGNAL PROCESSING MAGAZINE, 2009, 26 (01) :12-21
[5]   Code Design to Optimize Radar Detection Performance Under Accuracy and Similarity Constraints [J].
De Maio, Antonio ;
De Nicola, Silvio ;
Huang, Yonwei ;
Zhang, Shuzhong ;
Farina, Alfonso .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (11) :5618-5629
[6]   A Doppler Robust Max-Min Approach to Radar Code Design [J].
De Maio, Antonio ;
Huang, Yongwei ;
Piezzo, Marco .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (09) :4943-4947
[7]   Code Design for Radar STAP via Optimization Theory [J].
De Maio, Antonio ;
De Nicola, Silvio ;
Huang, Yongwei ;
Palomar, Daniel P. ;
Zhang, Shuzhong ;
Farina, Alfonso .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (02) :679-694
[8]   Design of Phase Codes for Radar Performance Optimization With a Similarity Constraint [J].
De Maio, Antonio ;
De Nicola, Silvio ;
Huang, Yongwei ;
Luo, Zhi-Quan ;
Zhang, Shuzhong .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2009, 57 (02) :610-621
[9]  
FARINA A, 1991, MICROWAVE J, V34, P263
[10]  
Farina A, 2007, 3 INT WAV DIV DES C