Profile

Cover photo
Cyan
80 followers|775,635 views
AboutPostsPhotos+1'sReviews

Stream

Cyan

Shared publicly  - 
 
Specification of Zstandard compression format
 With the compression format stabilized in v0.7.x serie, Zstandard  gets now a first version of its formal specification : https://github.com/Cyan4973/zstd/wiki/Zstandard-Compression-Format If you ever wanted to know how the algorithm works, and / or wanted...
3
Add a comment...

Cyan

Shared publicly  - 
 
Finalizing a compression format
With Zstandard v1.0 looming ahead, the last major item for zstd to settle is an extended set of features for its frame encapsulation layer. Quick overview of the design : data compressed by zstd is cut into blocks. A compressed block has a maximum content s...
With Zstandard v1.0 looming ahead, the last major item for zstd to settle is an extended set of features for its frame encapsulation layer. Quick overview of the design : data compressed by zstd is cut into blocks. A compress...
4
Dima Tisnek's profile photo
 
Awesome!
Add a comment...

Cyan

Shared publicly  - 
 
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 communication scenarios. For lossless data compression, it makes it possible to send tiny packets, in order to create a low-late...
Streaming, an advanced and very nice processing mode that a few codecs offer to deal with small data segments. This is great in communication scenarios. For lossless data compression, it makes it possible to send tiny packets...
2
Add a comment...

Cyan

Shared publicly  - 
 
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 this background in mind, it's also logical to focus on bigger files. Good compression achieved on a single large archiv...
2
1
Add a comment...

Cyan

Shared publicly  - 
 
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 research was using single bitstream encoding, for simplicity. However, earlier investigation proved that using multiple bitstreams was good for speed on m...
In previous article, a method to create a fast multi-symbols Huffman decoder has been described. The research was using single bitstream encoding, for simplicity. However, earlier investigation proved that using multiple bits...
1
Add a comment...

Cyan

Shared publicly  - 
 
 In most Huffman implementations I'm aware of, decoding symbols is achieved in a serial fashion, one-symbol-after-another. Decoding fast is not that trivial, but it has been well studied already. Eventually, the one symbol pe...
1
Add a comment...
Have him in circles
80 people
Nicolas LESCURE's profile photo
France Quiqueré's profile photo
Yves C's profile photo
Xavier Rassiri-Gozel's profile photo
‫بوخديمي كارينا Rabie‬‎'s profile photo
John Nash's profile photo
Christopher Jackson (darkdragn)'s profile photo
Jim Leonard's profile photo
Abel Belzunces's profile photo

Cyan

Shared publicly  - 
 
Zstandard reaches Final Format
 Finally. That was a pretty long journey. With the release of v0.7, Zstandard  has reached an important milestone where the compression format is stable and complete enough to pretend becoming v1.0. We don't call it v1.0 yet, because it's safer to spend som...
1
Takayuki Matsuoka's profile photo
 
Congrats! And frankly, hats off to your effort. According to my git commit log, you are definitive hardworker ;)
Add a comment...

Cyan

Shared publicly  - 
 
Finalizing a compression format
With Zstandard v1.0 looming ahead, the last major item for zstd to settle is an extended set of features for its frame encapsulation layer. Quick overview of the design : data compressed by zstd is cut into blocks. A compressed block has a maximum content s...
With Zstandard v1.0 looming ahead, the last major item for zstd to settle is an extended set of features for its frame encapsulation layer. Quick overview of the design : data compressed by zstd is cut into blocks. A compress...
1
Takayuki Matsuoka's profile photoCyan's profile photo
2 comments
Cyan
+
1
2
1
 
yep, it was accidentally published too soon.
But not by much ...
Add a comment...

Cyan

Shared publicly  - 
 
In previous article, a method to create a fast multi-symbols Huffman decoder has been described. The research was using single bitstream encoding, for simplicity. However, earlier investigation proved that using multiple bits...
3
Add a comment...

Cyan

Shared publicly  - 
 
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 research was using single bitstream encoding, for simplicity. However, earlier investigation proved that using multiple bitstreams was good for speed on m...
 In previous article, a method to create a fast multi-symbols Huffman decoder has been described. The research was using single bitstream encoding, for simplicity. However, earlier investigation proved that using multiple bit...
3
Add a comment...

Cyan

