Source coding algorithms for fast data compression.
Source coding algorithms for fast data compression.
An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder
IBM Journal of Research and Development - Q-Coder adaptive binary arithmetic coder
Optimal hardware and software arithmetic coding procedures for the Q-Coder
IBM Journal of Research and Development - Q-Coder adaptive binary arithmetic coder
Software implementation of the Q-Coder
IBM Journal of Research and Development - Q-Coder adaptive binary arithmetic coder
A multi-purpose VLSI chip for adaptive data compression of bilevel images
IBM Journal of Research and Development - Q-Coder adaptive binary arithmetic coder
A fast, highly reliable data compression chip and algorithm for storage systems
IBM Journal of Research and Development
Document Image Coding for Processing and Retrieval
Journal of VLSI Signal Processing Systems - special issue on multimedia signal processing
Context-based compression of binary images in parallel
Software—Practice & Experience
Universal Finite Memory Machines for Coding Binary Sequences
DCC '00 Proceedings of the Conference on Data Compression
Compression of scan-digitized Indian language printed text: a soft pattern matching technique
Proceedings of the 2003 ACM symposium on Document engineering
An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder
IBM Journal of Research and Development - Q-Coder adaptive binary arithmetic coder
Optimal hardware and software arithmetic coding procedures for the Q-Coder
IBM Journal of Research and Development - Q-Coder adaptive binary arithmetic coder
Software implementation of the Q-Coder
IBM Journal of Research and Development - Q-Coder adaptive binary arithmetic coder
A multi-purpose VLSI chip for adaptive data compression of bilevel images
IBM Journal of Research and Development - Q-Coder adaptive binary arithmetic coder
Performance as a function of compression
IBM Journal of Research and Development
IBM Journal of Research and Development
Speeding up Dirac's entropy coder
MIV'05 Proceedings of the 5th WSEAS international conference on Multimedia, internet & video technologies
Hi-index | 0.01 |
The Q-Coder is an important new development in binary arithmetic coding. It combines a simple but efficient arithmetic approximation for the multiply operation, a new formalism which yields optimally efficient hardware and software implementations, and a new technique for estimating symbol probabilities which matches the performance of any method known. This paper describes the probability-estimation technique. The probability changes are estimated solely from renormalizations in the coding process and require no additional counters. The estimation process can be implemented as a finite-state machine, and is simple enough to allow precise theoretical modeling of single-context coding. Approximate models have been developed for a more complex multi-rate version of the estimator and for mixed-context coding. Experimental studies verifying the modeling and showing the performance achieved for a variety of image-coding models are presented.