DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
A timing-constrained algorithm for simultaneous global routing of multiple nets
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
DAC '76 Proceedings of the 13th Design Automation Conference
Length-Matching Routing for High-Speed Printed Circuit Boards
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
TIGER: an efficient timing-driven global router for gate array and standard cell layout design
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Efficient Algorithms for Channel Routing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A New Symbolic Channel Router: YACR2
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Provably good performance-driven global routing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Matching-based methods for high-performance clock routing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Recent research development in PCB layout
Proceedings of the International Conference on Computer-Aided Design
Post-route refinement for high-frequency PCBs considering meander segment alleviation
Proceedings of the 23rd ACM international conference on Great lakes symposium on VLSI
Post-route alleviation of dense meander segments in high-performance printed circuit boards
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.00 |
In VLSI layout design, certain nets in a given net set are required to propagate their signals within a tolerable skew of delays. Though the delay of the signal on a wire is determined by a complex environment, it is hard to satisfy this requirement unless all the concerned nets are routed within a certain skew of length. In this paper, we propose L-equidistance routing, which routes the concerned nets with a prescribed length L. After a basic technique of L-equidistance routing of a single 1-sink net, an algorithm is presented for the channel routing of plural multi-sink nets. The key idea is in the symmetric-slant grid interconnect scheme by which the problem is reduced to a grid routing problem. In L-equidistance routing of a channel, the total length of a n-sink net is not unique for n=3. An algorithm based on dynamic programming to solve this minimization problem is presented. Then, L-equidistance switch-box routing is discussed based on the L-equidistance channel routing. Algorithms are explained on the Euclidean space. But it is shown that a straightforward transformation of the routes to those on the Manhattan grid is possible keeping the property of equidistance. The proposing channel routing algorithm was implemented and applied to random data to demonstrate their ability.