Abstract
Neural networks have been successfully applied to many combinatorial optimization problems. However, applying this technique in the integrated circuit routing problem has yet to be investigated. This paper proposes a modified Hopfield network to solve the global routing problem, which has been proven to be NP-complete. This network is constructed of two layers of neurons. One layer is used for reducing the interconnection wire length and the other layer is used for channel capacity enforcement. The operation and theory under this design are thoroughly discussed and a software simulator will be implemented to monitor the performance of this network. On the average, an approximate 20% total wire length reduction of randomly generated data is obtained.
Sign-in/Register to access full text options 
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.
