Addressing optimization for loop execution targeting DSP with auto-increment/decrement architecture

W. Cheng, Y. Lin
{"title":"Addressing optimization for loop execution targeting DSP with auto-increment/decrement architecture","authors":"W. Cheng, Y. Lin","doi":"10.1109/ISSS.1998.730591","DOIUrl":null,"url":null,"abstract":"Since most DSP applications access large amount of data stored in the memory, a DSP code generator must minimize the addressing overhead. In this paper, we propose a method for addressing optimization in loop execution targeted toward DSP processors with auto-increment/decrement feature in their address generation unit. Our optimization methods include a multi-phase data ordering and a graph-based address register allocation. The proposed approaches have been evaluated using a set of core algorithms targeted towards the TI TMS320C40 DSP processor. Experimental results show that our system is indeed more effective compared to a commercial optimizing DSP compiler.","PeriodicalId":305333,"journal":{"name":"Proceedings. 11th International Symposium on System Synthesis (Cat. No.98EX210)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 11th International Symposium on System Synthesis (Cat. No.98EX210)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSS.1998.730591","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Since most DSP applications access large amount of data stored in the memory, a DSP code generator must minimize the addressing overhead. In this paper, we propose a method for addressing optimization in loop execution targeted toward DSP processors with auto-increment/decrement feature in their address generation unit. Our optimization methods include a multi-phase data ordering and a graph-based address register allocation. The proposed approaches have been evaluated using a set of core algorithms targeted towards the TI TMS320C40 DSP processor. Experimental results show that our system is indeed more effective compared to a commercial optimizing DSP compiler.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于自增/自减结构的DSP循环执行优化
由于大多数DSP应用程序访问存储在内存中的大量数据,因此DSP代码生成器必须最小化寻址开销。在本文中,我们提出了一种针对在其地址生成单元中具有自增/自减特征的DSP处理器的寻址循环执行优化方法。我们的优化方法包括多阶段数据排序和基于图形的地址寄存器分配。使用一组针对TI TMS320C40 DSP处理器的核心算法对所提出的方法进行了评估。实验结果表明,与市面上的优化DSP编译器相比,我们的系统确实更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Instruction encoding techniques for area minimization of instruction ROM Communication and interface synthesis on a rapid prototyping hardware/software codesign system Application-specific heterogeneous multiprocessor synthesis using differential-evolution Interface exploration for reduced power in core-based systems A processor description language supporting retargetable multi-pipeline DSP program development tools
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1