Modelling and optimisation algorithm for length-matching escape routing of differential pairs

Tai Hung Li*, Jwu E. Chen, Tai Chen Chen, Chien-Nan Liu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)603-605
Number of pages3
JournalElectronics Letters
Volume55
Issue number10
DOIs
StatePublished - 1 Jan 2019

Fingerprint Dive into the research topics of 'Modelling and optimisation algorithm for length-matching escape routing of differential pairs'. Together they form a unique fingerprint.

Cite this