System and method for compressing data
First Claim
1. A method for receiving a signal that includes canonical Huffman encoded data, the method comprising:
- performing a 2N-deep direct-index lookup using N bits from the canonical Huffman encoded data to extract high-frequency symbols and to provide bracketing indices for low-frequency symbols; and
performing a binary search bounded by the bracketing indices to extract the low-frequency symbols.
0 Assignments
0 Petitions
Accused Products
Abstract
Systems, devices and methods are provided to compress data, and in particular to code and decode data. One aspect of the present subject matter is a data structure. The data structure includes a field representing a decoding structure to decode canonical Huffman encoded data, and a field representing a symbol table. The decoding structure includes a field representing an accelerator table to provide a 2N-deep direct-index lookup to provide high-frequency symbols for high-frequency data and to provide bracketing indices for low-frequency data. The decoding structure also includes a field for a binary search table to provide a low-frequency symbol index using a binary search bounded by the bracketing indices provided by the accelerator table. The symbol table is adapted to provide a symbol associated with the low-frequency index.
75 Citations
36 Claims
-
1. A method for receiving a signal that includes canonical Huffman encoded data, the method comprising:
-
performing a 2N-deep direct-index lookup using N bits from the canonical Huffman encoded data to extract high-frequency symbols and to provide bracketing indices for low-frequency symbols; and
performing a binary search bounded by the bracketing indices to extract the low-frequency symbols. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer-readable medium having computer-executable instructions for performing a method for decoding canonical Huffman encoded data, the method comprising:
-
performing a 2N-deep direct-index lookup using N bits from the encoded data;
extracting a high frequency symbol from the encoded data based on the 2N-deep direct-index lookup;
identifying bracketing indices for a low-frequency symbol based on the 2N-deep direct-index lookup; and
performing a binary search bounded by the bracketing indices to extract the low-frequency symbol. - View Dependent Claims (10, 11, 12, 13)
-
-
14. A device, comprising:
-
means to perform a 2N-deep direct-index lookup using N bits from canonical Huffman encoded data to extract high-frequency symbols from the canonical Huffman encoded data and to provide bracketing indices for low-frequency symbols from the canonical Huffman encoded data; and
means to perform a binary search bounded by the bracketing indices to extract the low-frequency symbols from the canonical Huffman encoded data. - View Dependent Claims (15)
-
-
16. A device, comprising:
-
a processor; and
a memory connected to the processor, the memory including a field representing an accelerator table for use to perform a 2N-deep direct-index lookup of canonical Huffman encoded data to extract high-frequency symbols and to identify bracketing indices for low-frequency symbols, and a field representing a binary search table for use to perform a binary search of the data bounded by the bracketing indices. - View Dependent Claims (17, 18, 19, 20, 21)
-
-
22. A device, comprising:
-
a processor;
a memory connected to the processor, the memory including a field representing an accelerator table for use to perform a 2N-deep direct-index lookup of canonical Huffman encoded data to extract high-frequency symbols and to identify bracketing indices for low-frequency symbols, and a field representing a binary search table for use to perform a binary search of the data bounded by the bracketing indices;
a speaker connected to the processor; and
a cellular antenna and a cellular transceiver operably connected to the cellular antenna and to the processor, wherein the device is adapted to receive the canonical Huffman encoded data through the cellular antenna and the cellular transceiver using cellular communication technology. - View Dependent Claims (23, 24, 25, 26, 27, 28, 29, 30)
-
-
31. A personal digital assistant (PDA), comprising:
-
a processor;
a memory connected to the processor, the memory including a field representing an accelerator table for use to perform a 2N-deep direct-index lookup of canonical Huffman encoded data to extract high-frequency symbols and to identify bracketing indices for low-frequency symbols, and a field representing a binary search table for use to perform a binary search of the data bounded by the bracketing indices; and
a display screen connected to the processor to display a decoded representation of the canonical Huffman encoded data. - View Dependent Claims (32, 33, 34, 35, 36)
-
Specification