最小冗余MIMO雷达阵列设计

摘要

阵列天线的优化设计对降低系统成本、提高系统性能起着关键的作用.最小冗余阵因其能用较少的物理阵元形成较大的阵列孔径而备受关注,但是其阵元位置往往只能通过穷举法搜索得到,而穷举法的运算复杂度很高,因此不利于实际应用.针对这一不足,根据组合设计理论中的循环差集的基本原理,提出了一种基于循环差集的最小冗余MIMO雷达阵列设计算法.该算法利用最少的物理阵元能够得到更大的阵列孔径,并且能解析地求出发射阵元和接收阵元的位置,适用于任意大阵元数情形的阵列优化.仿真结果表明,该算法是一种有效的最小冗余MIMO雷达阵列优化算法.%The antenna array design plays an important role in reducing the system cost and improving its performance.For the advantage of forming larger array aperture with fewer physical antennas,the minimum redundancy array has received more and more attention.The exhaustive search algorithm is usually used to attain the antennas' location of minimum redundancy array.However,its high computational complexity prevents it from practical use.To overcome this shortcoming,according to the basic principle of cyclic difference sets (CDS) in combinatorial design theory,a new minimum redundancy MIMO radar array design algorithm based on CDS is proposed.The new method can form much larger array aperture with fewer antennas and provide analytical solutions for the antennas' location of transmit and receive array.At the same time,it can be applied to the array optimization with arbitrary large antenna number.The numerical results show that the proposed method is effective for minimum redundancy MIMO radar array design.