A Bus Planning Algorithm for FPC Design in Complex Scenarios

Flexible printed circuit (FPC) design in complex scenarios has a list of pin concentration areas, which lead to extremely congested intersection regions while connecting the pins. Currently, it is challenging to explore the routability and to find topologically non-crossing and routable paths manually for the nets timely. The existing bus planning methods cannot offer optimal solutions concerning the special resource distribution of the FPC design. To investigate an effective way to shorten the routing time of FPC and achieve enhanced performance, a bus planning algorithm is proposed to tackle complex area connection problems. On the basis of the pin location information, the routing space is partitioned and generally represented as an undirected graph, and the topological non-crossing relationship between different regions is obtained using the dynamic pin sequence. Considering the routability and electrical constraints, a heuristic algorithm is proposed to search the optimal location of the crossing point on the region boundary. Experimental results on industrial cases show that the proposed algorithm realize better performance in terms of count and routability in comparison with numerous selected state-of-the-art router and methods.