METHOD quick search in the codebook for vector quantization

摘要

FIELD: information technology.;SUBSTANCE: projections are constructed for each axis interval j-1 only for those Voronoy polygons whose projection intervals partially or completely overlap with the interval under investigation. Search is performed in form of transfers on tree branches. Successively for all axes, an interval is determined, in which the input vector component falls, and the last interval determines a hyper-rectangular cell with the final set of candidate vectors. The transfer route determines the input vector, and the terminal node determines he final set of code candidate vectors.;EFFECT: reduced capacity of the required storage devices and reduced consumption of computing resources when performing fast search in a codebook with vector quantisation.;4 dwg