C. Lefurgy and T. Mudge. Code Compression for DSP. CSE-TR-380-98, University of Michigan, November 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Design of an One-cycle Decompression Hardware for.. - Lekatsas, Henkel.. (2002) (2 citations) (Correct)
....with code compression is how to locate branch jump call targets in compressed code since the original offsets will not point to correct locations after compression . Our approach is to change branch offsets to point to the new compressed space addresses first proposed by Lefurgy et al. [5]. Branch offsets are patched after the compression phase. To simplify our design, we forced our targets to be aligned at word boundaries, as this simplifies the decoding tree. Patching the branch offsets involves a) compressing the original program and creating a map between native instruction ....
C. Lefurgy and T. Mudge. Code Compression for DSP. CSE-TR-380-98, University of Michigan, November 1998.
Efficient Execution of Compressed Programs - Lefurgy (2000) (1 citation) Self-citation (Lefurgy Mudge) (Correct)
....fast. The second is a software version of IBM s CodePack which attains better compression ratios, though it increases execution time. 5.3. 1 Dictionary compression The dictionary compression scheme takes advantage of the observation that the instructions in programs are highly repetitive [Lefurgy97, Lefurgy98]. Each unique 32 bit instruction word in the original program is put in a dictionary. Each instruction in the original program is then replaced with a 16 bit index into the dictionary. Because the instruction words are replaced with a short index and because the dictionary overhead is usually ....
C. Lefurgy and T. Mudge, Code Compression for DSP, CSE-TR-38098, University of Michigan, November 1998. 200
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC