Mobility based Net Ordering for Simultaneous Escape Routing

Abstract

With the advancement in electronics technology, number of pins under the ball grid array (BGA) are increasing on reduced size components. In small size components, a challenging task is to solve the escape routing problem where BGA pins escape towards the component boundary. It is often desirable to perform ordered simultaneous escape routing (SER) to facilitate area routing and produce elegant Printed Circuit Board (PCB) design. Some heuristic techniques help in finding the PCB routing solution for SER but for larger problems these are time consuming and produce sub-optimal results. This work propose solution which divides the problem into two parts. First, a novel net ordering algorithm for SER using network theoretic approach and then linear optimization model for single component ordered escape routing has been proposed. The model routes maximum possible nets between two components of the PCB by considering the design rules based on the given net ordering. Comparative analysis shows that the proposed net ordering algorithm and optimization model performs better than the existing routing algorithms for SER in terms of number of nets routed. Also the running time using proposed algorithm reduces to O(2NE=2) + O(2NE=2) for ordered escape routing of both components. This time is much lesser than O(2NE) due to exponential reduction.

Authors and Affiliations

Kashif Sattar, Aleksandar Ignjatovic, Anjum Naveed, Muhammad Zeeshan

Keywords

Related Articles

A Novel Method in Two-Step-Ahead Weight Adjustment of Recurrent Neural Networks: Application in Market Forecasting

Gold price prediction is a very complex nonlinear problem which is severely difficult. Real-time price prediction, as a principle of many economic models, is one of the most challenging tasks for economists since the con...

Design of Traffic Flow Simulation System to Minimize Intersection Waiting Time

This paper designs a traffic simulation system for minimizing intersection waiting time. We use SUMO simulator which is widely used as a traffic flow simulation tool for traffic flow simulation. Using the SUMO simulator...

A New Security Model for Web Browser Local Storage

In recent years, the web browser has taken over many roles of the traditional operating system, such as acting as a host platform for web applications. Web browser storage, where the web applications can save data locall...

Markovian Process and Novel Secure Algorithm for Big Data in Two-Hop Wireless Networks

This paper checks the correctness of our novel algorithm for secure, reliable and flexible transmission of big data in two-hop wireless networks using cooperative jamming scheme of attacker location unknown through Marko...

A Comparison of Predictive Parameter Estimation using Kalman Filter and Analysis of Variance

The design of a controller significantly improves if internal states of a dynamic control system are predicted. This paper compares the prediction of system states using Kalman filter and a novel approach analysis of var...

Download PDF file
  • EP ID EP260623
  • DOI 10.14569/IJACSA.2017.080762
  • Views 75
  • Downloads 0

How To Cite

Kashif Sattar, Aleksandar Ignjatovic, Anjum Naveed, Muhammad Zeeshan (2017). Mobility based Net Ordering for Simultaneous Escape Routing. International Journal of Advanced Computer Science & Applications, 8(7), 452-461. https://europub.co.uk/articles/-A-260623