Combinational and sequential logic optimisation using genetic algorithms

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