A text-compression-based method for code size minimization in embedded systems
Authors:
Open Access
- 1 January 1999
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 4 (1) , 12-38
Abstract
We address the problem of code-size minimization in VLSI systems with embedded DSP processors. Reducing code size reduces the production cost of embedded systems we use data-compression methods to develop code-size minimization strategies. In our framework, the compressed program consists of a skeleton and a dictionary. We show that the dictionary can be computed by solving a set-covering problem derived from the original program. To execute the compressed code, we describe two methods that have different performance characteristics and different degrees of freedom in compressing the code. We also address performance considerations, and show that they can be incorporated easily into the set-covering formulation, and present experimental results obtained with Texas Instruments' optimizing TMS3220C25 compiler.Keywords
This publication has 11 references indexed in Scilit:
- On solving covering problems1996
- New ideas for solving covering problems1995
- Executing compressed programs on an embedded RISC architectureACM SIGMICRO Newsletter, 1992
- The Art of Programming Embedded Systems1992
- Data compression via textual substitutionJournal of the ACM, 1982
- Information compression by factorising common stringsThe Computer Journal, 1975
- Common phrases and minimum-space text storageCommunications of the ACM, 1973
- The Minimization of TANT NetworksIEEE Transactions on Electronic Computers, 1967
- A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential NetworksIEEE Transactions on Electronic Computers, 1965
- On Cores and Prime Implicants of Truth FunctionsThe American Mathematical Monthly, 1959