I think I got the answer in the spec. The bit stream must be<br><br>
msb lsb<br>
.... 1110 01 00<br><br>Thanks anyway,<br><br><br><br><br><br><div class="gmail_quote">On Dec 12, 2007 11:42 AM, Sanjay Rajashekar <<a href="mailto:sanjay.rajashekar@gmail.com">sanjay.rajashekar@gmail.com</a>> wrote:
<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">Hello Monty,<br>
<br>
Sorry for the wrong subject title last time. A little more clarification needed.<br>
<br>
<span style="color: rgb(255, 0, 0);">When reading bit-by-bit, there is no MSb/LSb, just 'first bit' and</span><br style="color: rgb(255, 0, 0);">
<span style="color: rgb(255, 0, 0);">'last bit'. The Huffman tree is traversed from 'first bit' to last</span><br style="color: rgb(255, 0, 0);">
<span style="color: rgb(255, 0, 0);">bit'. This is a conceptual layer above the bitpacker; all you need to</span><br style="color: rgb(255, 0, 0);">
<span style="color: rgb(255, 0, 0);">know is what order the bits come out, which happens to be LSb-first.</span><br>
<br>
For ex. say we have the following codewords in the codebook<br>
<br>
entry 0: codeword0 - 00<br>
entry 2: codeword1 - 0111<br>
entry 6: codeword2 - 111<br>
entry 7: codeword3 - 10<br>
<br>
Now in the bitstream if there is [codeword0] followed by [codeword3] followed by [codeword1], then will bitstream be <br>
<br>
msb lsb<br>
.... 0111 10 00 or will it be<br>
<br>
msb lsb<br>
.... 1110 01 00<br>
<br>
If it is the second case, then we can traverse the tree as and when we
get the bits from from the bitstream. But if it is the first case, then
how do we do the decoding ?<br>
<br>
Regards,<br><font color="#888888">
Sanjay<br>
<br>
</font></blockquote></div><br>