自适应阵列天线区域覆盖算法研究  

Regional Coverage Algorithm Research of Adaptive Array Antenna

作　　者：蔡卫红[1] 刘军华[1] 雷超阳[1] 

机构地区：[1]长沙通信职业技术学院,长沙410015

出　　处：《湖南工程学院学报（自然科学版）》2012年第1期59-62,75,共5页Journal of Hunan Institute of Engineering(Natural Science Edition)

基　　金：湖南省自然科学基金资助项目(07D092)

摘　　要：文章分析了自适应阵列天线信号空间分割原理,介绍了自适应阵列天线区域资源传统分配算法:固定式区域资源分配算法和最大最小区域资源分配算法.针对自适应阵列天线区域资源传统分配算法存在的问题,提出了基于最小标准差的区域资源改进分配算法,并介绍了其区域资源分配原理和计算方法.通过对以上三种区域资源分配算法的通话阻塞率仿真可知,最小标准差区域资源分配算法相对于区域资源传统分配算法可降低通话阻塞率,负载平衡效果最好.This paper analyzes the space partitio theory of adaptive array antenna signals, introduces the traditional resource allocation algorithm of the adaptive array antenna area.resource fixed regional resource allocation algorithm and maximum and minimum regional resource allocation algorithm. Concerning prob- lems existing in the traditional resource allocation algorithm of the adaptive array antenna area, the alloca- tion algorithm for improvement of regional resources based on minimum standhrd deviation is put forward, and the principles of its regional resource allocation and calculation methods are introduced. Through simu- lation of call blocking rates for these three regional resource allocation algorithms, we can know that, the regional resource allocation algorithm of minimum standard deviation can reduce the call blocking rate com- pared with the traditional regional resource allocation algorithm, and the result in load balancing is best.

关 键 词：自适应阵列 天线 区域 算法 研究 

分 类 号：TN929.533[电子电信—通信与信息系统]