pith. sign in

arxiv: 1312.2183 · v1 · pith:PBLH4MIZnew · submitted 2013-12-08 · 💻 cs.IT · math.IT

Maximum Likelihood Estimation from Sign Measurements with Sensing Matrix Perturbation

classification 💻 cs.IT math.IT
keywords estimationmatrixperformanceperturbationproblemsensinganalysiscases
0
0 comments X
read the original abstract

The problem of estimating an unknown deterministic parameter vector from sign measurements with a perturbed sensing matrix is studied in this paper. We analyze the best achievable mean square error (MSE) performance by exploring the corresponding Cram\'{e}r-Rao Lower Bound (CRLB). To estimate the parameter, the maximum likelihood (ML) estimator is utilized and its consistency is proved. We show that the perturbation on the sensing matrix exacerbates the performance of ML estimator in most cases. However, suitable perturbation may improve the performance in some special cases. Then we reformulate the original ML estimation problem as a convex optimization problem, which can be solved efficiently. Furthermore, theoretical analysis implies that the perturbation-ignored estimation is a scaled version with the same direction of the ML estimation. Finally, numerical simulations are performed to validate our theoretical analysis.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.