Turbo-Range-Coder
FiniteStateEntropy
| Turbo-Range-Coder | FiniteStateEntropy | |
|---|---|---|
| 6 | 4 | |
| 62 | 1,263 | |
| - | - | |
| 8.9 | 0.0 | |
| 9 months ago | over 1 year ago | |
| C | C | |
| GNU General Public License v3.0 only | BSD 2-clause "Simplified" License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Turbo-Range-Coder
- A poor entropy coding result in Zstandard
- Iguana: fast SIMD-optimized decompression
-
Worries about tANS?
Adaptive rANS included in : Turbo-Range-Coder including a benchmark app to test raw/text data with 8/16/32 bits integers or 32 bits floating points
-
Ask HN: Compress to Smallest Possible Size
Try a bwt compressor like BwtSatan : https://github.com/powturbo/Turbo-Range-Coder/releases/tag/2...
bwtsatan -20 inputfile outputfile
-
Announcing a new arithmetic coding library!
Interesting to see how it compares to Turbo-Range-Coder. Executables for windows and linux can be downloaded here.
- Fastest Range Coder for byte, integer, floating point data and BWT
FiniteStateEntropy
-
Intel QuickAssist Technology Zstandard Plugin for Zstandard
It's obsolete. It's limited to 32KB LZ window with huffman coding. Zstd can use a much larger window (8MB recommended) and a much better entropy coder: https://github.com/Cyan4973/FiniteStateEntropy
-
Worries about tANS?
tANS block based : FSE
-
Silly Lossy Text Compression Idea
Sounds similar to: https://github.com/Cyan4973/FiniteStateEntropy
https://arxiv.org/abs/1311.2540
> The modern data compression is mainly based on two approaches to entropy coding: Huffman (HC) and arithmetic/range coding (AC). The former is much faster, but approximates probabilities with powers of 2, usually leading to relatively low compression rates. The latter uses nearly exact probabilities - easily approaching theoretical compression rate limit (Shannon entropy), but at cost of much larger computational cost.
-
C Deep
FiniteStateEntropy - Two highly efficient compression codecs optimized for modern CPUs. BSD-2-Clause
What are some alternatives?
flac - Free Lossless Audio Codec
Snappy - A fast compressor/decompressor
fpng - Super fast C++ .PNG writer/reader
zstd - Zstandard - Fast real-time compression algorithm
Turbo-Base64 - Turbo Base64 - Fastest Base64 SIMD:SSE/AVX2/AVX512/Neon/Altivec - Faster than memcpy!
zlib-ng - zlib replacement with optimizations for "next generation" systems.
sneller - World's fastest log analysis: λ + SQL + JSON + S3
brotli - Brotli compression format
aports - [MIRROR] Alpine packages build scripts
LZFSE - LZFSE compression library and command line tool
FPC - FPC - Fast Prefix Coder
LZMA - (Unofficial) Git mirror of LZMA SDK releases