Partitioning and Placement Technique for CMOS Gate Arrays
暂无分享,去创建一个
[1] H. Kuhn. The Hungarian method for the assignment problem , 1955 .
[2] Leon Steinberg,et al. The Backboard Wiring Problem: A Placement Algorithm , 1961 .
[3] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[4] Roy L. Russo,et al. On a Pin Versus Block Relationship For Partitions of Logic Graphs , 1971, IEEE Transactions on Computers.
[5] Ernst G. Ulrich,et al. Clustering and linear placement , 1972, DAC '72.
[6] Gotaro Odawara,et al. Arbitrarily-Sized Module Location Technique in the LOP System , 1982, DAC 1982.
[7] R. Otten. Automatic Floorplan Design , 1982, DAC 1982.
[8] Hidekazu Terai,et al. Automatic Placement Algorithms for High Packing density VLSI , 1983, 20th Design Automation Conference Proceedings.
[9] M. Iachponi,et al. A Hierarchical Gate Array Architecture and Design Methodology , 1985, DAC 1985.
[10] R. Dutton,et al. An Analytical Algorithm for Placement of Arbitrarily Sized Rectangular Blocks , 1985, DAC 1985.
[11] H. Kitazawa,et al. An Integrated Design Automation System for VLSI Circuits , 1985, IEEE Design & Test of Computers.