Skip to main content

Research Repository

Advanced Search

State assignment for sequential circuits using multi-objective genetic algorithm

Al-Jassani, ban Adil; Urquhart, Neil B; Almaini, A E A


ban Adil Al-Jassani

A E A Almaini


In this study, a new approach using a multi-objective genetic algorithm (MOGA) is proposed to determine the optimal state assignment with less area and power dissipations for completely and incompletely specified sequential circuits. The goal is to find the best assignments which reduce the component count and switching activity. The MOGA employs a Pareto ranking scheme and produces a set of state assignments, which are optimal in both objectives. The ESPRESSO tool is used to optimise the combinational parts of the sequential circuits. Experimental results are given using a personal computer with an Intel CPU of 2.4 GHz and 2 GB RAM. The algorithm is implemented using C++ and fully tested with benchmark examples. The experimental results show that saving in components and switching activity are achieved in most of the benchmarks tested compared with recent published research.


Al-Jassani, B. A., Urquhart, N. B., & Almaini, A. E. A. (2011). State assignment for sequential circuits using multi-objective genetic algorithm. IET Computers and Digital Techniques, 5, 296-305.

Journal Article Type Article
Publication Date 2011-07
Deposit Date May 31, 2011
Publicly Available Date Jul 31, 2011
Print ISSN 1751-8601
Electronic ISSN 1751-861X
Publisher Institution of Engineering and Technology (IET)
Peer Reviewed Peer Reviewed
Volume 5
Pages 296-305
Keywords multiobjective genetic algorithm; component count; switching activity; Pareto ranking scheme; state assignments; ESPRESSO tool; combinational parts; power dissipations; incompletely specified sequential circuits; completely specified sequential circuits
Public URL
Publisher URL


You might also like

Downloadable Citations