An assembly and method for binary tree-searched vector quantisation data compression processing

摘要

Data compression processing is carried out using binary Tree-Searched Vector Quantisation in which the direction of branching at each node of the tree is decided by comparison of an input vector (6) with a single code vector (B(n)) and an associated Scalar value (A).