Quantization in ${H}^{ \infty}$ Parameter Identification
Lists
Only you see this
Abstract
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> We consider the design of quantizers for parameter identification under communication constraints. The objective is to find coarse quantization methods that achieve reasonable performance based on an <formula formulatype="inline"> <tex>${H}^{\infty}$</tex></formula> criterion. We make use of feedback in communication and show that the problem induces a class of quantizers similar to logarithmic ones. We then exhibit through examples that the proposed identifier is advantageous over a conventional prefiltering scheme, especially when quantization error is large. </para>
BibTeX
@article{ishii2008quantization,
author = {Hideaki Ishii and Tamer Başar},
title = {{Quantization in $\{H\}^\{ \textbackslash\{\}infty\}$ Parameter Identification}},
journal = {IEEE Transactions on Automatic Control},
year = {2008},
doi = {10.1109/tac.2008.930218},
}Loading related content...