Optimal Synthesis of Finite State Machines with Universal Gates using Evolutionary Algorithm
|
Full Text |
Pdf |
|
Author |
Noor Ullah, Khawaja M.Yahya, Irfan Ahmed
|
|
ISSN |
2079-8407 |
|
On Pages
|
464-469
|
|
Volume No. |
5
|
|
Issue No. |
6
|
|
Issue Date |
July 1, 2014 |
|
Publishing Date |
July 1, 2014 |
|
Keywords |
Cartesian Genetic Programming, Finite State Machines, Genetic Algorithms.
|
Abstract
This work presents an optimization method for the synthesis of finite state machines. The focus is on the reduction in the on-chip area and the cost of the circuit. A list of finite state machines from MCNC91 benchmark circuits have been evolved using Cartesian Genetic Programming. On the average, almost 30% of reduction in the total number of gates has been achieved. The effects of some parameters on the evolutionary process have also been discussed in the paper.
Back