MIMO radar and communication spectrum sharing with clutter mitigation
MIMO radar and communication spectrum sharing with clutter mitigation
复制标题
DOI：
10.1109/radar.2016.7485158
复制
发表时间：
2016-05
期刊：
影响因子：
--
通讯作者：
Bo Li;A. Petropulu
中科院分区：
文献类型：
--
作者：
Bo Li;A. Petropulu
我们解决了MIMO雷达和MIMO通信系统的共存。与以前的作品不同，我们考虑的情况下，雷达系统中存在的杂波。雷达和通信系统都使用发射预编码。最初，频谱共享被公式化为一个问题，最大化雷达SINR的通信系统满足一定的速率和功率约束。由于杂波对雷达预编码矩阵的依赖性，关于雷达预编码器的优化是在非凸可行集上的非凸函数的最大化。由于解决这样的问题是计算上棘手的，我们建议最大限度地降低SINR。在所得到的交替最大化问题中，通信TX协方差矩阵的交替迭代简化为一个SDP问题，而雷达预编码器的迭代由一系列SOCP问题求解，这比SDP更有效和更易处理。仿真结果验证了该方法在杂波环境下的有效性。
We address the co-existence of MIMO radars and a MIMO communication system. Unlike previous works, we consider a scenario in which the radar system operates in the presence of clutter. Both the radar and the communication system use transmit precoding. Initially, spectrum sharing is formulated as a problem that maximizes the radar SINR subject to the communication system meeting certain rate and power constraints. Due to the dependence of the clutter on the radar precoding matrix, the optimization with respect to the radar precoder is a maximization of a nonconvex function over a nonconvex feasible set. Since solving such problem is computationally intractable, we propose to maximize a lower bound of the SINR. In the resulting alternating maximization problem, the alternating iteration of the communication TX covariance matrix reduces to one SDP problem, while the iteration of the radar precoder is solved by a sequence of SOCP problems, which are more efficient and tractable than SDP. Simulation results validate the effectiveness of the proposed spectrum sharing method for scenarios with clutter.