A BDD-based frontend for retargetable compilers
暂无分享,去创建一个
[1] Kazutoshi Wakabayashi,et al. Global scheduling independent of control dependencies based on condition vectors , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.
[2] Rainer Leupers,et al. Instruction set extraction from programmable structures , 1994, EURO-DAC '94.
[3] Lehrstuhl Informatik Xii. The MIMOLA Language Version 4.1 , 1994 .
[4] A. Knoll,et al. Translating Signal Flowcharts into Microcode for Custom Digital Signal Processors , 1993 .
[5] Peter Marwedel,et al. Verification of Hardware Descriptions by Retargetable Code Generation , 1989, 26th ACM/IEEE Design Automation Conference.
[6] M. Morris Mano,et al. Computer system architecture , 1982 .
[7] Peter Marwedel,et al. Tree-based mapping of algorithms to predefined structures , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).
[8] T. C. May,et al. Instruction-set matching and selection for DSP and ASIP code generation , 1994, Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC.
[9] Randal E. Bryant,et al. Efficient implementation of a BDD package , 1991, DAC '90.
[10] Peter Marwedel,et al. MSSV: Tree-Based Mapping of Algorithms to Prede ned Structures (Extended Version) , 1993 .
[11] Viraphol Chaiyakul,et al. High-Level Transformations for Minimizing Syntactic Variances , 1993, 30th ACM/IEEE Design Automation Conference.
[12] Minjoong Rim,et al. Representing conditional branches for high-level synthesis applications , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.