huffman decoding

[nagaraj]

hello... m trying to implement huffman decoding for my mp3 player project using LabVIEW 8.2.... i have the support hardware for LV FPGA 8.2...

             can somebody help me in building a vi for efficient huffman decoding plz...??? 

[DuffmanSays]

Hello,

While I am unfamiliar with Huffman decoding, I might be able to give you a few pointers for FPGA programming. However, I will need to know what kind of algorithm you have in mind and what hardware it is that you are using. Could you be more specific about what your decoding scheme will entail? Do you have any specific questions about any of the methods you have tried for implementing this decoding scheme? If so, please post back, and we would be happy to help. Thanks,

Mike D.

[Christian_L]

This question would better be posed in the LabVIEW forum instead of Field Point.

There are probably many different ways to solve this problem in LabVIEW, but here are a couple of solutions. I have only tested it in LabVIEW Windows, but it can be adapted to LabVIEW FPGA with some changes.

The basic idea is to process the Huffman Tree, converting the path to each leaf into a numeric value, and then sorting all leaves (paths) from shortest to longest (lowest to highest value). Once you have this processed and sorted Huffman Tree you can walk through the data bits and match them up to the values in the processed tree, looking for matches between the sequence of bits in the binary data stream and the available leaves in the tree. Whenever you find a match between a bit sequence and leaf value you return the corresponding character and start the next bit sequence. As you search for valid bit sequences you start with one bit and keep adding additional bits until you find a valid sequence.