基于时分同步的码分多址技术的网络邻区规划覆盖强度准则算法

The CSD Algorithm for Neighbor Cell List Planning in TD-SCDMA

高质量的邻区规划是保障蜂窝移动通信系统顺利进行快速越区切换的基本条件,其算法主要基于地理信息准则和基于覆盖强度准则(CSD)两大类.针对时分同步的码分多址技术(TD-SCDMA)网络的技术特点,提出了一种将两大准则相结合的CSD算法.该算法首先根据小区间距离与天线朝向进行邻区筛选,以缩小邻区筛选范围,然后再依据信号覆盖强度,更精确地选出邻区,最终形成邻区规划列表.仿真表明,本算法的规划结果与现网邻区规划相吻合,并大幅提高了算法效率,具有良好的算法性能,符合实际网络规划需求.

Neighbor cell list planning plays an important role in mobile network planning. Neighbor eell list planning algorithms canbe divided into two classifications. One is based on the path loss or the received signal strength,and the other is based on the effective coverage distance. In this paper, according to the features of TD-SCDMA system, we propose CSD （coverage-strength decision-making） algorithm which combines the two principles that described above. In first step the neighbor cell is chose according to the coverage of the cells. In next step the signal strength of sampling dots is calculated based on the chose neighbor cell. The cells that match predetermining conditions are chose and comprised the neighbor cell list. The simulation shows that this algorithm achieves good performance and it is in line with the actual network planning.