Andy,

No. I want to know the hash function.

For example, I have a Huffman encoding table as follows:

name Fre encode

....

Andy 15, "011",

Ray 20, "110",

....

Now a text string "Andy Ray wrote" is incoming, I want to know how to

match the incoming "Andy" and the table entry "Andy".

One must establish a 1-to-1 relationship between the incoming word and

the table entry.

What I can imagine to do in software is to create a hash function, then

if there are more entries responding to one entry, further string match

must be made.

I am wondering about whether or not a hardware design can does it.

Thank you.

Weng

Andy Ray wrote:

> Weng Tianxiang wrote:

> > Hi Thomas,

> > When Huffman frequency table is available, the decoding procedure is

> > stright forward.

> >

> > I know many electronic books use Huffman encoding method to compress

> > the book full context.

> >

> > Usually in the first pass of full context, Huffman frequency table is

> > established , in the 2nd pass, a Hash function is used to locate a new

> > word entry, then encode, based on the Huffman frequency table, and

> > output it.

> >

> > I want to know how Hash function is used in the 2nd pass.

> >

>

>

> I think you are asking: how do I generate the huffman codes given the

> frequency of each symbol. If so look at:

>

> http://en.wikipedia.org/wiki/Huffman_coding

>

> in the section "basic technique".

>

> Cheers,

>

> Andy.