Quantization in [H.sup.[infinity]] 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.sup.[infinity]] 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. Index Terms--[H.sub.[infinity]] synthesis, quantization, robust identification.