FAST APPROXIMATE DYNAMIC HUFFMAN CODING WITH PERIODIC REGENERATION AND PRECOMPUTING
Patent №
US 7,796,059
Granted
2010-09-14
Filed 2009
Owner
TATU YLONEN OY
Lab
—
AI components
1
hardware
Assignment
Recorded
Dataset
AIPD
2023_r1 edition
Application
12354835
A fast data compression method approximating dynamic Huffman coding for applications with exteremely large data sets is disclosed. The method includes periodic regeneration of the Huffman coding tables and use of precomputed information to speed up encoding and decoding.
AI hardwareH03M 7/40
AI classification
AI hardware1.00
Machine learning0.07
Speech0.03
Vision0.01
Natural language0.00
Evolutionary computation0.00
Planning0.00
Knowledge representation0.00
Ownership
TATU YLONEN OY
assignment · 247370507
Assignors
YLONEN, TATU J.
On an employer assignment, the assignors are typically the inventors.
From the same owner
SPECIALIZING DISAMBIGUATION OF A NATURAL LANGUAGE EXPRESSIONUS 8,712,759 · 2014Semantic network clustering influenced by index omissionsUS 8,666,923 · 2014Garbage collector with concurrent flipping without read barrier and without verifying copyingUS 8,527,559 · 2013JOINT DISAMBIGUATION OF SYNTACTIC AND SEMANTIC AMBIGUITYUS 8,504,355 · 2013UTILIZING INFORMATION FROM GARBAGE COLLECTOR IN SERIALIZATION OF LARGE CYCLIC DATA STRUCTURESUS 8,396,904 · 2013SEMANTIC NETWORK WITH SELECTIVE INDEXINGUS 8,285,664 · 2012MONITORING WRITES USING THREAD-LOCAL WRITE BARRIER BUFFERS AND SOFT SYNCHRONIZATIONUS 8,280,866 · 2012SAVING SNAPSHOT OF A KNOWLEDGE BASE WITHOUT BLOCKINGUS 8,244,682 · 2012