{"title":"Variable-length instruction compression for area minimization","authors":"Piia Simonen, I. Saastamoinen, J. Nurmi","doi":"10.1109/ASAP.2003.1212839","DOIUrl":null,"url":null,"abstract":"Memories comprise a significant part of chips in embedded applications, thus also contributing considerably to the costs. We present a variable-length compression scheme for reducing program memory footprint in a 32-bit DSP processor. The compression method is based on a static program code analysis. Short operand fields do not provide sufficient repetition individually, so the compression is realized by handling all operands of an instruction as one field. The more a certain operand combination is used, the shorter it is coded. The original combination is placed on a look-up table and the coded bit pattern forms an index to that table. The compression results that are achieved in two test applications are 46% (audio decoder) and 51% (video decoder).","PeriodicalId":261592,"journal":{"name":"Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASAP.2003.1212839","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Memories comprise a significant part of chips in embedded applications, thus also contributing considerably to the costs. We present a variable-length compression scheme for reducing program memory footprint in a 32-bit DSP processor. The compression method is based on a static program code analysis. Short operand fields do not provide sufficient repetition individually, so the compression is realized by handling all operands of an instruction as one field. The more a certain operand combination is used, the shorter it is coded. The original combination is placed on a look-up table and the coded bit pattern forms an index to that table. The compression results that are achieved in two test applications are 46% (audio decoder) and 51% (video decoder).