基于测量报告的移动终端定位算法分析-analysis of mobile terminal location algorithm based on measurement report.docxVIP

优秀毕业论文 精品参考文献资料 trols of the cells were opened. Based on the filed measurements, this paper compares the performances of proximity algorithms CI, CI-AVG, CI-RXLEV and CI-ANGLE firstly. The experiment shows that the simplest algorithm CI achieves the highest accuracy, and the position error of CI-RXLEV which utilizes the most parameters is inaccurate due to the neighbor record matching to cell parameters database and complex terrains. So we advance two suggestions and the position- ing accuracy is enhanced at 47%. Based on the results of CI-RXEV enhancements (CRE), extended Kalman filter (EKF) is also analysized. The measurement equation sets is contructed by the linear operations of Okumura-Hata, and the 0-order minor is approximated. The experiment shows that EKF could achieve more accurate positions due to the NLOS environments and slow convergence of Taylor series. It ask for more available information to reduce error. Then we compare the time series operation methods moving average and vector Kalman filter. Due to the big noise power of measurements, Kalman filter also doesn’t take advantages in this comparison. Based on the results of time series operation, this paper considers to utilize the parameters of CRE algorithm for estimating its positioning error. The statistics of the parameters are cal- culated and fused as a estimator. The experiment results show that the estimator could fit the big-error ones, but couldn’t distinguish the small-errors kindly. This paper also suggests a notion of virtual antenna. The virtual antenna is defined for combing parameters of the cells which belong to the same Node B for accuracy enhancement. It’s based on not only the objective MR but also the MRs generated nearby the object. The received signal level of virtual antenna is defined for more available weight used in CI-RXLEV-E estimation, and the azimuth of virtual antenna is defined for indicating UE di- rection more accurately. Then a step-by-step rotation algorithm is