深空网天线组阵相关算法分析-analysis of antenna array correlation algorithm in deep space network.docxVIP

摘要 随着人类对月球、火星等深空探测任务的逐步深入，信号的传输距离越来越 远，地面接收到的信号越来越弱，微弱信号的接收则成为深空测控通信的主要技 术难题之一。提高深空微弱信号接收信噪比的一种有效方法就是采用天线组阵技 术，其中，相关算法是深空网天线组阵技术的核心。因此，本文主要研究深空网 天线组阵中经典相关算法。 具体工作的主要内容如下： 首先，本文介绍了深空网天线组阵的背景，概述了深空网天线组阵技术的发 展史，总结了天线组阵的优缺点。然后，根据天线组阵的原理，理论分析了几种 经典的相关算法，并且介绍了非均匀天线阵列的相关算法。 其次，通过仿真实验分析了经典相关算法的性能，主要将 SUMPLE 算法和 Matrix-Free 算法的性能进行了对比。然后，研究了相关算法中的三个重要参数的 适应性，并且将非均匀天线阵列与均匀天线阵列进行了对比。 最后，设计了深空宽带天线组阵整体模型，用 MATLAB 软件中的 SIMULINK 仿真平台建立了仿真模型，并对模型的各个模块进行了介绍。通过仿真实验分析 了两个重要参数在宽带信号模型下的适应性，以及参数在非均匀宽带信号模型下 的适应性。 关键词:天线组阵 相关算法 非均匀天线阵列 SUMPLE 算法 Matrix-Free 算法 Abstract With the deeper space detection of the Moon, the Mars, and other planets, the transmitting distance of the signal has become much farther with the signal received on the earth getting much weaker. In this case, it is difficult to detect the signal, and therefore how to receive the weak signal becomes a key topic. One of the effective methods to improve the signal-to-noise ratio is adopting the antenna arraying. And the correlation algorithm is the core technology of the antenna arraying techniques in Deep Space Network. Therefore, the author mainly researches the correlation algorithms of the antenna arraying in Deep Space Network. The main contents of the dissertation are as follows: First of all, this dissertation introduces the background of antenna arraying in Deep Space Network, summarizes the development of antenna arraying techniques in Deep Space Network and also sums up the advantages of the antenna arraying from most aspects. Then, according to the principle of the antenna arraying techniques, several classic algorithms are analyzed in theory including those for uniform and non-uniform antenna arraying. Secondly, the performance of the classic correlation algorithms is analyzed by simulations where the performances of the SUMPLE algorithm and Matrix-Free algorithm are compared. Then, the author focuses on the adaptation of the three important parameters in the correlation algorithms, and compares the performance o