By Topic

Multiple constrained folding of programmable logic arrays by simulated annealing

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)
Ballesteros, J. ; Dpto. Inf., Extremadura Univ., Caceres, Spain ; Sanchez, J.M.

The PLA (programmable logic array) topological optimization problem is dealt with using folding techniques. Multiple unconstrained column folding is considered and this problem is solved using the simulated annealing algorithm. This algorithm is then extended to handle several types of constraints. Multiple constrained folding problems are solved using bipartite graphs. This allows the system to move only into a set of valid solutions. Comments are made concerning the experimental results obtained in the algorithm execution

Published in:

Electrotechnical Conference, 1991. Proceedings., 6th Mediterranean

Date of Conference:

22-24 May 1991