By Topic

A chaotic neural network for the graph coloring problem in VLSI channel routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shenshen Gu ; Sch. of Comput. Eng. & Sci., Shanghai Univ., China ; Songnian Yu

We propose a chaotic neural network to solve the graph coloring problem, which is a classic NP-complete graph optimization problem. Since the graph coloring problem is consistent with the channel routing problem, a prominent problem in the physical design of VLSI chips, algorithms that can solve the graph coloring problem well can, inevitably, solve the channel routing problem effectively. From some detailed analyses, we reach the conclusion that, unlike the conventional Hopfield neural networks for the graph coloring problem, the chaotic neural network can avoid getting stuck into local minima and thus yields excellent solutions. Experimental results verify that the chaotic neural network provides a more effective approach than many other heuristic algorithms for the graph coloring problem, and thus has a profound application potential in VLSI channel routing.

Published in:

Communications, Circuits and Systems, 2004. ICCCAS 2004. 2004 International Conference on  (Volume:2 )

Date of Conference:

27-29 June 2004