最大阵元利用率MIMO雷达阵列优化快速算法

摘要

针对MIMO雷达最大阵元利用率阵列结构优化算法中使用穷举搜索运算量太大的问题,提出了一种快速算法.该算法在只包含两个阵元的最优阵列基础上,通过迭代的方式向前一个最优阵列增加一个新阵元来寻找包含指定阵元数的最优阵列.文中对该算法的有效性进行了证明,并与穷举搜索方法做了复杂度比较.理论分析和仿真实验表明,该算法能够显著降低运算量,尤其在阵元数目较大时具有明显优势.并且,在阵元数一定的情况下,所得到的优化阵列与穷举搜索的结果具有等同的性能.%Due to the fact that the exhaustive search algorithm used in array optimization for MIMO radar based on maximum physical sensors efficiency concept is very time-consuming, a fast algorithm is accordingly proposed. On the basis of a fundamental optimized array with only two elements, the algorithm adds a new element to the previous optimized array in an iterative way to search for the intended array which has the required number of elements. The validity of the fast algorithm is demonstrated in the paper and its computational complexity compared with exhaustive search algorithm is also presented. Theoretical analysis and simulations both indicate that the new algorithm can tremendously reduce computational complexity, particularly when the number of physical sensors is large. Moreover, the performances of the new optimized arrays are equivalent to those obtained by exhaustive algorithm on the condition that the number of physical sensors is the same.