Patent US5300931A successfully refreshed from Google Patents.
US5300931A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Memory based vector quantization
Assignee: Unisys Corp
•
Filing: 1987-09-04
•
Granted: 1994-04-05
•
Expires: 2007-09-04
Abstract
Abstract Apparatus is provided for performing two stages of high-speed compression of vector data inputs. Two input channels of vector data are compressed and encoded through a vector quantizer encoder to provide a first stage of data compression. The output of the first encoder is further decoded then compressed and encoded in a novel high-speed computing mapping means which may be implemented in the form of a look-up table. Vector quantized encoded output is double the previous data compression of a single stage. The second stage of data compression causes very little degradation of the data from the first stage of data compression.
Inventors
- 👤 Robert A. Lindsay
- 👤 Patrick S. Grant
- 👤 Val D. Vaughn
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 14:38
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/3082; G; G06; G06T; G06T9/00; G06T9/008
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
103 words
Apparatus for high-speed compression of vector data inputs comprising: means for storing groups of scalar data, means for formatting said groups of scalar data into a plurality of vector dimensional data inputs coupled to said means for storing groups of scalar data, first encoder means for vector quantizing said plurality of vector data inputs to provide a plurality of compressed encoded index data outputs, said compressed encoded index data outputs providing a unique index pointer output, and means for computing mapping of data on said compressed encoded index data outputs to provide a compressed compressed output coupled to said unique index pointer output.
Claim 2
Dependent Claim
103 words
Apparatus for high-speed compression of vector data inputs comprising: means for storing groups of scalar data, means for formatting said groups of scalar data into a plurality of vector dimensional data inputs coupled to said means for storing groups of scalar data, first encoder means for vector quantizing said plurality of vector data inputs to provide a plurality of compressed encoded index data outputs, said compressed encoded index data outputs providing a unique index pointer output, and means for computing mapping of data on said compressed encoded index data outputs to provide a compressed compressed output coupled to said unique index pointer output.
Claim 3
Dependent Claim
17 words
Apparatus as set for in claim 1 wherein said means for computing mapping comprises a look-up table.
Claim 4
Dependent Claim
30 words
Apparatus as set forth in claim 2 wherein said look-up table comprises a memory having up to 2 20 unique possible address inputs for producing up to 2 4 outputs.
Claim 5
Dependent Claim
23 words
Apparatus as set forth in claim 2 wherein said look-up table comprises a precomputed mapping of index information representations of vector quantized values.
Claim 6
Dependent Claim
36 words
Apparatus as set forth in claim 1 wherein said means for computing mapping comprises vector quantizing decoding means coupled to said first encoder means, and second encoder means for quantizing the output of said decoder means.
Claim 7
Dependent Claim
16 words
Apparatus as set forth in claim 5 wherein said decoder means comprises a memory look-up table.
Claim 8
Dependent Claim
16 words
Apparatus as set forth in claim 6 wherein said second encoder means comprises VHSIC gate arrays.
Claim 9
Dependent Claim
23 words
Apparatus as set forth in claim 1 wherein said means for storing groups of scalar data comprises memory means for storing digital data.
Claim 10
Dependent Claim
23 words
Apparatus as set forth in claim 1 wherein said groups of scalar data each defines a 2×2 matrix of individual image pixel data.
Claim 11
Dependent Claim
19 words
Apparatus as set forth in claim 1 wherein said first encoder means comprises a pair of vector quantizing encoders.
Claim 12
Dependent Claim
21 words
Apparatus as set forth in claim 1 where said first encoder means comprises a plurality of pairs of vector quantizing encoders.
Claim 13
Dependent Claim
25 words
Apparatus as set forth in claim 1 wherein the plurality of outputs of said first encoder means are combined to form a unique index pointer.
Claim 14
Dependent Claim
55 words
Apparatus as set forth in claim 12 wherein said means for computing mapping comprises a precomputed map having as many address locations as there are unique addresses and each memory address location is provided with as many bits stored therein as there are bits in said pre-computed extended representative set output from said pre-computed map.
Claim 15
Dependent Claim
24 words
Apparatus as set forth in claim 1 which further includes a vector quantizer decoder coupled to the output of said means for computing mapping.
Claim 16
Dependent Claim
16 words
Apparatus as set forth in claim 14 wherein said vector quantizer decoder comprises a look-up table.
Claim 17
Dependent Claim
46 words
Apparatus as set forth in claim 1 wherein said means for computing mapping comprises a look-up table having a compressed compressed encoded index data output which is adapted to be coupled to a vector quantizing decoder having an extended vector space stored in memory locations therein.
Claim 18
Independent Claim
86 words
A method for high-speed compression of vector data comprising the steps of: storing groups of scalar data, formatting said groups of scalar data into a plurality of vector dimensional data inputs, vector quantize-encoding said plurality of vector data inputs to provide a compressed encoded index data output indicative of a unique index address, and addressing a pre-computed look-up table with said unique index address to provide a concatenated vector space representative vector index of said compressed encoded index thereby further compressing said compressed encoded index data.
Claim 19
Independent Claim
86 words
A method for high-speed compression of vector data comprising the steps of: storing groups of scalar data, formatting said groups of scalar data into a plurality of vector dimensional data inputs, vector quantize-encoding said plurality of vector data inputs to provide a compressed encoded index data output indicative of a unique index address, and addressing a pre-computed look-up table with said unique index address to provide a concatenated vector space representative vector index of said compressed encoded index thereby further compressing said compressed encoded index data.
References Cited (Backward Citations)
US4490786A
Cited
US4606069A
Cited
US4710812A
Cited
US4626829A
Cited
US4727354A
Cited
US4971407A
Cited
US4988998A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-04-04 | 1997-10-04 | 1998-04-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-04-04 | 2001-10-04 | 2002-04-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-04-04 | 2005-10-04 | 2006-04-05 | $7700.00 | Window Closed / Lapsed |