Code density optimization for embedded DSP processors using data compression techniques

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. We present a framework for code size minimization where the compressed data consists of a dictionary and a skeleton. The dictionary can be computed using popular text compression algorithms. We describe two methods to execute the compressed code that have varying performance characteristics and varying degrees of freedom in compressing the code. Experimental results obtained with a TMS320C25 code generator are presented.

[1]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[2]  Andrew Wolfe,et al.  Executing compressed programs on an embedded RISC architecture , 1992, MICRO 1992.

[3]  Christopher W. Fraser,et al.  Analyzing and compressing assembly code , 1984, SIGPLAN '84.

[4]  Jack G. Ganssle,et al.  The Art of Programming Embedded Systems , 1991 .

[5]  James A. Storer,et al.  Data compression via textual substitution , 1982, JACM.

[6]  E. B. James,et al.  Information Compression by Factorising Common Strings , 1975, Computer/law journal.

[7]  Sharad Malik,et al.  Challenges in code generation for embedded processors , 1994, Code Generation for Embedded Processors.

[8]  Robert A. Wagner,et al.  Common phrases and minimum-space text storage , 1973, CACM.

[9]  Gregory J. Chaitin,et al.  A recent technical report , 1974, SIGA.

[10]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.