Layout compaction with minimized delay bound on timing critical paths
暂无分享,去创建一个
[1] David G. Boyer. Symbolic layout compaction review , 1988, DAC '88.
[2] D. Marple. A hierarchy preserving hierarchical compactor , 1990, 27th ACM/IEEE Design Automation Conference.
[3] I. Lin,et al. Performance-driven constructive placement , 1990, 27th ACM/IEEE Design Automation Conference.
[4] Chak-Kuen Wong,et al. An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints , 1983, 20th Design Automation Conference Proceedings.
[5] Hidetoshi Onodera,et al. An efficient algorithm for layout compaction problem with symmetry constraints , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[6] Jason Cong,et al. Provably good performance-driven global routing , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[7] Chak-Kuen Wong,et al. An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[8] Jonathan Allen,et al. Minplex - A Compactor that Minimizes the Bounding Rectangle and Individual Rectangles in a Layout , 1986, DAC 1986.
[9] Chak-Kuen Wong,et al. A performance-aimed cell compactor with automatic jogs , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..