← Back to Patent Explorer
US5784631A Expired / Lapsed US ⏱️ 0.0 years remaining

Huffman decoder

Assignee: Chartoleaux KG LLC
•
Filing: 1995-03-07
•
Granted: 1998-07-21
•
Expires: 2015-03-07
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

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.

Inventors

  • 👤 Adrian Philip Wise

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-06 22:32
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/38; G06F9/3867; G06F12/00; G06F12/02; G06F12/0207; G06F12/04; G06F12/06; G06F12/0607; G06F13/00; G06F13/14; G06F13/16; G06F13/1668; G06F13/1673; G06F13/1689; G06F13/20; G06F13/28; G06F9/44; G06F9/448; G06F9/4494; H; H04; H04N; H04N19/00; H04N19/42; H04N19/423; H04N19/60; H04N19/61; H04N19/10; H04N19/102; H04N19/13; H04N19/90; H04N19/91

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.

References Cited (Backward Citations)

US3893042A Cited
US3962685A Cited
US4107780A Cited
US4142205A Cited
US4149242A Cited
US4228497A Cited
US4215369A Cited
US4196448A Cited
US4225920A Cited
US4302775A Cited
GB2045035B Cited
US4437072A Cited
GB2059724B Cited
US4334246A Cited
US4467409A Cited
US4433308A Cited
US4495629A Cited
US4809159A Cited
US4799677A Cited
US4710866A Cited
US4540903A Cited
US4598372A Cited
US4747070A Cited
US4630198A Cited
US4679163A Cited
US4580066A Cited
US4617657A Cited
US4646151A Cited
GB2171578B Cited
EP0196911B1 Cited
US5233420A Cited
US4841436A Cited
US4903018A Cited
US4953082A Cited
US4789927A Cited
US4912668A Cited
US4829465A Cited
GB2194085B Cited
EP0255767A2 Cited
US4887224A Cited
US4831440A Cited
US4924298A Cited
US4922341A Cited
US4785349A Cited
US5122873A Cited
US4866637A Cited
US5134697A Cited
US4823201A Cited
US4991112A Cited
US4891784A Cited
US5043880A Cited
US4924308A Cited
US5129059A Cited
US4866510A Cited
US5148524A Cited
US5091721A Cited
US5216724A Cited
US5060242A Cited
US5124790A Cited
US5086489A Cited
US5113255A Cited
US5172011A Cited
US4975599A Cited
US5233690A Cited
US5257350A Cited
US5299025A Cited
US5053985A Cited
US5142380A Cited
US5134487A Cited
US5057793A Cited
US5227863A Cited
US5146326A Cited
US5027212A Cited
US5003204A Cited
US5126842A Cited
US5107345A Cited
US5081450A Cited
US5253078A Cited
US5191548A Cited
US5136371A Cited
US5151875A Cited
US5193002A Cited
US5148271A Cited
US5201056A Cited
US5341371A Cited
US5311309A Cited
US5179372A Cited
US5247612A Cited
US5173695A Cited
US5303342A Cited
EP0468480B1 Cited
US5174641A Cited
US5202847A Cited
US5241658A Cited
US5189526A Cited
US5038209A Cited
US5258725A Cited
US5130568A Cited
US5229863A Cited
US5276784A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-07-20 2002-01-19 2002-07-21 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-07-20 2006-01-19 2006-07-21 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-07-20 2010-01-19 2010-07-21 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag