RealTime Data Compression
Development blog on compression algorithms
Featured
(Move to ...)
Zstandard
LZ4
Zhuff
Compression benchmark
Entropy coders
MMC - Morphing Match Chain
▼
Friday, February 28, 2014
FSE encoding : Mapping sub-ranges in a memory efficient way
›
With last blog post , we were left with a description of the FSE compression algorithm. However, the code associated was a bit cryptic. S...
11 comments:
Tuesday, February 25, 2014
FSE encoding, Part 2
›
In previous article , we learned how to determine the number of bits to write, and which bits to write, when encoding a symbol using F...
Wednesday, February 19, 2014
FSE encoding : how it works
›
Quite unusually, we have started this serie on FSE by focusing on the decompression part. It may seem strange to try to decode a data we...
4 comments:
Friday, February 14, 2014
FSE decoding : wrap up
›
With all the previous articles written on FSE , it seems we now have all elements to build a complete FSE decoder. Let's wrap up all th...
Sunday, February 9, 2014
FSE : distributing symbol values
›
Following the last article on defining optimal sub-ranges for FSE , and attributing them according to symbol ranking, we were left wi...
Wednesday, February 5, 2014
FSE : Defining optimal subranges
›
Note : Charles Bloom started an independent in-depth analysis of ANS on his blog, which is definitely worth the read. As stated in...
3 comments:
Monday, February 3, 2014
A comparison of Arithmetic Encoding with FSE
›
Arithmetic encoding was invented in the 70's by Jorma Rissanen. After a few decades during which the technique almost stagnated, pa...
Tuesday, January 14, 2014
Huffman, a comparison with FSE
›
In this serie explaining the behavior of Finite State Entropy , I find it interesting to make a quick comparison with Huffman entropy...
15 comments:
‹
›
Home
View web version