A network flow approach for simultaneous escape routing in PCB

Ali, Asad; Zeeshan, Muhammad; Anjum, Naveed

doi:10.1109/honet.2017.8102207

Cited by 5 publications

(6 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Quite recently, net ordering has been incorporated with the SER through proposal of a novel net ordering algorithm in order to reduce the running time (Sattar et al, 2017). Recently, we have proposed the solution to this problem through a network flow approach (Ali, Zeeshan & Naveed, 2017). We proposed the solution to this problem through a network flow approach where we introduced two different models; one is based on the links and called Link based routing, while the other is based on nodes and is called Nodes based routing.…”

Section: Related Workmentioning

confidence: 99%

“…Memory consumption is the main issue with the link based and node based routing proposed in our earlier work (Ali, Zeeshan & Naveed, 2017). There are large number of the variables used in those approaches and as the number of grid points increase, the memory consumption also increases.…”

Section: Addressing Link Based and Node Based Routing Issuesmentioning

confidence: 99%

“…The number of variables in the global routing model can be calculated a presented in Algorithm 2. The total number of the variables in both models is 100 which is equal to the number of variables used in the node based routing proposed in our previous study (Ali, Zeeshan & Naveed, 2017) but, these variables are divided among two models and are solved separately. Hence there is no issue of memory consumption and the end to end route with uniqueness is also ensured by the dual model node based routing.…”

Section: Addressing Link Based and Node Based Routing Issuesmentioning

confidence: 99%

“…Either too much time is consumed by these solutions or the achieved routability is less than acceptable percentage. In our recent study (Ali, Zeeshan & Naveed, 2017), we propose the solution to routability problem through a network flow approach where we introduce two different models; one is based on the links and second on nodes. They are introduced to solve SER problem in PCBs through optimization technique.…”

Section: Introductionmentioning

confidence: 99%

“…In this work, we extend our previous study (Ali, Zeeshan & Naveed, 2017) in order to solve both the problems including SER and area routing while considering time and routability constraints for smaller as well as larger grids. In our previous work, we did not consider larger grids.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A dual model node based optimization algorithm for simultaneous escape routing in PCBs

Ali

Anjum

Zeeshan

2021

PeerJ Computer Science

Self Cite

View full text Add to dashboard Cite

Simultaneous Escape Routing (SER) is the escaping of circuit pins simultaneously from inside two or more pin arrays. This is comparatively difficult as compared to routing in a single array and has not been addressed by previous studies. The increase in pin array complexity has made the manual SER in PCBs a very inefficient and tedious task and there surely is need for the automated routing algorithms. In this work, we propose network flow based optimal algorithm that uses integer linear program to solve SER problem and area routing problem in two stages. In the first stage, pins are escaped to the boundaries of pin arrays simultaneously. These escaped pins are connected with each other in the second stage. The proposed algorithm is tested for different benchmark sizes of grids and the results show that it is not only better in terms of routability but also outperforms existing state of the art algorithms in terms of time consumption. The existing algorithms either fails to achieve higher routability or have larger time complexities, whereas the proposed algorithm achieves 99.9% routability and is also independent of grid topology and component pin arrangement, which shows the superiority of proposed algorithm over the existing algorithms.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Addressing Link Based and Node Based Routing Issuesmentioning

confidence: 99%

Section: Addressing Link Based and Node Based Routing Issuesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations