Joint Waveform Optimization and Antenna Position Selection for MIMO Radar Beam Scanning

被引:0
|
作者
Fan W. [1 ]
Yu B. [1 ,2 ]
Chen J. [1 ]
Zhang H. [1 ,3 ]
Li C. [1 ]
机构
[1] 54th Research Institute of CETC, Shijiazhuang
[2] State Key Laboratory of Satellite Navigation System and Equipment Technology, Shijiazhuang
[3] School of Electronics and Information, Northwestern Polytechnical University, Xi’an
关键词
Alternating Direction Method of Multipliers (ADMM); Antenna selection; Lawson algorithm; Majorization-Minimization (MM); MIMO radar transmit beampattern; Peak-to-Average Power Ratio (PAPR); Sparse antenna array;
D O I
10.12000/JR22135
中图分类号
学科分类号
摘要
In this study, under the Peak-to-Average Power Ratio (PAPR), energy, and binary (for antenna position selection) constraints, we proposed an antenna position selection and beam scanning method for colocated Multiple-Input Multiple-Output (MIMO) radar system using the min-max beampattern amplitude matching criterion. In our design, antenna positions and a set of probing waveforms were jointly determined to match a set of beampattern masks, and hence realize the beam scan. The resultant problem was large-scale, nonconvex, nonsmooth, and typical nondeterministic hard, because of the PAPR and nonconvex binary constraints, and the max and modulus operations in the objective function. To address these issues, we first transformed the min-max problem into the Iterative weighted Least Squares (ILS) problem using the Lawson algorithm, replaced the nonsmooth nonconvex objective function with the convex majorization function, and finally applied the alternating direction method of multipliers to solve the majorized ILS problem. Finally, several numerical examples were given to show the effectiveness of the proposed algorithms. © 2022 Institute of Electronics Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码:530 / 542
页数:12
相关论文
共 53 条
  • [41] NAI S E, SER W, YU Zhuliang, Et al., Beampattern synthesis for linear and planar arrays with antenna selection by convex optimization[J], IEEE Transactions on Antennas and Propagation, 58, 12, pp. 3923-3930, (2010)
  • [42] LAWSON C., Contributions to the theory of linear least maximum approximation, (1961)
  • [43] RICE J, USOW K., The Lawson algorithm and extensions[J], Mathematics of Computation, 22, 101, pp. 118-127, (1968)
  • [44] ELLACITT S, WILLIAMS J., Linear Chebyshev approximation in the complex plane using Lawson’s algorithm[J], Mathematics of Computation, 30, 133, pp. 35-44, (1976)
  • [45] WANG Yu, YIN Wotao, ZENG Jinshan, Global convergence of ADMM in nonconvex nonsmooth optimization[J], Journal of Scientific Computing, 78, 1, pp. 29-63, (2019)
  • [46] HONG Mingyi, LUO Zhiquan, RAZAVIYAYN M., Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems[J], SIAM Journal on Optimization, 26, 1, pp. 337-364, (2016)
  • [47] BOYD S, PARIKH N, CHU E, Et al., Distributed optimization and statistical learning via the alternating direction method of multipliers[J], Foundations and Trends® in Machine Learning, 3, 1, pp. 1-122, (2011)
  • [48] FAN Wen, LIANG Junli, FAN Xuhui, Et al., A unified sparse array design framework for beampattern Synthesis, Signal Processing, 182, (2021)
  • [49] SUN Ying, BABU P, PALOMAR D P., Majorizationminimization algorithms in signal processing, communications, and machine learning[J], IEEE Transactions on Signal Processing, 65, 3, pp. 794-816, (2017)
  • [50] RAZAVIYAYN M, HONG Mingyi, LUO Zhiquan, A unified convergence analysis of block successive minimization methods for nonsmooth optimization[J], SIAM Journal on Optimization, 23, 2, pp. 1126-1153, (2013)