System for binary tree searched vector quantization data compression processing each tree node containing one vector and one scalar to compare with an input vector
First Claim
Patent Images
1. A binary Tree-Searched Vector Quantization data compression processing assembly comprising:
- a vector memory, for receiving and storing input samples forming an input vector;
a vector codebook memory, storing a plurality of entries, one of said entries for each of a plurality of nodes of a vector search tree, each of said nodes representing a branch point at which different directions, towards different nodes, are possible, each of said entries associated with a particular node and including a single quantized code vector of the same dimensionality as said input vector, and an associated single valued scalar;
a memory indexing element storing an address of a current node, addressing said vector codebook memory with said address, to obtain said single code vector and said associated single valued scalar for the current node; and
a computation unit, including comparing means for comparing the input vector with said single code vector for the current node and with said associated single valued scalar for the current node to determine a direction of branching at each node of the tree.
0 Assignments
0 Petitions
Accused Products
Abstract
Data compression processing is carried out using binary Tree-Searched Vector Quantization 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).
-
Citations
23 Claims
-
1. A binary Tree-Searched Vector Quantization data compression processing assembly comprising:
-
a vector memory, for receiving and storing input samples forming an input vector; a vector codebook memory, storing a plurality of entries, one of said entries for each of a plurality of nodes of a vector search tree, each of said nodes representing a branch point at which different directions, towards different nodes, are possible, each of said entries associated with a particular node and including a single quantized code vector of the same dimensionality as said input vector, and an associated single valued scalar; a memory indexing element storing an address of a current node, addressing said vector codebook memory with said address, to obtain said single code vector and said associated single valued scalar for the current node; and a computation unit, including comparing means for comparing the input vector with said single code vector for the current node and with said associated single valued scalar for the current node to determine a direction of branching at each node of the tree. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13)
-
-
12. An assembly according to claim i further comprising a level counter for accessing relevant areas of the Vector codebook memory which correspond to different levels of the Tree-Searched Vector Quantization.
-
14. A method of searching using Tree-Searched Vector Quantization data comprising the steps of:
-
receiving and storing input samples forming an input vector; holding entries for each of a plurality of nodes of a search tree in a codebook vector memory, each entry including a single quantised code vector and an associated single valued scalar; extracting from said codebook vector memory a single code vector and an associated single valued scalar for a root node of the tree; comparing the input vector with the single code vector for the root node and with the associated single valued scalar; choosing a direction of branching from the node vector for the root node based on results of the comparing step, to find another node of the tree; retrieving another code vector and another associated single valued scalar for said another node from said codebook vector memory; comparing the input vector with said another single code vector and with said another associated single valued scalar for said another node; using results of said comparing for said another node to determine a direction of branching said another node of the tree; and repeating said retrieving, comparing, and using steps until the input vector has been coded. - View Dependent Claims (15, 16, 17)
-
-
18. A binary Tree-Searched Vector Quantization data compression processing assembly comprising:
-
a vector memory, for receiving and storing input samples forming an input vector; a vector codebook memory, for storing a plurality of entries, each of said entries associated with a particular node of a search tree and including a single quantised code vector and an associated single valued scalar, a memory indexing element, storing an address of a current node, and addressing said vector codebook memory with said address, to obtain said single code vector and associated single valued scalar for the current node; and a computation unit, carrying out first computation which compare the input vector with said single code vector and carrying out second computation which compare said associated single valued scalar to another scalar value derived from a comparison of the input vector with said single code vector, to determine a direction of branching at each node of the tree. - View Dependent Claims (19, 20, 21, 22, 23)
-
Specification