Length-limited huffman encoding
US10756758B1 · kind B1 · utility
4Cited by
5References
20Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Aug 30, 2019 |
| Grant date | Aug 25, 2020 |
| Priority date | — |
| Expiry date | Aug 30, 2039 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F9/5027
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
Various embodiments are provided for length-limited Huffman encoding in a data compression accelerator in a computing environment by a processor. Symbol counts of a plurality of symbols in compressed data may be normalized and manipulated according to a maximum code length limiting operation such that those of the plurality of symbols having a least frequent symbol count have a symbol count equal to a maximum code length of a Huffman tree.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.