Journal Article10.1109/TCAD.2008.917563
Bitmask-Based Code Compression for Embedded Systems
Seok-Won Seong,Prabhat Mishra +1 more
TL;DR: A novel code-compression technique using bitmasks is presented, which significantly improves the compression efficiency without introducing any decompression penalty and proposes a dictionary-based code-Compression algorithm using the bitmask- and dictionary-selection techniques that can significantly reduce the memory requirement.
read more
Abstract: Embedded systems are constrained by the available memory. Code-compression techniques address this issue by reducing the code size of application programs. It is a major challenge to develop an efficient code-compression technique that can generate substantial reduction in code size without affecting the overall system performance. We present a novel code-compression technique using bitmasks, which significantly improves the compression efficiency without introducing any decompression penalty. This paper makes three important contributions. 1) It develops an efficient bitmask-selection technique that can create a large set of matching patterns. 2) It develops an efficient dictionary-selection technique based on bitmasks. 3) It proposes a dictionary-based code-compression algorithm using the bitmask- and dictionary-selection techniques that can significantly reduce the memory requirement. To demonstrate the usefulness of our approach, we have performed code compression using applications from various domains and compiled for a wide variety of architectures. Our approach outperforms the existing dictionary-based techniques by an average of 20%, giving a compression ratio of 55%-65%.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Test Data Compression Using Efficient Bitmask and Dictionary Selection Methods
Kanad Basu,Prabhat Mishra +1 more
TL;DR: A novel test data compression technique using bitmasks which provides a substantial improvement in the compression efficiency without introducing any additional decompression penalty is proposed.
66
Decoding-Aware Compression of FPGA Bitstreams
TL;DR: This paper proposes a novel decode-aware compression technique to improve both compression and de compression efficiencies and outperforms the existing compression approaches by 15%, while the decompression hardware for variable-length coding is capable of operating at the speed closest to the best known field-programmable gate array-based decoder for fixed- length coding.
Input Test Data Compression Based on the Reuse of Parts of Dictionary Entries: Static and Dynamic Approaches
TL;DR: A new test data compression method for intellectual property (IP) cores testing, based on the reuse of parts of dictionary entries, is presented, supported with extensive simulation results and comparisons to already known testData compression methods suitable for IP cores testing.
27
Efficient trace data compression using statically selected dictionary
Kanad Basu,Prabhat Mishra +1 more
- 01 May 2011
TL;DR: This paper proposes several dictionary based compression techniques for trace data compression that takes account of the fact that the difference between golden and erroneous trace data is small, and concludes that the static dictionary selected based on golden trace data can provide notably better compression performance than the dynamic dictionaries selected in the current approaches.
26
Content-aware encoding for improving energy efficiency in multi-level cell resistive random access memory
Hadi Hajimiri,Prabhat Mishra,Swarup Bhunia,Branden Long,Yibo Li,Rashmi Jha +5 more
- 15 Jul 2013
TL;DR: This paper considers resistive random access memory (RRAM), a promising NVM technology, and observes that a specific feature of the memory, namely, its multi-level cell (MLC) structure, can be used to significantly reduce its read access energy.
16
References
•Book
Computer Architecture: A Quantitative Approach
John L. Hennessy,David A. Patterson +1 more
- 01 Dec 1989
TL;DR: This best-selling title, considered for over a decade to be essential reading for every serious student and practitioner of computer design, has been updated throughout to address the most important trends facing computer designers today.
12.6K
Improving code density using compression techniques
Charles R. Lefurgy,Peter L. Bird,I-Cheng Chen,Trevor Mudge +3 more
- 01 Dec 1997
TL;DR: This work proposes a method for compressing programs in embedded processors where instruction memory size dominates cost and achieves an average size reduction of 39%, 34%, and 26%, respectively, for SPEC CINT95 programs.
Code density optimization for embedded DSP processors using data compression techniques
Stan Liao,Srinivas Devadas,Kurt Keutzer +2 more
- 27 Mar 1995
TL;DR: This work presents a framework for code size minimization where the compressed data consists of a dictionary and a skeleton, which can be computed using popular text compression algorithms.
118
Test data compression using dictionaries with selective entries and fixed-length indices
TL;DR: The dictionary-based approach not only reduces test data volume but it also eliminates the need for additional synchronization and handshaking between the SOC and the ATE, and generally provides higher compression for the same amount of hardware overhead.