Conflict Modelling and Instruction Scheduling in Code Generation for In-House DSP Cores
- 1 December 1995
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the 39th conference on Design automation - DAC '02
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Execution interval analysis under resource constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Tree-based mapping of algorithms to predefined structuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Instruction-set matching and selection for DSP and ASIP code generationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Instruction set definition and instruction selection for ASIPsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Data routing: a paradigm for efficient data-path synthesis and code generationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- NEAT: an object oriented high-level synthesis interfacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Exact scheduling strategies based on bipartite graph matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient code generation for in-house DSP-coresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Software scheduling in the co-synthesis of reactive real-time systemsPublished by Association for Computing Machinery (ACM) ,1994
- Two Algorithms for Bipartite GraphsJournal of the Society for Industrial and Applied Mathematics, 1963