Huffman decoder

• US 5,784,631 A
• Filed: 06/16/1995
• Issued: 07/21/1998
• Est. Priority Date: 06/30/1992
• Status: Expired due to Term

• Current Assignee: Coases Investments Bros LLC (Intellectual Ventures LLC)
• Original Assignee: Discovision Associates (Pioneer Corporation)
• Inventors: Wise, Adrian Philip
• Primary Examiner(s): Harrity, John E.
• Application Number:
  US08/400,072
• Time in Patent Office: 1,131 Days
• Field of Search: 395/800, 395/375, 395/500, 341/65, 358/261.1, 364/239.3, 364/DIG. 1, 382/246
• US Class Current: 382/246
• CPC Class Codes: G06F 12/0207 with multidimensional access, e.g. row/column, matrix
• CPC Class Codes: G06F 12/04 Addressing variable-length words or parts of words
• CPC Class Codes: G06F 12/0607 Interleaved addressing
• CPC Class Codes: G06F 13/16 for access to memory bus G06F13/28 takes precedence
• CPC Class Codes: G06F 13/1673 using buffers
• CPC Class Codes: G06F 13/1689 Synchronisation and timing concerns synchronisation on a memory bus G06F13/4234
• CPC Class Codes: G06F 13/28 using burst mode transfer, e.g. direct memory access DMA, cycle steal G06F13/32 takes precedence
• CPC Class Codes: G06F 9/3867 using instruction pipelines
• CPC Class Codes: G06F 9/4494 data driven
• CPC Class Codes: H04N 19/13 Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
• CPC Class Codes: H04N 19/42 characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation H04N19/635 takes precedence
• CPC Class Codes: H04N 19/423 characterised by memory arrangements H04N19/433 takes precedence
• CPC Class Codes: H04N 19/61 in combination with predictive coding
• CPC Class Codes: H04N 19/91 Entropy coding, e.g. variable length coding [VLC] or arithmetic coding

Abstract

A multi-standard video decompression apparatus has a plurality of stages interconnected by a two-wire interface arranged as a pipeline processing machine. Control tokens and DATA Tokens pass over the single two-wire interface for carrying both control and data in token format. The apparatus includes a Huffman decoder for decoding data words encoded according to the Huffman coding provisions of either H.261, JPEG or MPEG standards. Data words in the tokens include an identifier that identifies the Huffman code standard under which the data words were coded. The Huffman decoder responds to the identifier and converts the received data words to JPEG Huffman coded data words. An index number into a lookup table is associated with each JPEG Huffman coded data word, and a decoded data word is generated corresponding to the index number.

Claims

1. 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.

2. 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.

3. 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.

4. 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.