Invention Application
US20160092492A1 SHARING INITIAL DICTIONARIES AND HUFFMAN TREES BETWEEN MULTIPLE COMPRESSED BLOCKS IN LZ-BASED COMPRESSION ALGORITHMS
审中-公开
在基于LZ的压缩算法中共享多个压缩块之间的初始词典和胡乱曲线
- Patent Title: SHARING INITIAL DICTIONARIES AND HUFFMAN TREES BETWEEN MULTIPLE COMPRESSED BLOCKS IN LZ-BASED COMPRESSION ALGORITHMS
- Patent Title (中): 在基于LZ的压缩算法中共享多个压缩块之间的初始词典和胡乱曲线
-
Application No.: US14499148Application Date: 2014-09-27
-
Publication No.: US20160092492A1Publication Date: 2016-03-31
- Inventor: Michael ZIMMER , Richard SENIOR , Swaminathan SURESHCHANDRAN , Venkata Ramanan VENKATACHALAM JAYARAMAN
- Applicant: QUALCOMM Incorporated
- Main IPC: G06F17/30
- IPC: G06F17/30
Abstract:
A string of data is partitioned into a set of blocks. Each block is compressed based on a set of initial dictionaries and a set of Huffman trees. Each block is associated by a pointer with an initial dictionary in the set of initial dictionaries and a Huffman tree in the set of Huffman trees used to compress that block. A compressed string of data includes the set of initial dictionaries, the set of Huffman trees, and the compressed blocks and associated pointers.
Information query
