Single-Layer Trunk Routing Using Minimal 45-Degree Lines
スポンサーリンク
概要
- 論文の詳細を見る
In recent Printed Circuit Boards (PCB), the design size and density have increased, and the improvement of routing tools for PCB is required. There are several routing tools which generate high quality routing patterns when connection requirement can be realized by horizontal and vertical segments only. However, in high density PCB, the connection requirements cannot be realized when only horizontal and vertical segments are used. Up to one third nets can not be realized if no non-orthogonal segments are used. In this paper, a routing method for a single-layer routing area that handles higher density designs in which 45-degree segments are used locally to relax the routing density is introduced. In the proposed method, critical zones in which non-orthogonal segments are required in order to realize the connection requirements are extracted, and 45-degree segments are used only in these zones. By extracting minimal critical zones, the other area that can be used to improve the quality of routing pattern without worry about connectivity issues is maximized. Our proposed method can utilize the routing methods which generate high quality routing pattern even if they only handle horizontal and vertical segments as subroutines. Experiments show that the proposed method analyzes a routing problem properly, and that the routing is realized by using 45-degree segments effectively.
- 2011-12-01
著者
-
Shinoda Kyosuke
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Kohira Yukihide
School Of Computer Sci. And Engineering The Univ. Of Aizu
-
Takahashi Atsushi
Graduate School Of Engineering Osaka Univ.
関連論文
- A Clustering Based Fast Clock Schedule Algorithm for Light Clock-Trees(Special Section on VLSI Design and CAD Algorithms)
- MILP-Based Efficient Routing Method with Restricted Route Structure for 2-Layer Ball Grid Array Packages
- A Fast Longer Path Algorithm for Routing Grid with Obstacles Using Biconnectivity Based Length Upper Bound
- CAFE Router : A Fast Connectivity Aware Multiple Nets Routing Algorithm for Routing Grid with Obstacles
- A Semi-Synchronous Circuit Design Method by Clock Tree Modification(Special Section on VLSI Design and CAD Algorithms)
- Practical Fast Clock-Schedule Design Algorithms(Selected Papers from the 18th Workshop on Circuits and Systems in Karuizawa)
- Flow Control Scheme Using Adaptive Receiving Opportunity Control for Wireless Multi-Hop Networks
- Single-Layer Trunk Routing Using Minimal 45-Degree Lines