A method for area estimation of data-path in high level synthesis
暂无分享,去创建一个
[1] Christos A. Papachristou,et al. A Layout Estimation Algorithm for RTL Datapaths , 1993, 30th ACM/IEEE Design Automation Conference.
[2] Fadi J. Kurdahi,et al. Evaluating layout area tradeoffs for high level applications , 1993, IEEE Trans. Very Large Scale Integr. Syst..
[3] Carl Sechen. AVERAGE INTERCONNECTION LENGTH ESTIMATION FOR RANDOM AND OPTIMIZED PLACEMENTS. , 1987 .
[4] Barry M. Pangrle. Splicer: a heuristic approach to connectivity binding , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..
[5] Alok Sharma,et al. Estimating architectural resources and performance for high-level synthesis applications , 1993, IEEE Trans. Very Large Scale Integr. Syst..
[6] Xinghao Chen,et al. A module area estimator for VLSI layout , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..
[7] Alok Sharma,et al. Register estimation from behavioral specifications , 1994, Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors.
[8] Massoud Pedram,et al. Accurate prediction of physical design characteristics for random logic , 1989, Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors.
[9] Rajiv Jain,et al. Predicting Area-Time Tradeoffs for Pipelined Design , 1987, 24th ACM/IEEE Design Automation Conference.
[10] S. M. Wu,et al. The IBM High-Level Synthesis System , 1991 .
[11] M. Fernandez,et al. Heuristics for branch-and-bound global attraction , 1992, Proceedings EURO-DAC '92: European Design Automation Conference.
[12] Fadi J. Kurdahi,et al. Techniques for area estimation of VLSI layouts , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[13] Román Hermida,et al. Heuristics for branch-and-bound global allocation , 1992, EURO-DAC '92.
[14] Jacob A. Abraham,et al. Average Interconnection Length and Interconnection Distribution Based on Rent's Rule , 1989, 26th ACM/IEEE Design Automation Conference.
[15] Roy L. Russo,et al. On a Pin Versus Block Relationship For Partitions of Logic Graphs , 1971, IEEE Transactions on Computers.
[16] Minjoong Rim,et al. Optimal and heuristic algorithms for solving the binding problem , 1994, IEEE Trans. Very Large Scale Integr. Syst..
[17] Donald E. Thomas,et al. Algorithmic and Register-Transfer Level Synthesis: The System Architect's Workbench , 1989 .
[18] Alice C. Parker,et al. Stochastic Models for Wireability Analysis of Gate Arrays , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[19] Srinivas Devadas,et al. Algorithms for hardware allocation in data path synthesis , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[20] Viraphol Chaiyakul,et al. Layout-area models for high-level synthesis , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.
[21] Nikil D. Dutt,et al. Comprehensive Lower Bound Estimation From Behavioral Descriptions , 1994, IEEE/ACM International Conference on Computer-Aided Design.