PivCo-Huffman

PivCo-Huffman

A novel approach to Huffman decoding, built on a wavelet-tree-style data layout.

by Marcin Żukowski

PivCo-Huffman decodes data block-by-block via SIMD primitives that operate on<br>per-node bitmaps rather than a code-after-code stream. In our benchmarks,<br>it consistently beats the decode throughput of state-of-the-art<br>Huffman codecs (Huff0, Oodle Huffman) by a large margin.<br>Additionally, an extension that selectively applies ANS<br>(PivCo-Huffman+ANS) reaches compression ratios approaching full<br>FSE/tANS at much higher speeds.

arXiv<br>HTML<br>PDF<br>GitHub repository

Source: github.com/MarcinZukowski/pivco-huffman