Random access decompression using binary arithmetic coding
- 1 January 1999
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We present an algorithm based on arithmetic coding that allows decompression to start at any point in the compressed file. This random access requirement poses some restrictions on the implementation of arithmetic coding and on the model used. Our main application area is executable code compression for computer systems where machine instructions are decompressed on-the-fly before execution. We focus on the decompression side of arithmetic coding and we propose a fast decoding scheme based on finite state machines. Furthermore, we present a method to decode multiple bits per cycle, while keeping the size of the decoder small.Keywords
This publication has 12 references indexed in Scilit:
- Executing Compressed Programs On An Embedded RISC ArchitecturePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- High efficiency, multiplication free approximation of arithmetic codingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Code density optimization for embedded DSP processors using data compression techniquesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Java intermediate bytecodesACM SIGPLAN Notices, 1995
- A multiplication-free multialphabet arithmetic codeIEEE Transactions on Communications, 1989
- An overview of the basic principles of the Q-Coder adaptive binary arithmetic coderIBM Journal of Research and Development, 1988
- Data Compression Using Dynamic Markov ModellingThe Computer Journal, 1987
- Arithmetic coding for data compressionCommunications of the ACM, 1987
- Data Compression Using Adaptive Coding and Partial String MatchingIEEE Transactions on Communications, 1984
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977