优化的DSP汇编代码生成从同构原子数据流图开始

38th Midwest Symposium on Circuits and Systems. Proceedings Pub Date : 1995-08-13 DOI:10.1109/MWSCAS.1995.510327

B. Wess, W. Kreuzer

{"title":"优化的DSP汇编代码生成从同构原子数据流图开始","authors":"B. Wess, W. Kreuzer","doi":"10.1109/MWSCAS.1995.510327","DOIUrl":null,"url":null,"abstract":"The problem of translating graphs into optimal instruction code is NP-complete even for very simple target machine models. On the other hand, O(n) algorithms are available for translating expression trees into optimal instruction code. The purpose of this paper is to show that by transforming graphs into constrained expression trees, global optimized instruction code can be produced based on tree algorithms.","PeriodicalId":165081,"journal":{"name":"38th Midwest Symposium on Circuits and Systems. Proceedings","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Optimized DSP assembly code generation starting from homogeneous atomic data flow graphs\",\"authors\":\"B. Wess, W. Kreuzer\",\"doi\":\"10.1109/MWSCAS.1995.510327\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of translating graphs into optimal instruction code is NP-complete even for very simple target machine models. On the other hand, O(n) algorithms are available for translating expression trees into optimal instruction code. The purpose of this paper is to show that by transforming graphs into constrained expression trees, global optimized instruction code can be produced based on tree algorithms.\",\"PeriodicalId\":165081,\"journal\":{\"name\":\"38th Midwest Symposium on Circuits and Systems. Proceedings\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-08-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"38th Midwest Symposium on Circuits and Systems. Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MWSCAS.1995.510327\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"38th Midwest Symposium on Circuits and Systems. Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.1995.510327","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

将图转换为最优指令代码的问题即使对于非常简单的目标机器模型也是np完全的。另一方面，O(n)算法可用于将表达式树转换为最优指令代码。本文的目的是证明通过将图转换为约束表达式树，可以基于树算法生成全局优化的指令码。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Optimized DSP assembly code generation starting from homogeneous atomic data flow graphs

The problem of translating graphs into optimal instruction code is NP-complete even for very simple target machine models. On the other hand, O(n) algorithms are available for translating expression trees into optimal instruction code. The purpose of this paper is to show that by transforming graphs into constrained expression trees, global optimized instruction code can be produced based on tree algorithms.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

38th Midwest Symposium on Circuits and Systems. Proceedings

自引率

0.00%

发文量

期刊最新文献

A band-pass sigma-delta modulator architecture for digital radio Forecasting epidemiological time series with backpropagation neural networks Analog blocks for high-speed oversampled A/D converters Designing efficient redundant arithmetic processors for DSP applications Using neural networks for automatic speaker recognition: a practical approach