Patent US6043765A successfully refreshed from Google Patents.
US6043765A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for performing a parallel speculative Huffman decoding using both partial and full decoders
Assignee: Creative Technology Ltd
•
Filing: 1997-09-26
•
Granted: 2000-03-28
•
Expires: 2017-09-26
Abstract
Abstract A parallel speculative decoder is described. The decoder includes a set of partial decoders and an additional decoder. The partial decoders are aligned at different positions of a portion of an input data stream and speculatively and simultaneously decode symbols (e.g., codewords) having less bits than a longest symbol length. The additional decoder decodes symbols in the event the first partial decoder does not produce valid decoding results.
Inventors
- 👤 Kirk Twardowski
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 02:00
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/40; H03M7/4031; H03M7/4037; H03M7/4081; H03M7/60; H03M7/6005; H03M7/6017; H03M7/6023
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
87 words
A decoder comprising: a set of partial decoders aligned at different positions of a portion of an input data stream having a plurality of symbols to speculatively and simultaneously decode codewords in the input data stream having fewer bits than a longest codeword length, where the different positions comprise every possible starting bit position for a codeword with a range of bits; and an additional decoder coupled to decode codewords when at least a first of the set of partial decoders does not decode a valid codeword.
Claim 2
Dependent Claim
87 words
A decoder comprising: a set of partial decoders aligned at different positions of a portion of an input data stream having a plurality of symbols to speculatively and simultaneously decode codewords in the input data stream having fewer bits than a longest codeword length, where the different positions comprise every possible starting bit position for a codeword with a range of bits; and an additional decoder coupled to decode codewords when at least a first of the set of partial decoders does not decode a valid codeword.
Claim 3
Dependent Claim
29 words
The decoder defined in claim 1 wherein the decoder further comprises a register coupled to provide bits of the input data stream to the plurality of a partial decoders.
Claim 4
Dependent Claim
18 words
The decoder defined in claim 1 wherein each of the plurality of partial decoders comprises a look-up table.
Claim 5
Dependent Claim
26 words
The decoder defined in claim 1 wherein each partial decoder provides a validity indication corresponding to results of decoding its portion of the input data stream.
Claim 6
Dependent Claim
40 words
The decoder defined in claim 1 wherein each partial decoder compares its starting position with a sum of the codeword lengths from preceding decoders having valid decoding results to determine if it is aligned with a start of a codeword.
Claim 7
Dependent Claim
26 words
The decoder defined in claim 1 wherein a partial decoder generates an indication that its outputs is valid when aligned with a start of a codeword.
Claim 8
Dependent Claim
14 words
The decoder defined in claim 1 wherein the additional decoder comprises a full decoder.
Claim 9
Dependent Claim
17 words
The decoder defined in claim 1 wherein each of the partial decoders in the set are identical.
Claim 10
Dependent Claim
13 words
The decoder defined in claim 1 wherein each codeword comprises a Huffman codeword.
Claim 11
Dependent Claim
119 words
A decompression system comprising: a Huffman decoder comprising a set of partial decoders aligned at different positions of a portion of an input data stream having a plurality of codewords to speculatively and simultaneously decode codewords in the input data stream having fewer bits than a longest codeword length, where the different positions comprise every possible starting bit position for a codeword with a range of bits; and an additional decoder coupled to decode codewords when at least a first of the set of partial decoders does not decode a valid codeword; a run-length decoder coupled to the Huffman decoder; a zig-zag ordering mechanism coupled to the run-length decoder; and an inverse DCT coupled to the zig-zag ordering mechanism.
Claim 12
Dependent Claim
119 words
A decompression system comprising: a Huffman decoder comprising a set of partial decoders aligned at different positions of a portion of an input data stream having a plurality of codewords to speculatively and simultaneously decode codewords in the input data stream having fewer bits than a longest codeword length, where the different positions comprise every possible starting bit position for a codeword with a range of bits; and an additional decoder coupled to decode codewords when at least a first of the set of partial decoders does not decode a valid codeword; a run-length decoder coupled to the Huffman decoder; a zig-zag ordering mechanism coupled to the run-length decoder; and an inverse DCT coupled to the zig-zag ordering mechanism.
Claim 13
Dependent Claim
29 words
The system defined in claim 10 wherein the system further comprises a register coupled to provide bits of the input data stream to the plurality of a partial decoders.
Claim 14
Dependent Claim
18 words
The system defined in claim 10 wherein each of the plurality of partial decoders comprises a look-up table.
Claim 15
Dependent Claim
26 words
The system defined in claim 10 wherein each partial decoder provides a validity indication corresponding to results of decoding its portion of the input data stream.
Claim 16
Dependent Claim
40 words
The system defined in claim 10 wherein each partial decoder compares its starting position with a sum of the codeword lengths from preceding decoders having valid decoding results to determine if it is aligned with a start of a codeword.
Claim 17
Dependent Claim
26 words
The system defined in claim 10 wherein a partial decoder generates an indication that its outputs is valid when aligned with a start of a codeword.
Claim 18
Dependent Claim
14 words
The system defined in claim 10 wherein the additional decoder comprises a full decoder.
Claim 19
Dependent Claim
17 words
The system defined in claim 10 wherein each of the partial decoders in the set are identical.
Claim 20
Dependent Claim
13 words
The system defined in claim 10 wherein each codeword comprises a Huffman codeword.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-03-28 | 2003-09-27 | 2004-03-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-03-28 | 2007-09-27 | 2008-03-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-03-28 | 2011-09-27 | 2012-03-28 | $7700.00 | Window Closed / Lapsed |