Shared publicly  - 
 
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 fast is not that trivial, but it has been well studied already. Eventually, the one symbol per decoding operation becomes its...
 In most Huffman implementations I'm aware of, decoding symbols is achieved in a serial fashion, one-symbol-after-another. Decoding fast is not that trivial, but it has been well studied already. Eventually, the one symbol pe...
1
Add a comment...
People
Have him in circles
80 people
Nicolas LESCURE's profile photo
France Quiqueré's profile photo
Yves C's profile photo
Xavier Rassiri-Gozel's profile photo
‫بوخديمي كارينا Rabie‬‎'s profile photo
John Nash's profile photo
Christopher Jackson (darkdragn)'s profile photo
Jim Leonard's profile photo
Abel Belzunces's profile photo
Basic Information
Gender
Male
Cyan's +1's are the things they like, agree with, or want to recommend.
Compressing small data
fastcompression.blogspot.com

Data compression is primarily seen as a file compression algorithm. After all, the main objective is to save storage space, is it ? With thi

Huffman revisited part 5 : combining multi-streams with multi-symbols
fastcompression.blogspot.com

In previous article, a method to create a fast multi-symbols Huffman decoder has been described. The research was using single bitstream enc

Huffman revisited, Part 4 : Multi-bytes decoding
fastcompression.blogspot.com

In most Huffman implementations I'm aware of, decoding symbols is achieved in a serial fashion, one-symbol-after-another. Decoding fast is n

Accessing unaligned memory
fastcompression.blogspot.com

Thanks to Herman Brule, I recently received an access to real ARM hardware systems, in order to test C code and tune them for performance. I

Huffman revisited - part 1
fastcompression.blogspot.com

Huffman compression is a well known entropic compression technique since the 1950's. It's optimal, in the sense there is no better construct

Huffman revisited - Part 2 : the Decoder
fastcompression.blogspot.com

The first attempt to decompress the Huffman bitStream created by anhuff0 version modified to use FSE bitStream ended up in brutal disenchant

Strict Aliasing
dbp-consulting.com

So What's The Problem? There's a lot of confusion about strict aliasing rules. The main source of people's confusion is that there are two d

Bloom Filters - Explained ~ Tech-Effigy
techeffigytutorials.blogspot.com

The Bloom filter is a space efficient, probabilistic data structure, designed to test the membership of elements to a set. The trade-off for

ZSTD - A stronger compression algorithm
fastcompression.blogspot.com

ZSTD, short for Z-Standard, is a new lossless compression algorithm, aiming at providing both great compression ratio and speed for your sta

Performance of various general compression algorithms - some of them are...
java-performance.info

This article compares several Java general compression algorithm implementations - you can compress your data at over 300 Mb/sec using some

Wifi Analyzer
market.android.com

Turns your android phone into a Wi-Fi analyzer!! Shows the Wi-Fi channels around you. Helps you to find a less crowded channel for your wire

bourse aux jouets - Hauts-de-Seine - 92
bourse-aux-jouets.org

découvrez les dates des bourses aux jouets dans les Hauts-de-Seine - 92

Counting bytes fast - little trick from FSE
fastcompression.blogspot.com

An apparently trivial and uninteresting task nonetheless received some special optimization care within FSE : counting the bytes (or 2-bytes

Let's move on
fastcompression.blogspot.com

I've received an answer from Don Bailey. He blames the situation on a lack of communication. OK. In an attempt to bring the discussion to a

Streaming API for LZ4
fastcompression.blogspot.com

For quite some time, the LZ4 Streaming API project has been started and delayed, as other priorities stepped in the way. To be fair, one imp

Taking advantage of unequalities to provide better compression
fastcompression.blogspot.com

When starting investigation on ANS properties, in November 2013, I stumbled upon the fact that positions in the table are not equivalent. Ba

Ultra-fast normalization
fastcompression.blogspot.com

Today's objective is to use the lessons learned when defining the perfect normalization algorithm to design a new, better, fast normalizatio

Perfect Normalization
fastcompression.blogspot.com

People keeping an eye on the github repository of FSE may have noticed the apparition a new function, called FSE_normalizeCountHC(). Let's d

Better normalization, for better compression
fastcompression.blogspot.com

A secondary issue to deal with when implementing an FSE entropy coder is the requirement to normalize statistics. Basically, it consists in

Public - a year ago
reviewed a year ago
1 review
Map
Map
Map