Coded data generation or conversion – Digital code to digital code converters – To or from packed format
Reexamination Certificate
2000-05-22
2002-06-11
JeanPierre, Peguy (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
To or from packed format
C341S143000
Reexamination Certificate
active
06404356
ABSTRACT:
FIELD OF THE INVENTION
The field of the invention relates to information signals and more particularly to the compression of information signals.
BACKGROUND OF THE INVENTION
Methods of compressing data are known. While methods vary widely, the objective of each method is to reduce a volume of a file by reducing the number of information bits necessary to accurately represent the file. In the past, a number of methods have been developed to achieve this objective. One method reduces a file's volume by counting repeating bytes where ever they occur in a continuous sequence and representing the repeated bytes as simply the repeated byte followed by a number of instances of the repeated byte.
Other methods rely upon tables to re-arrange the meaning of bit sequences. Such tables are useful in the case where bit sequences frequently repeat, such as in text files.
Under these methods, a table is created and a table location (i.e., defined by the Cartesian coordinates) may be used to represent the contents of the location of the table. Further, the locations of the table may be ordered. The table locations may be identified by the smallest bit sequence necessary to precisely identify the location. Lower order locations require a lesser number of bits to precisely identify the location. Higher order locations require more bits to identify the location. For example, the first location may be given the identifier “0”. The second location may be given the identifier “1”, and the third “10”, and so on.
Under this method, the frequency of occurrence of the characters are measured. The character which is found to repeat the most frequently is placed in the lowest ordered location of the table. The next most frequently occurring character is placed next. Since the more frequently occurring characters require less bits to precisely identify the character, compression occurs by representing the character by a table location.
While table-based compression is effective in some cases, it is less effective in other cases where the data is random. Accordingly, a need exists for a compression method that can be used with or instead of table-based compression.
SUMMARY
A method and apparatus are provided for compressing data. The method includes the steps of determining a flux, scaling factor and sign of a difference between a new sample and a previous sample and encoding the difference of the new sample over the previous sample based upon the determined flux, scaling factor and sign of the new sample.
REFERENCES:
patent: 3562504 (1971-02-01), Harris
patent: 5652878 (1997-07-01), Craft
patent: 5780828 (1998-07-01), Mos et al.
patent: 6145069 (2000-11-01), Dye
Cennoid Technologies Inc.
Jean-Pierre Peguy
Lauture Joseph J
Welsh & Katz Ltd.
LandOfFree
Wave demodulation processor does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Wave demodulation processor, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Wave demodulation processor will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2942038