Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Area(number)-balanced hierarchy of staircase channels with minimum crossing nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
4 Author(s)
Majumder, S. ; Astralsys Software (India) Pvt Ltd., Calcutta, India ; Sur-Kolay, S. ; Bhattacharya, B.B. ; Nandy, S.C.

We address the problem of hierarchically partitioning a VLSI floorplan F using monotone staircase channels to aid global routing. Our problem is to identify a monotone staircase channel (ms-cut) from one corner of F to its opposite corner, such that (i) the number of nets crossing the ms-cut is minimized, and (ii) the area (or the number of the blocks) of both the partitions are nearly equal. The problem is shown to be NP-hard, and a maxflow-based heuristic is proposed

Published in:

Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on  (Volume:5 )

Date of Conference:

2001