Patent ID: 6404358
Filing Date: 2002-06-11
Classification: H03M

Abstract:
A method for decoding a Huffman code comprising:receiving a continuous stream of items of coded data, each item of coded data comprising a variable number of bits at least equal to a minimum number and obtaining from each item of coded data a corresponding item of source data; providing a decoding memory structure comprising, for each value of an initial group of bits comprising a number not greater than the minimum number and for each value of each further bit, a record formed by a flag having an end-of-decoding value or a not end-of-decoding value, and a field indicating the source data or the records associated with values of an immediately following bit depending on whether the flag has, respectively, the end-of-decoding value or the not end-of-decoding value; accessing the record corresponding to the value of the initial group; repeating, until a record having the flag with the end-of-decoding value is reached, accessing the record corresponding to the value of the immediately following bit by the field of a current record; and obtaining the source data from the field of the current record.