Quantization in ${H}^{ \infty}$ Parameter Identification

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 H ^infin 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.