By Topic

Dictionary based code compression for variable length instruction encodings

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
D. Das ; Dept. of CSE, IIT, Kharagpur, India ; R. Kumar ; P. P. Chakrabarti

Most of the work done in the field of machine code compression is for fixed length instruction encodings. In this work we apply code compression on variable length instruction set processors whose encodings are already optimized to a certain extent with respect to their usages. We develop a dictionary based algorithm which utilizes unused encoding space of an instruction set architecture to encode code-words, and addresses issues arising out of variable length instructions. We test the algorithm with a RISC processor and include results for compression and performance in terms of cycle-counts and memory accesses respectively. We also present an efficient scheme for searching relocated branch addresses and analyze its performance.

Published in:

18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design

Date of Conference:

3-7 Jan. 2005