A Text-Compression-Based method for code size minimization in embedded systems

ACM Transactions on Design Automation of Electronic Systems

Volumn 4, Issue 1, 1999, Pages 12-38

  Liao, Stan ^a   Devadas, Srinivas ^b   Keutzer, Kurt ^c  

^a SYNOPSYS INC   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Code size optimization; Compression

Indexed keywords

EID: 22644451924     PISSN: 10844309     EISSN: None     Source Type: Journal    
DOI: 10.1145/298865.298867     Document Type: Article

References (18)

1. AHO, A., SETHI, R., AND ULLMAN, J. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, MA.
2. BRAYTON, R. K. AND SOMENZI, F. 1989. Boolean relations and the incomplete specification of logic networks. In Proceedings of the International Conference on Computer-Aided Design (ICCAD). 316-319.
3. COUDERT, O. AND MADRE, J.-C. 1995. New ideas for solving covering problems. In Proceedings of the 32nd ACM/IEEE Conference on Design Automation. 641-646.
4. COUDERT, O. 1995. On solving binate covering problems. In Proceedings of the 32nd ACM/IEEE Conference on Design Automation. 197-202.
5. FRASER, C. W., MYERS, E. W., AND WENDT, A. L. 1994. Analyzing and compressing assembly code. In Proceedings of the 1994 ACM SIGPLAN Symposium on Compiler Construction. ACM Press, New York, NY, 117-121.
6. GANSSLE, J. G. 1992. The Art of Programming Embedded Systems. Academic Press, Inc., New York, NY.
7. GIMPEL, J. 1967. The minimization of TANT networks. IEEE Trans. Electron. Comput. EC-16, 1 (Feb.), 18-38.
8. GRASSELLI, A. AND LUCCIO, F. 1965. A method for minimizing the number of internal states in incompletely specified machines. IEEE Trans. Electron. Comput. EC-14, 3 (June), 350-359.
9. HENNESSY, J. L. AND PATTERSON, D. A. 1990. Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers Inc., San Francisco, CA.
10. KOZUCH, M. AND WOLFE, A. 1994. Compression of embedded systems programs. In Proceedings of the IEEE International Conference on on Computer Design: VLSI in Computers and Processors.
11. MAYNE, A. AND JAMES, E. B. 1975. Information compression by factoring common strings. Comput. J. 18, 2, 157-160.
12. QUINE, W. V. O. 1959. On cores and prime implicants of truth functions. Am. Math. Monthly 66, 627-631.
13. RUDELL, R. 1989. Logic Synthesis for VLSI Design: ERL Memo 89/49. Computer Science Department, University of California at Berkeley, Berkeley, CA.
14. STORER, J. A. AND SZYMANSKI, T. G. 1982. Data compression via textual substitution. J. ACM 29, 4 (Oct.), 928-951.
15. TEXAS INSTRUMENTS, 1993. TMS320C2x User's Guide. Revision C. Texas Instruments, Austin, TX.
16. WAGNER, R. A. 1973. Common phrases and minimum-space text storage. Commun. ACM 16, 3 (Mar.), 148-152.
17. WOLFE, A. AND CHANIN, A. 1992. Executing compressed programs on an embedded RISC architecture. In Proceedings of the Conference on Micro-25.
18. ZIV, J. AND LEMPEL, A. 1977. A universal algorithm for sequential data compression. IEEE Trans. Inf. Theor. IT-23, 3 (May), 337-343.