Efficient code generation for in-house DSP-cores
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 244-249
- https://doi.org/10.1109/edtc.1995.470388
Abstract
A balance between efficiency and flexibility is obtained by developing a relative large number of in-house DSP-cores each for a relatively small application area. These cores are programmed using existing ASIC synthesis tools which are modified for this purpose. The key problem is to model conflicts arising from the instruction set. A class of instruction sets is defined for which conflicts can be modelled statically before scheduling. The approach is illustrated with a real life example.Keywords
This publication has 7 references indexed in Scilit:
- 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
- Data routing: a paradigm for efficient data-path synthesis and code generationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- PIRAMID: an architecture-driven silicon compiler for complex DSP applicationsPublished 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
- Automated generation of DSP program development tools using a machine description formalismPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- Architecture-driven synthesis techniques for VLSI implementation of DSP algorithmsProceedings of the IEEE, 1990