Maximum Likelihood Time Delay Estimation Based on Monte Carlo Importance Sampling in Multipath Environment
In multipath environment, the computation complexity of single snapshot maximum likelihood for time delay estimation is huge. In particular, the computational complexity of grid search method increases exponentially with the increase of dimension. For this reason, this paper presents a maximum likel...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-01-01
|
| Series: | International Journal of Antennas and Propagation |
| Online Access: | http://dx.doi.org/10.1155/2017/4215293 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In multipath environment, the computation complexity of single snapshot maximum likelihood for time delay estimation is huge. In particular, the computational complexity of grid search method increases exponentially with the increase of dimension. For this reason, this paper presents a maximum likelihood estimation algorithm based on Monte Carlo importance sampling technique. Firstly, the algorithm takes advantage of the channel frequency response in order to build the likelihood function of time delay in multipath environment. The pseudoprobability density function is constructed by using exponential likelihood function. Then, it is crucial to choose the importance function. According to the characteristic of the Vandermonde matrix in likelihood function, the product of the conjugate transpose Vandermonde matrix and itself is approximated by the product of a constant and an identity matrix. The pseudoprobability density function can be decomposed into product of many probability density functions of single path time delay. The importance function is constructed. Finally, according to probability density function of multipath time delay decomposed by importance function, the time delay of the multipath is sampled by Monte Carlo method. The time delay is estimated via calculating weighted mean of sample. Simulation results show that the performance of proposed algorithm approaches the Cramér-Rao bound with reduced complexity. |
|---|---|
| ISSN: | 1687-5869 1687-5877 |