由于现有的基于最大比合并MRC(Maximum Ratio Combination)的联合搜索定位算法实现复杂度高,为降低其计算复杂度,提出基于网格搜索的加权最大似然代价函数定位算法WMLGS(Weighted ML Grid Search Localization)。仿真结果表明:MRC和WMLG...由于现有的基于最大比合并MRC(Maximum Ratio Combination)的联合搜索定位算法实现复杂度高,为降低其计算复杂度,提出基于网格搜索的加权最大似然代价函数定位算法WMLGS(Weighted ML Grid Search Localization)。仿真结果表明:MRC和WMLGS算法的定位性能近似相等,在无地球表面约束条件下均优于单独时差或频差定位性能,并且逼近克拉美罗联合界,同MRC相比,WMLGS节省了一半左右的计算量,因此更具有实用价值。展开更多
To estimate the period of a periodic point process from noisy and incomplete observations, the classical periodogram algorithm is modified. The original periodogram algorithm yields an estimate by performing grid sear...To estimate the period of a periodic point process from noisy and incomplete observations, the classical periodogram algorithm is modified. The original periodogram algorithm yields an estimate by performing grid search of the peak of a spectrum, which is equivalent to the periodogram of the periodic point process, thus its performance is found to be sensitive to the chosen grid spacing. This paper derives a novel grid spacing formula, after finding a lower bound of the width of the spectral mainlobe. By employing this formula, the proposed new estimator can determine an appropriate grid spacing adaptively, and is able to yield approximate maximum likelihood estimate （MLE） with a computational complexity of O（n2）. Experimental results prove that the proposed estimator can achieve better trade-off between statistical accuracy and complexity, as compared to existing methods. Simulations also show that the derived grid spacing formula is also applicable to other estimators that operate similarly by grid search.展开更多
文摘由于现有的基于最大比合并MRC(Maximum Ratio Combination)的联合搜索定位算法实现复杂度高,为降低其计算复杂度,提出基于网格搜索的加权最大似然代价函数定位算法WMLGS(Weighted ML Grid Search Localization)。仿真结果表明:MRC和WMLGS算法的定位性能近似相等,在无地球表面约束条件下均优于单独时差或频差定位性能,并且逼近克拉美罗联合界,同MRC相比,WMLGS节省了一半左右的计算量,因此更具有实用价值。
基金supported by the National Natural Science Foundation of China (No. 61002026)
文摘To estimate the period of a periodic point process from noisy and incomplete observations, the classical periodogram algorithm is modified. The original periodogram algorithm yields an estimate by performing grid search of the peak of a spectrum, which is equivalent to the periodogram of the periodic point process, thus its performance is found to be sensitive to the chosen grid spacing. This paper derives a novel grid spacing formula, after finding a lower bound of the width of the spectral mainlobe. By employing this formula, the proposed new estimator can determine an appropriate grid spacing adaptively, and is able to yield approximate maximum likelihood estimate （MLE） with a computational complexity of O（n2）. Experimental results prove that the proposed estimator can achieve better trade-off between statistical accuracy and complexity, as compared to existing methods. Simulations also show that the derived grid spacing formula is also applicable to other estimators that operate similarly by grid search.
