Recursive algorithms for parameter estimation with adaptive quantizer

Keyou You

doi:10.1016/j.automatica.2014.11.018

Return

Recursive algorithms for parameter estimation with adaptive quantizer

2015-02-01

PRE

游

游科友 (Keyou You) *

DOI：10.1016/j.automatica.2014.11.018

Original

Original request for help

Save

Abstract

En 中文

This paper studies a parameter estimation problem of networked linear systems with fixed-rate quantization. Under the minimum mean square error criterion, we propose a recursive estimator of stochastic approximation type, and derive a necessary and sufficient condition for its asymptotic unbiasedness. This motivates to design an adaptive quantizer for the estimator whose strong consistency, asymptotic unbiasedness, and asymptotic normality are rigorously proved. Using the Newton-based and averaging techniques, we obtain two accelerated recursive estimators with the fastest convergence speed of O(1/k), and exactly evaluate the quantization effect on the estimation accuracy. If the observation noise is Gaussian, an optimal quantizer and the accelerated estimators are co-designed to asymptotically approach the minimum Cramer-Rao lower bound. All the estimators share almost the same computational complexity as the gradient algorithms with un-quantized observations, and can be easily implemented. Finally, the theoretical results are validated by simulations. (C) 2014 Elsevier Ltd. All rights reserved.

Keywords:

Parameter estimation

Recursive algorithm

Quantization

Asymptotic analysis

Convergence speed

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.