.png){kind=icon}
.png){kind=icon}
Return
Generating dithering noise for maximum likelihood estimation from quantized data
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2012.11.028.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Quantization Theorem I (QT I) implies that the likelihood function can be reconstructed from quantized sensor observations, given that appropriate dithering noise is added before quantization. We present constructive algorithms to generate such dithering noise. The application to maximum likelihood estimation (MLE) is studied in particular. In short, dithering has the same role for amplitude quantization as an anti-alias filter has for sampling, in that it enables perfect reconstruction of the dithered but unquantized signal's likelihood function. Without dithering, the likelihood function suffers from a kind of aliasing expressed as a counterpart to Poisson's summation formula which makes the exact MLE intractable to compute. With dithering, it is demonstrated that standard MLE algorithms can be re-used on a smoothed likelihood function of the original signal, and statistically efficiency is obtained. The implication of dithering to the Cramer-Rao Lower Bound (CRLB) is studied, and illustrative examples are provided. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Maximum likelihood
Estimation
Quantization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.