Indexed by:
Abstract:
To further study X-architecture and make full use of routing resources within the obstacle, an X-architecture Steiner minimum tree algorithm considering routing resource relaxation is proposed in this paper. Firstly, crossover and mutation operators are introduced in the update operation of particles to solve the discretization problem. Secondly, look-up tables are presented for the whole algorithm process to provide a fast information query. Thirdly, a corner point selection strategy is proposed to introduce some obstacle corner points and satisfy the constraints. Finally, a refinement strategy is implemented to further improve the quality of the final routing tree. Experimental results show that the proposed algorithm makes full use of the routing resources within the obstacle, shortens the total wirelength effectively and achieves a better total wirelength. © 2020, Science Press. All right reserved.
Keyword:
Reprint 's Address:
Email:
Source :
Pattern Recognition and Artificial Intelligence
ISSN: 1003-6059
Year: 2020
Issue: 5
Volume: 33
Page: 401-412
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count: 1
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 2
Affiliated Colleges: