基于有向图的电磁环境复杂度度量算法  

Electromagnetic Environment Complexity Metrics Algorithm Based on Directed Graph

作　　者：张智南[1] 刘增良[1,2] 陶源[1] 屈兵超[2] 

机构地区：[1]北京科技大学信息工程学院,北京100083 [2]国防大学信息作战研究所,北京100091

出　　处：《电讯技术》2009年第6期1-4,共4页Telecommunication Engineering

基　　金：国家自然科学基金资助项目(60773127)

摘　　要：以用频装备接收机的信噪比参数和用频网络可用性作为度量依据,定义了用频网络的4级电磁环境复杂度度量标准。在此基础上,通过将用频网络转化成有向图,提出了基于有向图的电磁环境复杂度度量算法,并以此算法为基础定义了战场电磁环境复杂度。通过计算战场电磁环境复杂度使得当前战场电磁环境对作战行动的影响程度定量化,为复杂电磁环境条件下的战场决策提供必要条件。A four - degree electromagnetic environment complexity metrics algorithm of radio - used net- work is defined based on the SNR parameters of radio receiver and availability of the network. On this base, an electromagnetic environment complexity metrics algorithm based on directed graph is proposed. The algorithm transforms radio -used network into directed graph and determines the electromagnetic environment complexity degree by adjacency matrix of the directed graph. The electromagnetic environment complexity of battlefield is calculated based on the above algorithm. The impact of electromagnetic environment in battlefield on combat operations is quantified by the calculated result, so as to provide the necessary conditions for decision -making in the complex electromagnetic environment.

关 键 词：电磁环境 复杂度 度量算法 有向图 

分 类 号：TN97[电子电信—信号与信息处理]