An efficient algorithm for the net matching problem

Net matching is often critical for the correct performance of a circuit. We adopt a conservative design t o route all matched nets with identical topology and equal ware lengths in order to achieve zero skew. We formulate the problem as one special D-dimensional Steiner tree problem. An iterative improvement strate g y is used to generate the Steiner tree topology. We provide a more eficient method of computing the optimal Steiner point positions over the Linear Programming method of [l], involving a 45-degree rotation of the domain, and approximation metrics.