A Faster Compaction Algorithm with Automatic Jog Insertion

Formats Non-Member Member
$15 $15
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, books, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

In this paper we refine work of Maley [13] on one-dimensional compaction with automatic jog insertion. More precisely, we give an algorithm with running time O((n2 + k) log n), where k = O(n3) is a quantity which measures the difference between the input and the output sketch, and so improve upon Maley's O(n4) algorithm. The compaction algorithm takes as input a layout sketch; the wires in a layout sketch are flexible and only indicate the topology of the layout. The compacter minimizes the horizontal width of the layout whilst maintaining its routability. The exact geometry of the wires is filled in by a router after compaction.