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
Copyright 2001-2018 ©
Scientific and Technical Journal
of Information Technologies, Mechanics and Optics.
All rights reserved.

Яндекс.Метрика