Determining prefix codes for pseudo-dynamic data compression utilizing clusters formed based on compression ratio
US9513813B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 18, 2015 |
| Grant date | Dec 6, 2016 |
| Priority date | — |
| Expiry date | Dec 18, 2035 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M7/4043
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
A set of K prefix codes for use in pseudo-dynamic compression are determined by seeding each of K clusters with a respective one of K data pages selected from a training data set, where K is a positive integer greater than 1. For each of the K randomly selected data pages, a prefix code is determined for its cluster utilizing Huffman encoding. Each remaining data page of the training data set is assigned to one of the K clusters whose prefix code yields the highest compression ratio. For each of the K clusters, the prefix code is updated by performing Lempel-Ziv (LZ) encoding on all pages assigned to that cluster, forming a sequence from results of the LZ encoding, and extracting an updated prefix code for the cluster from the sequence utilizing Huffman encoding. The set of K prefix codes determined for the K clusters is then output.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.