Modelling and optimisation algorithm for length‐matching escape routing of differential pairs
| Autor: | Chien-Nan Jimmy Liu, Tai Chen Chen, Jwu E. Chen, Tai Hung Li |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Matching (graph theory)
Computer science 020208 electrical & electronic engineering 0202 electrical engineering electronic engineering information engineering Network routing Optimisation algorithm 02 engineering and technology Electrical and Electronic Engineering Differential (infinitesimal) Routing (electronic design automation) Algorithm |
| Zdroj: | Electronics Letters. 55:603-605 |
| ISSN: | 1350-911X 0013-5194 |
| Popis: | To improve the performance and signal integrity for printed circuit board designs, considering differential pairs in the escape routing is an important issue. Previous works use two-stage approaches, meeting points determining followed by differential pairs connecting, to generate a routing solution. However, existing approaches may produce either non-length-matching solutions or longer length-matching solutions. In this Letter, the authors propose an escape routing model with one-stage optimisation to simultaneously determine median points and route length-matching paths for all differential pairs. Experimental results show that their approach can significantly reduce maximum and average differential-pair skews with 100% length-matching results. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text