Mapping the VLSI channel routing problem onto the Hopfield/tank network when cyclic vertical constraints are not excluded

This first proposed mapping for channels with cyclic vertical constraints uses a new representation scheme and optimized initial conditions. Implementation on massively parallel machines is advantageous because the applied theory of locally optimal breaking of cyclic vertical constraints provides multiple sets of near to optimal initial conditions. Using good quality initial conditions has enabled determination of multiple sets of network parameters which enable convergence to stable states on different channels. The current implementation converges fast on small and medium size channels.