A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Using Operand Factorization to Compress DSP Programs
1999
Anais do XI International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 1999)
unpublished
Preserved Fulltext
We propose a method for compressing programs running on embedded DSPs. Program expression trees are decomposed into opcode and operand sequences called patterns. We show that DSP program patterns have exponential frequency distribution. Based on that, we encode patterns using a mix of a variable-length and fixed-length codewords. A decompression engine is proposed, which converts patterns into uncompressed instruction sequences. The experimental results reveal an average compression ratio of
doi:10.5753/sbac-pad.1999.19793
fatcat:36ztjtqannc7ddw26fqi63zfpq