PROCESSOR AND METHOD FOR COMPRESSING BINARY TREE SEARCH VECTOR QUANTIZED DATA

摘要

PURPOSE: To reduce needed throughput and/or storage capacity by providing a comparing device which compares an input vector with a single code vector and a relative scalar value and determines the direction of branching at each node of a binary tree. ;CONSTITUTION: A basic encoder has a vector storage device 5 which receives and stores an input sample 6 generating a vector, a vector code book storage device 7 which holds storage contents in the form of respective single code vectors B(n) and relative scalar values A, and a device 8 which compares the code vectors B(n) and scalar values A so as to determine the directions of branching at respective nodes of the binary tree. Preferably, the comparing device 8 is a computation unit which adds the internal product of the code vector of a specific node and an initial vector to the scalar value relating to the node, analyzes the addition result, and takes one branch of the binary tree when the result is negative or the other branch when the result is plus or 0.;COPYRIGHT: (C)1993,JPO