US 6,982,661 B2 | ||
Method of performing huffman decoding | ||
Tinku Acharya, Chandler, Ariz. (US); and Ping-Sing Tsai, Gilbert, Ariz. (US) | ||
Assigned to Intel Corporation, Santa Clara, Calif. (US) | ||
Filed on Mar. 18, 2003, as Appl. No. 10/391,892. | ||
Application 10/391892 is a continuation of application No. 10/293187, filed on Nov. 12, 2002, granted, now 6,646,577. | ||
Application 10/293187 is a continuation of application No. 09/704380, filed on Oct. 31, 2000, granted, now 6,563,439. | ||
Prior Publication US 2003/0174077 A1, Sep. 18, 2003 | ||
This patent is subject to a terminal disclaimer. | ||
Int. Cl. H03M 7/40 (2006.01) |
U.S. Cl. 341—65 | 16 Claims |
1. A method of decoding a series of binary digital signals using a data structure, the series of binary digital signals being
previously encoded in accordance with a Huffman code, said method comprising:
searching a plurality of codes in the data structure for a possible match based on, at least in part, length of a subgrouping
of binary digital signals of the series of binary digital signals being decoded.
|