Article Free Access Share on Optimal graph constraint reduction for symbolic layout compaction Authors: Peichen Pan View Profile , Sai-keung Dong View Profile , C. L. Liu View Profile Authors Info & Claims DAC '93: Proceedings of the 30th international Design Automation ConferenceJuly 1993Pages 401–406https://doi.org/10.1145/157485.164950Published:01 July 1993Publication History 3citation291DownloadsMetricsTotal Citations3Total Downloads291Last 12 Months14Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Publisher SiteeReaderPDF

The authors propose an algorithm for solving the channel routing problem that arises in QCL (quickly customized logic) technology. Routing in the upper and lower regions of the channel is handled by the algorithms UPPER and LOWER, respectively. All patterns are systematically examined one by one until a routing solution is found. Little computational time is used in determining the routability of each pattern. Consequently, the total running time is reasonable even when a large number of patterns are to be examined. Experimental results are given.>

The authors propose a simple and fast iterative improvement algorithm for solving the constrained floorplan design problem. The algorithm allows users to specify an aspect ratio for the bounding rectangle and constraints on the relative positions and separation requirements of blocks. In the first phase of the algorithm, two scaling factors for each flexible block are computed for adjusting the block dimensions iteratively. In the second phase, blocks are placed according to the constraint graphs. If no overlaps are detected, the algorithm stops; otherwise an edge is inserted into one of the constraint graphs to resolve the overlap between one pair of blocks. The algorithm then goes back to the first phase. Experimental results show that this algorithm tends to achieve the prespecified overall aspect ratio and produces floorplans with small overall area.>