DocumentCode
2686170
Title
Analysis of two code compression algorithms for embedded systems
Author
Yuan Xie
Author_Institution
Worldwide Design Center, IBM Microelectron. Div., Essex Junction, VT, USA
Volume
2
fYear
2003
fDate
21-24 Oct. 2003
Firstpage
773
Abstract
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 two statistical models: one is a static model and the other one is a Markov model.
Keywords
Markov processes; algorithm theory; data compression; digital arithmetic; embedded systems; encoding; Markov model; Tunstall coding; V2F coding scheme; arithmetic coding; code compression algorithms; embedded system design; embedded systems; program size; static model; statistical models; variable-to-fixed coding schemes;
fLanguage
English
Publisher
ieee
Conference_Titel
ASIC, 2003. Proceedings. 5th International Conference on
ISSN
1523-553X
Print_ISBN
0-7803-7889-X
Type
conf
DOI
10.1109/ICASIC.2003.1277325
Filename
1277325
Link To Document