VLSI Design

VLSI Design / 1999 / Article

Open Access

Volume 9 |Article ID 083648 | https://doi.org/10.1155/1999/83648

M. S. Krishnamoorthy, James R. Loy, John F. McDonald, "Optimal Differential Routing based on Finite State Machine Theory", VLSI Design, vol. 9, Article ID 083648, 13 pages, 1999. https://doi.org/10.1155/1999/83648

Optimal Differential Routing based on Finite State Machine Theory

Received11 Nov 1995
Revised31 Mar 1997


Noise margins in high speed digital systems continue to erode. Full differential signal routing provides a mechanism for deferring these effects. This paper proposes a three stage routing process for solving the adjacent placement routing problem of differential signal pairs, and proves that it is optimal. The process views differential pairs as logical nets; routes the logical nets; then bifurcates the result to achieve a physical realization. Finite state machine theory provides the critical theoretical underpinning and formal proof of correctness necessary for linear time bifurcation. Regular expressions map the theoretical solution to an appropriate implementation strategy that employs feature vectors for net recognition.

Copyright © 1999 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

More related articles

 PDF Download Citation Citation
 Order printed copiesOrder

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.