通信卫星转发器备份环开关最短路径搜索算法研究

Research on Shortest Path Searching Algorithm for Switch Redundancy Ring of Communications Satellite Transponders

针对通信卫星装载转发器数量增长迅速的现状,提出了一种备份环开关最短路径搜索算法,以解决传统人工枚举法搜索路径效率低的问题。首先,建立备份环开关的数学模型,将通道、开关和功率放大器作为节点,射频电缆作为边,用邻接矩阵表示备份环开关节点间的连接关系。其次,采用动态规划的方法,对于每一对节点,寻找是否存在另一个节点使得新路径比已知路径更短,如果存在就更新当前的最短距离,通过迭代得到任意两节点间的最短距离,组成最短距离矩阵。最后,根据最短距离矩阵从终止节点出发反复寻找最短路径中的前一个节点,直至回到起始节点,将各节点逆序排列即为最短路径的通过顺序。仿真结果表明:该算法能够快速准确地找到最优方案,耗时少于人工搜索的1%,可以显著提高转发器测试设计的效率。

Considering the increase of the large scale of transponders in communications satellite,a shortest path searching method of switch redundancy ring is proposed to solve the problem of inefficient of the traditional manual enumeration.Fist,the mathematical model of switch redundancy ring is set up.The input channels,switches and power amplifiers are represented by nodes,the RF cables are represented by edges,and the connection inside switch redundancy ring is represented by an adjacency matrix.Then,for each pair of nodes,if there is another node that makes the distance shorter than any avaliable ones then the shorter distance is updated.The shortest distance of each pair of nodes is calculated by iteration,and forms the shortest distance matrix.Finally,the shortest distance matrix is used to search the nodes in the shortest path from the end node to the beginning one.Simulation results show that the method,which requires less than 1%of time consumption of manual enumeration,accurately and promptly find the optimized solution,and can be used in transponder verification to improve efficiency.