Methods of creating a dictionary for data compression
US8037034B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 23, 2007 |
| Grant date | Oct 11, 2011 |
| Priority date | — |
| Expiry date | Mar 29, 2028 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M7/3088
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
Some aspects of the invention provide methods, systems, and computer program products for creating a static dictionary in which longer byte-strings are preferred. To that end, in accordance with aspects of the present invention, a new heuristic is defined to replace the aforementioned frequency count metric used to record the number of times a particular node in a data tree is visited. The new heuristic is based on counting the number of times an end-node of a particular byte-string is visited, while not incrementing a count for nodes storing characters in the middle of the byte-string as often as each time such nodes are visited. The result is an occurrence count metric that favors longer byte-strings, by being biased towards not incrementing the respective occurrence count values for nodes storing characters in the middle of a byte-string.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.