Line Spectrum Pairs (LSP) are commonly used in speech coding for spectral quantization. Usually, the LSPs are first calculated, and then quantized. When scalar quantization is used, computational saving can be achieved by direct calculation of the quantized LSPs, searching zero-crossings on the grid formed by the values of the quantization tables (quantized-domain search). In a previous publica...

This paper is concerned with the stabilizability problem for discrete–time linear systems subject to a uniform quantization of the control set and to a regular state quantization, both fixed a priori. As it is well known, for quantized systems only weak (practical) stability properties can be achieved. Therefore, we focus on the existence and construction of quantized controllers capable of ste...

In this paper, we propose a new feature descriptor, named local mesh quantized extrema patterns (LMeQEP) for image indexing and retrieval. The standard local quantized patterns collect the spatial relationship in the form of larger or deeper texture pattern based on the relative variations in the gray values of center pixel and its neighbors. Directional local extrema patterns explore the direc...

We compute the center in case q is a primitive root of unity. 1. Introduction Let F be a eld of characteristic zero. There are several ways to quantize the matrix algebra M n (F). Among them, the most common is probably the algebra introduced by Faddeev, Reshetikhin, and Takhtajan in 4]. Denote that algebra by M n (q). In 3] Dipper and Donkin deened another quantized matrix algebra which has ma...