Using Hopfield-type neural network model, we present an algorithm for reconstructing 3D mesh processor arrays using single-track switches where spare processors are laid on the six surfaces of a 3D array and show its ...
详细信息
Using Hopfield-type neural network model, we present an algorithm for reconstructing 3D mesh processor arrays using single-track switches where spare processors are laid on the six surfaces of a 3D array and show its effectiveness in terms of reconstruction rate and computing time by computer simulation. Next, we show how the algorithm can be realized by a digital neural circuit. It consists of subcircuits for finding candidate compensation paths, deciding whether the neural system reaches a stable state and at the time the system energy is minimum, and subcircuits for neurons. The subcircuit for each neuron including the other subcircuits can only be made with 16 gates and two flip-flops. Since the state transitions are done in parallel, the circuit will be able to find a set of compensation paths for a fault pattern very quickly within a time less than l mu s. Furthermore, the hardware implementation of the algorithm leads to making a self-reconfigurable system without the aid of a host computer.
A network of analog neurons to solve the Hamiltonian cycle problem (HCP) is described. This neural net is a modification of the network proposed by Hopfield to solve the traveling salesman problem (TSP). A result on t...
详细信息
A network of analog neurons to solve the Hamiltonian cycle problem (HCP) is described. This neural net is a modification of the network proposed by Hopfield to solve the traveling salesman problem (TSP). A result on the convergence of quasi-stationary flow and a bound for the strength of an inhibitory self-connection are presented. Results of successful experiments with graphs of up to 500 nodes are reported. The result of an experiment with the 318-city TSP is also reported. Contrary to intuition, the performance improves with the size of the graphs. The 20-node graphs fail to give consistent results for 10 % connectivity, while 400- and 500-node graphs were solved successfully
暂无评论