Article ID: 2024EAP1144
Global routing is one of the most crucial steps for design closure in the physical design of VLSI. This paper proposes a routing algorithm, called UEO algorithm, for generalized channels to achieve a small local congestion which is mainly dedicated to global routing for CMOS circuits designed to match 3D bonding technology. In our generalized channel formulation, due to tight global horizontal routing capacity, the connection of a net is restricted to a single-trunk Steiner tree. Routing algorithms proposed for the generalized channel so far achieve a small total vertical wire length while achieving the minimum number of used tracks, but they do not take a local vertical congestion into account, and the completion of detailed routing may suffer from a large local vertical congestion. The proposed UEO algorithm iteratively determines the assignment of trunks of nets based on the net priority proposed in this paper to achieve a small local vertical congestion. In experiments, it is confirmed that UEO achieves a small local vertical congestion, and that this work contributes to achieve design closure of routing design for 3D VLSI.
