By: ⚛ (0xe2.0x9a.0x9b.delete@this.gmail.com), June 6, 2022 6:52 am
Room: Moderated Discussions
anonymou5 (no.delete@this.spam.com) on June 5, 2022 12:32 pm wrote:
> > because a VL-ISA can use https://en.wikipedia.org/wiki/Huffman_coding where the structure of the
> > Huffman tree is based on expected execution traces and/or on real-world execution traces.
>
> (snip)
> So yes, Huffman will help for the super popular ones, but overall it
> really won't: the numbers simply are against you.
The sentence "Huffman will help for the super popular ones, but overall it really won't" is a mathematical contradiction. Are you sure you understand how Huffman/Shannon coding works?
Huffman/Shannon codings don't work only in case the premise "there are super popular ones" isn't fulfilled. In other words, they do not work if the probability distribution of the characters/symbols in the data stream is approximately the same (such as: 8 symbols, probability 1/8=0.125 for each symbol).
-atom
> > because a VL-ISA can use https://en.wikipedia.org/wiki/Huffman_coding where the structure of the
> > Huffman tree is based on expected execution traces and/or on real-world execution traces.
>
> (snip)
> So yes, Huffman will help for the super popular ones, but overall it
> really won't: the numbers simply are against you.
The sentence "Huffman will help for the super popular ones, but overall it really won't" is a mathematical contradiction. Are you sure you understand how Huffman/Shannon coding works?
Huffman/Shannon codings don't work only in case the premise "there are super popular ones" isn't fulfilled. In other words, they do not work if the probability distribution of the characters/symbols in the data stream is approximately the same (such as: 8 symbols, probability 1/8=0.125 for each symbol).
-atom
