By Topic

Using stochastic chaotic simulated annealing in the FPGA segmented channel routing problem

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
$31 $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)

Field programmable gate array (FPGA) segmented channel routing is a difficult combinatorial optimization problem. Neural networks have been successfully used to solve this problem. The Hopfield neural network (HNN) is easily stuck in local minimum but not global minimum, resulting in difficulties in finding the optional solution. This paper applies stochastic chaotic simulated annealing (SCSA) to the FPGA segmented channel routing problem (FSCRP) and compares the solutions of SCSA and the HNN.

Published in:

VLSI Design and Video Technology, 2005. Proceedings of 2005 IEEE International Workshop on

Date of Conference:

28-30 May 2005