By Topic

Crossing distribution [circuit layout CAD]

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
$33 $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

2 Author(s)
D. C. Wang ; LSI Logic Corp., Milpitas, CA, USA ; C. B. Shung

The problem of distributing the set of crossings between two regions is studied. A crossing is defined as the intersection of two nets. Three types of crossing-distribution problems are considered: (1) the quota problem, (2) the membership problem, and (3) the combination problem, which is a combination of the quota and membership problems. The objective is to find a net ordering at the boundary between two regions such that the quota and membership problems are resolved, and the total number of crossings is minimized. The authors propose the use of computational geometry techniques for the solution of the quota problem in O(n log n) time, the use of a depth-first search to solve the membership in O(n2) time, and the use of a breadth-first search to solve the combination problem in O(n2 ) time, where n is the number of tests

Published in:

Design Automation Conference, 1992., EURO-VHDL '92, EURO-DAC '92. European

Date of Conference:

7-10 Sep 1992