Time-constrained code compaction for DSPs
- 1 March 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 5 (1) , 112-122
- https://doi.org/10.1109/92.555991
Abstract
This paper addresses instruction-level parallelism in code generation for digital signal processors (DSPs). In the 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 (IP) 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.Keywords
This publication has 18 references indexed in Scilit:
- Automatic instruction code generation based on trellis diagramsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Optimal code generation for embedded memory non-homogeneous register architecturesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A BDD-based frontend for retargetable compilersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Storage assignment to decrease code sizePublished by Association for Computing Machinery (ACM) ,1995
- Conflict modelling and instruction scheduling in code generation for in-house DSP coresPublished by Association for Computing Machinery (ACM) ,1995
- Engineering a simple, efficient code-generator generatorACM Letters on Programming Languages and Systems, 1992
- Code Selection by Regularly Controlled Term RewritingPublished by Springer Nature ,1992
- Optimal VLSI Architectural SynthesisPublished by Springer Nature ,1992
- Optimal code generation for expression trees: an application BURS theoryPublished by Association for Computing Machinery (ACM) ,1988
- Symbolic Manipulation of Boolean Functions Using a Graphical RepresentationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985