Analysis of Two Code Compression Algorithms for Embedded Systems

摘要

Embedded systems are space and cost sensitive. Decreasing the program size is an important goal for embedded system design. Code compression is proposed to tackle this problem. In this paper, we present analysis of two code compression algorithms based on variable-to-fixed (V2F) coding schemes: one is based on Tunstall coding and the other one is based on arithmetic coding. The paper also gives the compression lower bound by using twoo statistical models: one is a static model and the other one is a Markov model.