Creating a dynamic Huffman table
US9584156B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Nov 17, 2015 |
| Grant date | Feb 28, 2017 |
| Priority date | — |
| Expiry date | Nov 17, 2035 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M7/42
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
Techniques for creating a dynamic Huffman table in hardware are provided. In one aspect, a method for encoding data includes the steps of: implementing dynamic Huffman tables in hardware representing a plurality of Huffman tree shapes precomputed from a sample data set, wherein the Huffman tree shapes are represented in the dynamic Huffman tables by code length values; upon receipt of input data, writing symbols and their counts from the input data to the dynamic Huffman tables; calculating a score for each of the dynamic Huffman tables with the symbols and counts from the input data, wherein the score is based on the code length values of the precomputed Huffman tree shapes and the counts from the input data and selecting a given one of the dynamic Huffman tables having a lowest score for encoding the input data. A process for implementing the present techniques in SRAM is also provided.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.