Data compression/decompression with aliasing error reduction

Claim 2

A source database compression method wherein the source database comprises a first plurality of data points each with a data value, the database compression method comprising the steps of: (a) assigning a unique index value to each unique value of the source database; (b) generating an index database comprising a second plurality of data corresponding to the first plurality of data points, wherein each second plurality of data points has a value equal to the index value associated with the corresponding data value; (c) generating a mode database for each unique value of the source database wherein the mode database contains the frequency of occurrence of each unique value of the source database; (d) initializing an accumulated error value to zero; (e) locating a least frequent element of the mode database with the smallest frequency of occurrence; (f) locating the closest element of the mode database to the least frequency element that minimizes the accumulated error wherein the minimum accumulated error is determined by adding the accumulated error value to the difference between the value of the least frequent element minus the value of the closest element; (g) adding the frequency value of the least frequent element to the frequency value of the closest element; (h) eliminating the least frequent element from the mode database; and (i) repeating steps (c) through (g) until the mode database contains no more than a predetermined number off elements.

Claim 3

The source database compression method of claim 1 wherein the source database is a terrain referenced navigation database of elevations for an array of latitudes and longitudes.

Claim 4

The source database compression method of claim 1 wherein the index database is further compressed with run length encoding to form a run length encoded database.

Claim 5

The source database compression method of claim 1 wherein the index database is further compressed by a method comprising the steps of: (a) defining a plurality of system state codes each representing a unique packing density; (b) writing a first element of the index database to a packed index database; (c) accessing a next element of the index database; (d) forming a difference between the last element and the next element; (e) determining a current optimum packing density based on the difference; (f) writing the system state code which represents the unique packing density which equals the current optimum packing density to the packed index database; (g) writing the difference to the packed index database in a packed form in accordance with the current optimum packing density; (h) accessing a next element of the indexed database; (i) forming the difference between the last element of the index database accessed and the next index database element; (j) determining a next optimum packing density based on the difference; (k) writing the system state code which represents the unique packing density equal to the current optimum packing density to the packed index database if the next optimum packing density is not equal to the current packing density; (l) writing the difference to the packed index database in a packed form; and (m) repeating steps (h) through (1) for all elements of the index database.

Claim 6

The source database compression method of claim 1 further comprising a decompression method comprising the steps of: (a) accessing the compressed database with the desired address to retrieve an index value; and (b) accessing the mode database with the index value to retrieve a decompressed data value.

Claim 7

The source database compression method of claim 4 further comprising a decompression method comprising the steps of: (a) reading a running index value from a first element of the packed index database; (b) accessing a next element of the packed index database; (c) determining whether or not the next element is a system state code or a packed index value; (d) changing the state of the decompression method to the corresponding packing density if the next element is a system state code; (e) unpacking the packed indexes from the next element if the next element is a packed index value and adding the unpacked indexes to the running index value; and (f) repeating steps (b) through (e) for all elements of the index database.

Claim 8

The source database compression method of claim 4 wherein a zero-byte flag is used in succession to signal a transition to a repetition count mode.

Claim 9

A source database compression apparatus wherein the source database comprises a first plurality of data points each with a data value, the database compression apparatus comprising: (a) means for assigning a uniform index value to each unique value of the source database; (b) means for generating an index database comprising a second plurality of data points corresponding to the first plurality of data points, wherein each second plurality of data points has a value equal to the index value associated with the corresponding data value; (c) means for generating a mode database for each unique value of the source database wherein the mode database contains the frequency of occurrence of each unique value of the source database; (d) means for initializing an accumulated error value to zero; (e) means for locating a least frequent element of the mode database with the smallest frequency of occurrence; (f) means for locating the closest element of the mode database to the least frequent element that minimizes the accumulated error; (g) means for adding the accumulated error value to the difference between the value of the least frequent element minus the value of the closest element to determine the minimum accumulated error; (h) means for adding the frequency value of the least frequent element to the frequency value of the closest element; and (i) means for eliminating the least frequent element from the mode database.

Claim 10

A source database compression apparatus wherein the source database comprises a first plurality of data points each with a data value, the database compression apparatus comprising: (a) means for assigning a uniform index value to each unique value of the source database; (b) means for generating an index database comprising a second plurality of data points corresponding to the first plurality of data points, wherein each second plurality of data points has a value equal to the index value associated with the corresponding data value; (c) means for generating a mode database for each unique value of the source database wherein the mode database contains the frequency of occurrence of each unique value of the source database; (d) means for initializing an accumulated error value to zero; (e) means for locating a least frequent element of the mode database with the smallest frequency of occurrence; (f) means for locating the closest element of the mode database to the least frequent element that minimizes the accumulated error; (g) means for adding the accumulated error value to the difference between the value of the least frequent element minus the value of the closest element to determine the minimum accumulated error; (h) means for adding the frequency value of the least frequent element to the frequency value of the closest element; and (i) means for eliminating the least frequent element from the mode database.

Claim 11

The source database compression apparatus of claim 8 wherein the source database is a terrain referenced navigation database of elevations for an array of latitudes and longitudes.

Claim 12

The source database compression apparatus of claim 8 wherein the index database is further compressed with run length encoding to form a run length encoded database.

Claim 13

The source database compression apparatus of claim 8 wherein the index database is further compressed by an apparatus comprising: (a) means for defining a plurality of system state codes each representing a unique packing density; (b) means for writing a first element of the index database to a packed index database; (c) means for accessing a next element of the index database; (d) means for forming a difference between the last element and the next element; (e) means for determining a current optimum packing density based on the difference; (f) means for writing the system state code which represents the unique packing density which equals the current optimum packing density to the packed index database; (g) means for writing the difference to the packed index database in a packed form in accordance with the current optimum packing density; (h) means for accessing a next element of the indexed database; (i) means for forming the difference between the last element of the index database accessed and the next index database element; (j) means for determining a next optimum packing density based on the difference; (k) means for writing the system state code to the packed index database, wherein the system state code represents the unique packing density equal to the current optimum packing density, and wherein the means for writing writes the system state code if the next optimum packing density is not equal to the current packing density; and (l) means for writing the difference to the packed index database in a packed form.

Claim 14

The source database compression apparatus of claim 8 further comprising a decompression apparatus comprising: (a) means for accessing the compressed database with the desired address to retrieve an index value; and (b) means for accessing the mode database with the index value to retrieve a decompressed data value.

Claim 15

The source database compression apparatus of claim 11 further comprising a decompression apparatus comprising: (a) means for reading a running index value from a first element of the packed index database; (b) means for accessing a next element of the packed index database; (c) means for determining whether or not the next element is a system state code or a packed index value; (d) means for changing the state of the decompression apparatus to the corresponding packing density if the next element is a system state code; (e) means for unpacking the packed indexes from the next element if the next element is a packed index value; and (f) means for adding the unpacked indexes to the running index value.

Claim 16

The source database compression apparatus of claim 11 wherein a zero-byte flag is used in succession to signal transition to a repetition count mode.

Claim 17

The source database compression method of claim 1 wherein the source database comprises digital data of a first predetermined bit length and the index database comprises digital data of a second predetermined bit length such that the second predetermined bit length is less then the first predetermined bit length.

Claim 18

The source database compression apparatus of claim 8 wherein the source database comprises digital data of a first predetermined bit length and the index database comprises digital data of a second predetermined bit length such that the second predetermined bit length is less then the first predetermined bit length.