CALCULATION OF THE MINIMUM PATH LENGTH WIRE IN THE PRINTED WIRING TOPOLOGICAL ROUTING

Yuri Popov, Sergey Popov

2012 , VOLUME 12, NUMBER 6 ( November-December )

ISSN 2226-1494 (print), ISSN 2500-0373 (online)

Publications

Editor-in-Chief

Nikiforov
Vladimir O.
D.Sc., Prof.

Partners

CALCULATION OF THE MINIMUM PATH LENGTH WIRE IN THE PRINTED WIRING TOPOLOGICAL ROUTING

Y. Popov, S. Popov

Read the full article

Abstract

There is a problem to calculate the path (shape) of a wire by its topological path in the topological approach to the wire routing. An algorithm which calculates the minimum length path of the wire considering design rules is proposed. The algorithm is used for wire shapes calculation in TopoR electronic design automation.

Keywords: EDA, automatic routing, topological routing

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License