Abstract
Proposes a parallel, analog approach for the construction of a minimum rectilinear Steiner tree (MRST), which intuitively shrinks a bubble around the pins of the signal net until a Steiner tree topology is induced. This method maps well to parallel neural-style architectures, as well as to fairly generic two-dimensional array topologies. The author describes the basic approach along with extensive preliminary simulation results which show better performance than existing MRST approaches (i.e., almost 10% average improvement over minimum spanning tree cost). The result is of practical interest for VLSI CAD applications, and is an instance where an analog heuristic for an NP-complete problem outperforms existing combinatorial methods, both in time complexity and average-case performance. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
