RealTime Data Compression
Development blog on compression algorithms
Featured
(Move to ...)
Zstandard
LZ4
Zhuff
Compression benchmark
Entropy coders
MMC - Morphing Match Chain
▼
Sunday, April 3, 2016
Working with streaming
›
Streaming, an advanced and very nice processing mode that a few codecs offer to deal with small data segments. This is great in communica...
4 comments:
Friday, February 5, 2016
Compressing small data
›
Data compression is primarily seen as a file compression algorithm. After all, the main objective is to save storage space, is it ? With...
12 comments:
Wednesday, October 14, 2015
Huffman revisited part 5 : combining multi-streams with multi-symbols
›
In previous article , a method to create a fast multi-symbols Huffman decoder has been described. The experiment used a single bitstr...
1 comment:
Huffman revisited, Part 4 : Multi-bytes decoding
›
In most Huffman implementations I'm aware of, decoding symbols is achieved in a serial fashion, one-symbol-after-another. Decoding f...
8 comments:
Tuesday, August 25, 2015
Fuzz testing Zstandard
›
An advance issue that any production-grade codec must face is the ability to deal with erroneous data. Such requirement tends to come...
6 comments:
Wednesday, August 19, 2015
Accessing unaligned memory
›
Thanks to Herman Brule , I recently received an access to real ARM hardware systems, in order to test C code and tune them for performanc...
9 comments:
Thursday, July 30, 2015
Huffman revisited - Part 3 - Depth limited tree
›
A non-trivial issue that most real-world Huffman implementations must deal with is tree depth limitation. Huffman construction doesn...
2 comments:
Wednesday, July 29, 2015
Huffman revisited - Part 2 : the Decoder
›
The first attempt to decompress the Huffman bitStream created by a version of huff0 modified to use FSE bitStream ended up in brutal ...
8 comments:
‹
›
Home
View web version