Coded data generation or conversion – Digital code to digital code converters – To or from number of pulses
Patent
1989-12-28
1991-04-23
Pellinen, A. D.
Coded data generation or conversion
Digital code to digital code converters
To or from number of pulses
341 67, 341 51, 341106, H03M 740
Patent
active
050103458
ABSTRACT:
Disclosed is a method of compressing a sequence of data symbols. The method includes the steps of sequentially appending symbols to a working substring to find the longest string that is duplicated in a history buffer or a lexicon. If the string is duplicated in the history buffer, then a history reference is emitted. If the string is duplicated in the lexicon, then a lexicon reference is emitted. If the string is not duplicated in either the history buffer or the lexicon, then a literal reference is emitted. The history buffer is a record of uncompressed data that has most recently been processed. The lexicon is a record of strings that has been emitted by means of history references.
REFERENCES:
patent: 4558302 (1985-12-01), Welch
patent: 4701745 (1987-10-01), Waterworth
patent: 4725815 (1988-02-01), Mitchell et al.
patent: 4876541 (1989-10-01), Storer
patent: 4881075 (1989-11-01), Wang
patent: 4899148 (1990-02-01), Sato et al.
patent: 4906991 (1990-03-01), Fiala et al.
Barksdale James H.
Hoff Marc S.
International Business Machines - Corporation
Jobe Jonathan E.
Pellinen A. D.
LandOfFree
Data compression method does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Data compression method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data compression method will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1623910