Multialphabet arithmetic coding at 16 MBytes/sec
H. Printz, P.R. Stubley · DCC · 2002
The design and performance of a nonadaptive hardware system for data compression by arithmetic coding are presented. The alphabet of the data source is the full 256-symbol ASCII character set, plus a non-ASCII end-of-file symbol. The key ideas are the non-arithmetic representation of the current interval width, which yields improved coding efficiency in the interval width update, and the design of a circuit for the code point update, which operates at a high speed independent of the length of the code point register. On a reconfigurable coprocessor, constructed from commercially available field-programmable gate arrays and static RAM, implementation compresses its input stream at better than 16 MBytes/sec.>
Cited by 12 works. doi:10.1109/dcc.1993.253137
Authors
References
- An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder
- An Introduction to Arithmetic Coding
- Retiming synchronous circuitry
- Programmable active memories: a performance assessment
- Arithmetic stream coding using fixed precision registers
- A simple general binary source code (Corresp.)
- Practical Implementations of Arithmetic Coding
- A multi-purpose VLSI chip for adaptive data compression of bilevel images
- A multiplication-free multialphabet arithmetic code
- High efficiency, multiplication free approximation of arithmetic coding