RealTime Data Compression
Development blog on compression algorithms
Featured
(Move to ...)
Zstandard
LZ4
Zhuff
Compression benchmark
Entropy coders
MMC - Morphing Match Chain
▼
Monday, April 7, 2014
Taking advantage of unequalities to provide better compression
›
When starting investigation on ANS properties, in November 2013, I stumbled upon the fact that positions in the table are not equivalent...
Wednesday, April 2, 2014
Ultra-fast normalization
›
Today's objective is to use the lessons learned when defining the perfect normalization algorithm to design a new, better, fast norm...
Friday, March 7, 2014
Perfect Normalization
›
People keeping an eye on the github repository of FSE may have noticed the apparition a new function, called FSE_normalizeCount HC (). L...
2 comments:
Sunday, March 2, 2014
Better normalization, for better compression
›
A secondary issue to deal with when implementing an FSE entropy coder is the requirement to normalize statistics. Basically, it consists ...
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...
‹
›
Home
View web version