Method of encoding and storing in a machine control computer a compressed data lookup table
AssigneeDelphi Technologies, Inc.
InventorRichard A Weaver
Life of this patent
Estimating the term…
Loading patent…
AssigneeDelphi Technologies, Inc.
InventorRichard A Weaver
Estimating the term…
A compressed data table is formed from an uncompressed data table by defining a code description bit structure having a code type and a run length of data items. The code type may be configured to identify byte-length data items, word-length data items and/or one or more user-specified data items. Each run of one or more byte-length, word-length or user-specified data items in the uncompressed data table is represented in the compressed data table with a code description bit structure having an appropriately configured code type and having its run length equal to the number of byte-length, word-length or user-specified data items in the run of one or more byte-length or word-length data items, and in the case of byte-length and word-length data items each code description bit structure is followed in the compressed data table by the one or more byte-length or word-length data items.
A method of compressing digital data from an uncompressed data lookup table into an encoded, addressable, compressed data lookup table and storing the compressed data lookup table in a memory of a machine control computer, the uncompressed data lookup table comprising a plurality of uncompressed numerical data items having a single predetermined uncompressed data bit length in a row/column structure and the machine control computer being programmed to perform data lookup procedures with specification of a row and column of the uncompressed data lookup table, the method comprising the steps:
Dependencies are inferred from the claim text.