By Topic

Combinational and sequential logic optimisation using genetic algorithms

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 $31
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)
Miller, J.F. ; Napier Univ., UK ; Thomson, P.

This paper reviews our recent work in logic optimisation using genetic algorithms (GAs). We have applied GAs to optimisation of combinational and sequential logic, namely: the minimisation of fixed polarity Reed-Muller (RM) expansions, the minimisation of exclusive-OR sum-of-products (ESOP) expansions, and the determination of optimal state assignments for finite or algorithmic state machines (FSMs and ASMs). We present a brief discussion of each of these problems, the manner in which we have employed GAs to tackle them, and comparisons with heuristic techniques

Published in:

Genetic Algorithms in Engineering Systems: Innovations and Applications, 1995. GALESIA. First International Conference on (Conf. Publ. No. 414)

Date of Conference:

12-14 Sep 1995