Huffman tree decompression
US9787323B1 · kind B1 · utility
1Cited by
21References
20Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Mar 30, 2017 |
| Grant date | Oct 10, 2017 |
| Priority date | — |
| Expiry date | Mar 30, 2037 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M7/6011
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
To decompress encoded data, a Huffman code tree stored in a data header may need to be decompressed and rebuilt. A bit length histogram table is used in a hardware design to more efficiently decompress the Huffman code tree. The bit length histogram table relates each bit length used by the Canonical Huffman Code (CHC) symbols to a corresponding number of symbols in the encoding that have that bit length. Performing decompression using bit length histogram table allows part of the Huffman tree decompression to be performed in a single pass.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.