CAFE Router : A Fast Connectivity Aware Multiple Nets Routing Algorithm for Routing Grid with Obstacles

スポンサーリンク

概要

• 論文の詳細を見る

• Due to the increase of operation frequency in recent LSI systems, signal propagation delays are required to achieve specifications with very high accuracy. In order to achieve the severe requirements, signal propagation delay is taken into account in the routing design of PCB (Printed Circuit Board). In the routing design of PCB, the controllability of wire length is often focused on since it enables us to control the routing delay. In this paper, we propose CAFE router which obtains routes of multiple nets with target wire lengths for single layer routing grid with obstacles. CAFE router extends the route of each net from a terminal to the other terminal greedily so that the wire length of the net approaches its target wire length. Experiments show that CAFE router obtains the routes of nets with small length error in short time.

• 2010-12-01

著者

• Takahashi Atsushi

  Graduate School Of Engineering Osaka University

• Takahashi Atsushi

  Faculty of Engineering, Tokyo Institute of Technology

• Kohira Yukihide

  School Of Computer Science And Engineering The University Of Aizu

• Kohira Yukihide

  School Of Computer Sci. And Engineering The Univ. Of Aizu

• Takahashi Atsushi

  Graduate School Of Engineering Osaka Univ.

関連論文

• A-3-10 Top Layer Plating Lead Maximization for BGA Packages
• A Clustering Based Fast Clock Schedule Algorithm for Light Clock-Trees(Special Section on VLSI Design and CAD Algorithms)
• Routability Driven Via Assignment Method for 2-Layer Ball Grid Array Packages
• MILP-Based Efficient Routing Method with Restricted Route Structure for 2-Layer Ball Grid Array Packages
• Gate-Level Register Relocation in Generalized Synchronous Framework for Clock Period Minimization(Selected Papers from the 19th Workshop on Circuits and Systems in Karuizawa)
• A Fast Longer Path Algorithm for Routing Grid with Obstacles Using Biconnectivity Based Length Upper Bound
• Minimal Forbidden Minors for the Family of Graphs with Proper-Path-Width at Most Two
• Universal Graphs for Graphs with Bounded Path-Width
• Schedule-Clock-Tree Routing for Semi-Synchronous Circuits (Special Section on VLSI Design and CAD Algorithms)
• Optimal Time-Multiplexing in Inter-FPGA Connections for Accelerating Multi-FPGA Prototyping Systems
• CAFE Router : A Fast Connectivity Aware Multiple Nets Routing Algorithm for Routing Grid with Obstacles
• A Fast Clock Scheduling for Peak Power Reduction in LSI
• Minimization of Delay Insertion in Clock Period Improvement in General-Synchronous Framework
• A-3-4 Optimal Register Merging Method after Register Relocation in Semi-Synchronous Framework
• A Via Assignment and Global Routing Method for 2-Layer Ball Grid Array Packages(Discrete Mathematics and Its Applications)
• Routability Driven Via Assignment and Routing for 2-Layer Ball Grid Array Packages
• Routing of Monotonic Parallel and Orthogonal Netlists for Single-Layer Ball Grid Array Packages(Physical Design,VLSI Design and CAD Algorithms)
• Clock Period Minimization Method of Semi-Synchronous Circuits by Delay Insertion(Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)
• A Semi-Synchronous Circuit Design Method by Clock Tree Modification(Special Section on VLSI Design and CAD Algorithms)
• Clock Schedule Design for Minimum Realization Cost (Special Section on VLSI Design and CAD Algorithms)
• Clock Period Minimization of Semi-Synchronous Circuits by Gate-Level Delay Insertion (Special Section on VLSI Design and CAD Algorithms)
• Cost-Radius Balanced Spanning/Steiner Trees (Special Section on Discrete Mathematics and Its Applications)
• Practical Fast Clock-Schedule Design Algorithms(Selected Papers from the 18th Workshop on Circuits and Systems in Karuizawa)
• Low Area Pipelined Circuits by the Replacement of Registers with Delay Elements(Circuit Synthesis,VLSI Design and CAD Algorithms)
• Multi-Clock Cycle Paths and Clock Scheduling for Reducing the Area of Pipelined Circuits(System Level Design,VLSI Design and CAD Algorithms)
• Routability Driven Via Assignment and Routing for 2-Layer Ball Grid Array Packages (デザインガイア2006--VLSI設計の新しい大地を考える研究会)
• Routability Driven Via Assignment and Routing for 2-Layer Ball Grid Array Packages (デザインガイア2006--VLSI設計の新しい大地を考える研究会)
• Flow Control Scheme Using Adaptive Receiving Opportunity Control for Wireless Multi-Hop Networks
• Single-Layer Trunk Routing Using Minimal 45-Degree Lines
• FOREWORD

もっと見る 閉じる

スポンサーリンク