By Topic

On empty rooms in floorplan graphics: comments on a deficiency in two papers

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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Cai, H. ; Dept. of Electr. Eng., Delft Univ. of Technol., Netherlands

Floorplan graphs are used in many placement and routing systems for VLSI building-block layout. S. Kimura et al.(ibid., vol. CAD-2, p.285-92, Oct. 1983) and W.M. Dai (ibid., vol.CAD-4, p.189-97, July 1985) proposed algorithms to construct such a graph from a geometrical placement of the building blocks and to define a channel structure from the floorplan graph. In the absence of empty rooms in the floorplan graph the algorithms can correctly derive a channel definition and ordering from the graph. However, in the case that there are empty rooms present in the floorplan graph, neither algorithm can guarantee a correct solution. A counterexample is given to point out the deficiency. A correction to the RRDO algorithm given by Dai et al. is presented

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:8 ,  Issue: 7 )