×

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

  • US 5,396,625 A
  • Filed: 04/01/1994
  • Issued: 03/07/1995
  • Est. Priority Date: 08/10/1990
  • Status: Expired due to Fees
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.

View all claims
  • 0 Assignments
Timeline View
Assignment View
    ×
    ×