Abstract
A general method is described for solving the backboard-wiring problem. This problem is concerned with placing logic elements in an array of positions to minimise some function of the connection pattern such as total wire length. Any placement of the elements can be expressed as a permutation, and the proposed procedure determines a permutation which is optimal with respect to a given set of exchanges. It is thus possible to balance the quality of optimisation against the computational cost. The results show that simple sets of exchanges can offer marked improvements on a Monte Carlo search.
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 callMore From: Proceedings of the Institution of Electrical Engineers
Disclaimer: 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.
