Bitmask-based Compression
This tool provides bitmask-based code compression and decompression. Bitmask-based compression is an extension to dictionary-based code compression with efficient matching scheme using bitmasks that can significantly improve the code compression ratio. Figure 1 shows an example of bitmask-based code compression. The current version uses a 2-bit fully sliding bitmask. This implementation provides an efficient bitmask-aware dictionary selection using bit-saving cost metric. For detailed information please refer to the references in the bottom of this page.
Fig.1 An example of bitmask-based code compression
 |
Tool Download
Journal Articles
Referred Conference Papers
| C3 |
Chetan Murthy and Prabhat Mishra, Lossless Compression using Efficient Encoding of Bitmasks, IEEE International Symposium on VLSI (ISVLSI), pages 163-168, Tampa, Florida, USA, May 13-15, 2009. |
| C2 |
Seok-Won Seong and Prabhat Mishra, An Efficient Code Compression Technique using Application-Aware Bitmask and
Dictionary Selection Methods, Design Automation and Test in Europe (DATE), pages 582-587, Nice, France, April 16 - 20, 2007. |
| C1 |
Seok-Won Seong and Prabhat Mishra, A Bitmask-based Code Compression Technique for Embedded Systems, IEEE/ACM International Conference on Computer Aided Design (ICCAD), pages 251-254, San Jose, California, November 5 - 9, 2006. |
