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
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Mar 7, 1995
Issued Date -
N/A
app pub date -
Apr 1, 1994
filing date -
Aug 10, 1990
priority date (Note) -
Expired
status (Latency Note)
Importance
Loading Importance Indicators... 
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).
Loading the Abstract Image...
OK
First Claim
Family
Loading Family data...
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully