Optimal aspect ratios of building blocks in VLSI
暂无分享,去创建一个
A discussion is presented of the problem of selecting an optimal implementation for each building block so that the area of the final layout is minimised. A polynomial algorithm that solves this problem for slicing floorplans was presented elsewhere, and it has been proved that for general (nonslicing) floorplans the problem is NP-complete. The authors suggest a branch-and-bound algorithm which proves to be very efficient and can handle successfully large general nonslicing floorplans. They show also how the nonslicing and slicing algorithms can be combined to handle very large general floorplans efficiently.<<ETX>>
[1] Israel Koren,et al. Floorplans, planar graphs and layouts , 1988 .
[2] Larry J. Stockmeyer,et al. Optimal Orientations of Cells in Slicing Floorplan Designs , 1984, Inf. Control..
[3] Eugene L. Lawler,et al. The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..
[4] Maciej J. Ciesielski,et al. Digraph Relaxation for 2-Dimensional Placement of IC Blocks , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.