基站自适应阵列天线码资源分配算法的比较研究  

Comparative Study of Code Resource Allocation Algorithms for Base Station Adaptive Array Antenna

作　　者：欧红玉 蔡卫红 孔凡凤 

机构地区：[1]湖南邮电职业技术学院移动通信系,湖南长沙410015

出　　处：《长沙大学学报》2014年第5期49-52,共4页Journal of Changsha University

基　　金：湖南省教育厅科学研究项目(批准号:12C0963)

摘　　要：采用空间切割方式对移动基站自适应阵列天线进行码资源分配,可以提高系统功率资源的使用效率,降低空中信号的整体干扰,从而提高系统容量.介绍了移动基站自适应阵列天线区域覆盖原理和码资源常见分配算法:固定码资源分配算法和群组码资源分配算法,分析了两种码资源分配算法的基本思路和码分配策略.通过两种分配算法的通话阻塞率仿真比较分析可知,群组码资源分配算法所产生的通话阻塞率比固定码资源分配算法所产生的通话阻塞率要低.Using spatial cutting to allocate the code resource of mobile base station adaptive array antenna can improve the system effi-ciency of power resources,reduce the overall air signal interference,and further expand the system capacity.This paper introduces a mobile base station adaptive array antenna coverage principle and common code resource allocation algorithms,which are fixed code re-source allocation algorithm and group code resource allocation algorithm,analyzes the basic ideas of two kinds of code resource alloca-tion algorithms and code allocation strategies.Through the comparative analysis of the call blocking rate simulation for the two allocation algorithms,it is indicated that the call blocking rate generated by group code resource allocation algorithm is lower than that generated by the fixed code resource allocation algorithm.

关 键 词：自适应阵列天线 码资源 分配算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]