Rate adaptive huffman coding
First Claim
1. A method for compressing data, comprising the steps of:
- (a) quantizing an input vector by representing said input vector with a vector quantization (VQ) codevector selected from a VQ codebook partitioned into subsets, wherein each subset comprises codevectors and each one of said codevectors is stored at a corresponding address in said VQ codebook;
(b) generating a rate dependent Huffman codeword for the selected codevector, wherein said rate dependent Huffman codeword identifies the subset of said VQ codebook in which the selected codevector is stored; and
(c) generating a substantially rate independent Huffman codeword for the selected codevector, wherein said substantially rate independent Huffman codeword identifies a particular VQ codevector within the subset identified by said rate dependent Huffman codeword.
3 Assignments
0 Petitions
Accused Products
Abstract
Methods for compressing data in a system employing vector quantization (VQ) and Huffman coding comprise: First, quantizing an input vector by representing the input vector with a VQ codevector selected from a VQ codebook partitioned into subsets, wherein each subset comprises codevectors and each codevector is stored at a corresponding address in the VQ codebook. Next, generating a rate dependent Huffman codeword for the selected codevector, wherein the rate dependent Huffman codeword identifies the subset of the VQ codebook in which the selected codevector is stored. And finally, generating a substantially rate independent Huffman codeword for the selected codevector, wherein the substantially rate independent Huffman codeword identifies a particular VQ codevector within the subset identified by the rate dependent Huffman codeword.
81 Citations
12 Claims
-
1. A method for compressing data, comprising the steps of:
-
(a) quantizing an input vector by representing said input vector with a vector quantization (VQ) codevector selected from a VQ codebook partitioned into subsets, wherein each subset comprises codevectors and each one of said codevectors is stored at a corresponding address in said VQ codebook; (b) generating a rate dependent Huffman codeword for the selected codevector, wherein said rate dependent Huffman codeword identifies the subset of said VQ codebook in which the selected codevector is stored; and (c) generating a substantially rate independent Huffman codeword for the selected codevector, wherein said substantially rate independent Huffman codeword identifies a particular VQ codevector within the subset identified by said rate dependent Huffman codeword. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A system for compressing data, comprising:
-
(a) a vector quantization (V Q) codebook partitioned into subsets, wherein each subset comprises codevectors and each one of said codevectors is stored at a corresponding address in said VQ codebook; (b) means for quantizing an input vector by representing said input vector with a VQ codeword determined on the basis of a VQ codevector selected from said VQ codebook; (c) means for generating a rate dependent Huffman codeword for the selected VQ codevector, wherein said rate dependent Huffman codeword identifies the subset of said VQ codebook in which the selected codevector is stored; and (d) means for generating a substantially rate independent Huffman codeword for the selected codevector, wherein said substantially rate independent Huffman codeword identifies a particular VQ codevector within the subset identified by said rate dependent Huffman codeword. - View Dependent Claims (8, 9, 10, 11, 12)
-
Specification