Method of accelerating dynamic Huffman decompaction within the inflate algorithm
AssigneeInternational Business Machines Corporation
InventorsGiora Biran, Amit Golander, Shai I Tahar
Life of this patent
Estimating the term…
Abstract
A system and method of accelerating dynamic Huffman decompaction within the inflate algorithm. To improve the performance of a decompression engine during the inflate/decompression process, Huffman trees decompacted a priori are used thus eliminating the requirement of decompacting the DHT for each input stream. The Huffman tree in the input stream is matched prior to decompaction. If a match is found, the stored decompacted Huffman tree is used which reduces the required decompression time.
Claims7
A method of accelerating dynamic Huffman decompaction within an inflate process, said method comprising:
- receiving an input stream of compressed data;
- providing a bank of compacted and decompacted Huffman trees;
- matching the Huffman dictionary to know presets;
- if a match is found, loading the Huffman tree;
- and
- if a match is not found, decompacting the Huffman dictionary into a Huffman tree and decoding the compressed input stream using the Huffman tree from said bank.
Dependencies are inferred from the claim text.