Deflate compression algorithm
US9577665B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Feb 12, 2016 |
| Grant date | Feb 21, 2017 |
| Priority date | — |
| Expiry date | Feb 12, 2036 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M7/40
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
A compression algorithm replaces duplicative strings with a copy pair indicating a location and length of a preceding identical string that is within a window from the duplicative string. Rather than a replacing a longest matching string within a window from a given point with a copy pair, the longest matching string may be used provide it is at least two bytes larger than the next longest matching string or is at a distance that is less than some multiple of a distance to the next longest matching string. In another aspect, the length of the window in which a matching string may be found is dependent on a length of the matching string. In yet another aspect, rather than labeling each literal and copy pair to indicate what it is, strings of non-duplicative literals are represented by a label and a length of the string.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.