Code compression for ARM7 embedded systems

被引：3

作者：

Garofalo, V. ^{[1
]}

Napoli, E. ^{[1
]}

Petra, N. ^{[1
]}

Strollo, A. G. M. ^{[1
]}

机构：

[1] Univ Naples Federico II, Dept Elect Engn & Telecommun, Naples, Italy

来源：

2007 EUROPEAN CONFERENCE ON CIRCUIT THEORY AND DESIGN, VOLS 1-3 | 2007年

关键词：

D O I：

10.1109/ECCTD.2007.4529689

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

A detailed analysis of different code compression algorithms is provided in this paper. The performances of the algorithms have been tested on ARM codes whose size is below 32KB. Code compression performances have been considered including the compression overheads due to the decoding tables, to the alignment and to the tables for random access to the compressed code. We have analyzed Huffman, Tunstall, LZ77 and Class-based techniques. Optimal performances are provided by Class Based algorithms with an average compression ratio of 64%. For this algorithm we have realized a static decompression engine that provides, after an initial latency of three clock cycles, one 32b instruction for clock cycle.

引用

页码：687 / 690

页数：4

共 14 条

[1] A decompression core for PowerPC
Kemp, TM
Montoye, RK
Harper, JD
Palmer, JD
Auerbach, DJ
[J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1998, 42 (06) : 807 - 812
[2] LARMORE LL, 1990, FAST ALGORITHM OPTIM
[3] LEFURGY C, 1997, P 30 ANN INT S MICR
[4] LEFURGY C, 2000, THESIS U MICHIGAN
[5] Lekatsas H, 2002, DES AUT CON, P34, DOI 10.1109/DAC.2002.1012590
[6] SAMC: A code compression algorithm for embedded processors
Lekatsas, H
Wolf, W
[J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1999, 18 (12) : 1689 - 1701
[7] Lekatsas H, 1998, 1998 DESIGN AUTOMATION CONFERENCE, PROCEEDINGS, P516, DOI 10.1109/DAC.1998.724526
[8] LIN CH, 2004, P DES AUT C
[9] SAYOOD K, 2002, INTRO DATA COMPRESSI
[10] WOLFE A, 1992, P 25 ANN INT S MICR, P81

← 1 2 →