ACM Home Page
Please provide us with feedback. Feedback
Code compression as a variable in hardware/software co-design
Full text PdfPdf (244 KB)
Source International Conference on Hardware Software Codesign archive
Proceedings of the eighth international workshop on Hardware/software codesign table of contents
San Diego, California, United States
Pages: 120 - 124  
Year of Publication: 2000
ISBN:1-58113-268-9
Authors
Haris Lekatsas  Princeton University
Jörg Henkel  NEC
Wayne Wolf  Princeton University
Sponsors
Computer Conservation Society : Computer Conservation Society
IFIP WG 10.5 : IFIP WG 10.5
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 19,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/334012.334035
What is a DOI?

ABSTRACT

We present a new way to practice and view handware/software co-design: rather than raising the level of abstraction in order to exploit the highest possible degree of optimization, we use code compression i.e. we practice co-design at the bit-level. Through our novel architecture combined with our compression methodology this results in optimization of all major design goals/constraints. In particular, we present a compression methodology that deploys what we call a “post-cache architecture” (i.e. the detached decompression unit is located between the CPU and the instruction cache). We present a design methodology that allows the designer to control parameters like speed, power, and area through the choice of compression parameters. In addition we show that our compression methodology (using a Markov Model) is more efficient than the widely used Huffman compression scheme.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
P.G. Howard and J.S. Vitter, Practical Implementations of Arithmetic Coding, Image and Text Compression, Kluwer Academic Publishers, Norwell, MA, pp. 85-112, Kluwer Academic Publishers, Norwell, MA, 1992.
3
 
4
5
 
6
 
7
8
 
9
 
10
J. Ziv and A. Lempel, A Universal Algorithm for Sequential Data Compression, IEEE Transactions on Information Theory, Vol. 23(3), pp. 337-343, May, 1977.
 
11
 
12
 
13
D.A. Huffman, A Method for the Construction of Minimum- Redundancy Codes, Proceedings of the IRE, vol 4D, pp. 1098- 1101, September, 1952.
14
15


Collaborative Colleagues:
Haris Lekatsas: colleagues
Jörg Henkel: colleagues
Wayne Wolf: colleagues