Open AccessProceedings Article
The 60° grid: routing channels in width d/√3.
Kris D. Powers,Donna J. Brown,Martin L. Brady +2 more
- pp 214-219
Reads0
Chats0
TLDR
This work presents two nearoptimal channel routing algorithms for a channel routing problem with density d, where the availability of the diagonal tracks leads to a lower bound of $:.Abstract:
The 60" grid consists of vertical columns and diagonal tracks running at slopes of 2 30". This model offers a potentially large reduction in channel width, without resorting to wire overlap. For a channel routing problem with density d, the availability of the diagonal tracks leads to a lower bound of $: We present two nearoptimal channel routing algorithms. The first uses 5read more
Citations
More filters
Patent
Non-orthogonal structures and space tiles for layout, placement, and routing of an integrated circuit
Steven Lee Pucci,Eric Nequist +1 more
TL;DR: In this article, a single type of structure is maintained that can be used to store or track a polygon of any shape, as long as the shape possesses a supported number of sides.
Patent
Method and mechanism for implementing tessellation-based routing
David Chyan,Satish Raj +1 more
TL;DR: In this article, a tessellation-based routing of objects on an integrated circuit layout can be performed by identifying a spacing rule, forming one or more plane figures in the TESsellation, and identifying a routing path along at least part of the one or several edges compliant with the spacing rule.
Patent
Maximum flow analysis for electronic circuit design
TL;DR: In this paper, improved methods and mechanisms for congestion and maximum flow analysis for routing an integrated circuit design are presented. But the authors do not discuss the performance of their methods. But they do not address the impact of the number of edges in the flow graph on the maximum flow.
Patent
Nearest neighbor mechanism
TL;DR: In this paper, a method of analyzing a design of an electronic circuit may include selecting a query object in a collection of sets of intervals for the design, where each set of intervals along a first common axis, the collection of set along a second common axis.
Patent
Shape abstraction mechanism
TL;DR: In this article, a hierarchy of shadow instances having a plurality of levels is generated, where each shape instance corresponds to one of the shape occurrences and each shadow instance is associated with a shape instance.
References
More filters
Circuit layout
TL;DR: A general overview of circuit layout, taking a unified approach to various styles of integrated circuits, printed circuit boards, and hybrid circuits, and problems associated with the implementation of a hierarchical system are discussed.
Journal ArticleDOI
Wirability of knock-knee layouts with 45 degrees wires
TL;DR: In this paper, the problem of wiring an arbitrary knock-knee layout (in a square grid with an arbitrary number of modules) in three and two layers using a small number of vias is investigated.
Journal ArticleDOI
A Unified Approach to Layout Wirability
TL;DR: A systematic approach to the problem of wiring planar knock-knee mode layouts is presented and a unified framework that also applies to layouts using grids that are more general than the usual square grid is developed.
Journal ArticleDOI
A preliminary study of a diagonal channel-routing model
TL;DR: The layout of two-terminal nets in a VLSI channel is realized in a new diagonal channel-routing model (DCRM), where the tracks are segments respectively displayed at +45 ° and −45 ° on the two layers of the channel.
Journal ArticleDOI
Routing in times square mode
TL;DR: It is proved that this channel routing model, times square mode, can be wired in three or four layers, and given a condition, testable in polynomial time, to decide the number of layers needed.
Related Papers (5)
Efficient iterative, gridless, cost-based fine router for computer controlled integrated circuit design
Robi Dutta,Ravi Rao,Ashok Vittal +2 more