Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
148 words
A Huffman decoder for decoding data words encoded according to the Huffman coding provisions of either H.261 or MPEG standards, the data words including an identifier that identifies the Huffman code standard under which the data words were coded, comprising: means for receiving the Huffman coded data words, including means for reading the identifier to determine which standard governed the Huffman coding of the received data words, and means for converting the data words to JPEG Huffman coded data words, in response to reading the identifier that identifies the Huffman coded data words as H.261 or MPEG Huffman coded; means, operably connected to the Huffman coded data words receiving means, for generating an index number associated with each JPEG Huffman coded data word receiving an index number from the index number generating means, and including an output that is a decoded data word corresponding to the index number.
Claim 2
Dependent Claim
148 words
A Huffman decoder for decoding data words encoded according to the Huffman coding provisions of either H.261 or MPEG standards, the data words including an identifier that identifies the Huffman code standard under which the data words were coded, comprising: means for receiving the Huffman coded data words, including means for reading the identifier to determine which standard governed the Huffman coding of the received data words, and means for converting the data words to JPEG Huffman coded data words, in response to reading the identifier that identifies the Huffman coded data words as H.261 or MPEG Huffman coded; means, operably connected to the Huffman coded data words receiving means, for generating an index number associated with each JPEG Huffman coded data word receiving an index number from the index number generating means, and including an output that is a decoded data word corresponding to the index number.
Claim 3
Dependent Claim
45 words
The decoder according to claim 1, wherein the Huffman coded data words are found in a token comprising a plurality of words and each said word includes an extension bit which indicates a presence of additional words therein; whereby the token is unlimited in length.
Claim 4
Independent Claim
157 words
A method for decoding data words encoded according to the Huffman coding provisions of either H.261 or MPEG standards, the data words including an identifier that identifies the Huffman code standard under which the data words were coded, the steps comprising: receiving the Huffman coded data words, the steps comprising: receiving the Huffman coded data words, including reading the identifier to determine which standard governed the Huffman coding of the received data words, and converting the data words to JPEG Huffman coded data words in response to reading the identifier that identifies the Huffman coded data words as H.261 or MPEG Huffman coded; generating an index number associated with each JPEG Huffman coded data word received; and operating a lookup table containing a Huffman code table having the format used under the JPEG standard to transmit JPEG Huffman table information, including receiving an index number, and generating a decoded data word corresponding to the received index number.
Claim 5
Independent Claim
157 words
A method for decoding data words encoded according to the Huffman coding provisions of either H.261 or MPEG standards, the data words including an identifier that identifies the Huffman code standard under which the data words were coded, the steps comprising: receiving the Huffman coded data words, the steps comprising: receiving the Huffman coded data words, including reading the identifier to determine which standard governed the Huffman coding of the received data words, and converting the data words to JPEG Huffman coded data words in response to reading the identifier that identifies the Huffman coded data words as H.261 or MPEG Huffman coded; generating an index number associated with each JPEG Huffman coded data word received; and operating a lookup table containing a Huffman code table having the format used under the JPEG standard to transmit JPEG Huffman table information, including receiving an index number, and generating a decoded data word corresponding to the received index number.
Claim 6
Dependent Claim
45 words
The method according to claim 3, wherein the Huffman coded data words are found in a token comprising a plurality of words and each said word includes an extension bit which indicates a presence of additional words therein; whereby the token is unlimited in length.