Time-Constrained Code Compaction for DSPs
| dc.contributor.author | Leupers, Rainer | de |
| dc.contributor.author | Marwedel, Peter | de |
| dc.date.accessioned | 2004-12-06T12:57:08Z | |
| dc.date.available | 2004-12-06T12:57:08Z | |
| dc.date.created | 1997 | de |
| dc.date.issued | 1998-07-04 | de |
| dc.description.abstract | This paper addresses instruction-level parallelism in code generation for DSPs. In presence of potential parallelism, the task of code generation includes code compaction, which parallelizes primitive processor operations under given dependency and resource constraints. Furthermore, DSP algorithms in most cases are required to guarantee real-time response. Since the exact execution speed of a DSP program is only known after compaction, real-time constraints should be taken into account during the compaction phase. While previous DSP code generators rely on rigid heuristics for compaction, we propose a novel approach to exact local code compaction based on an Integer Programming model, which handles time constraints. Due to a general problem formulation, the IP model also captures encoding restrictions and handles instructions having alternative encodings and side effects, and therefore applies to a large class of instruction formats. Capabilities and limitations of our approach are discussed for different DSPs. | en |
| dc.format.extent | 259691 bytes | |
| dc.format.extent | 269435 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/2003/2754 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-7697 | |
| dc.language.iso | en | de |
| dc.publisher | Universität Dortmund | de |
| dc.subject.ddc | 004 | de |
| dc.title | Time-Constrained Code Compaction for DSPs | en |
| dc.type | Text | de |
| dc.type.publicationtype | conferenceObject | |
| dcterms.accessRights | open access |