Fast arithmetic coding algorithm of data compression
From MaRDI portal
Recommendations
Cited in
(15)- Minimizing excess code length and VLSI complexity in the multiplication free approximation of arithmetic coding
- High speed 4-symbol arithmetic encoder architecture for embedded zero tree-based compression
- A fast and efficient nearly-optimal adaptive Fano coding scheme
- Finite-precision arithmetic coding via index-splitting and probability-fitting
- Efficient multiplication-free arithmetic codes
- Research on context-based adaptive binary arithmetic coding
- An algorithm for compression of bilevel images
- A rapid probability estimator and binary arithmetic coder
- FPGA-based modelling unit for high speed lossless arithmetic coding
- Fast and space-efficient adaptive arithmetic coding
- A novel algorithm for text data compression based on arithmetic codec
- Arithmetic coding with folds and unfolds
- An efficient digital ink multi-dimensional data coding algorithm
- Adaptive arithmetic coding using fuzzy reasoning and grey prediction
- An adaptive character wordlength algorithm for data compression
This page was built for publication: Fast arithmetic coding algorithm of data compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2704950)