An Experimental Study Of Combinational Logic Circuit Minimization Using Firefly Algorithm
Combinatorial logic circuit minimization is usualy done using Karnaugh’s Map or Bolean equation. This paper presents an aplication of Firefly Algorithm to design combinational logic circuit in which the objective function is to minimize the total number of gates used. Then, the algorithm is benchmar...
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/7831/ http://umpir.ump.edu.my/id/eprint/7831/1/An_Experimental_Study_Of_Combinational_Logic_Circuit_Minimization_Using_Firefly_Algorithm.pdf |
| Summary: | Combinatorial logic circuit minimization is usualy done using Karnaugh’s Map or Bolean equation. This paper presents an aplication of Firefly Algorithm to design combinational logic circuit in which the objective function is to minimize the total number of gates used. Then, the algorithm is benchmarked with other literatures. Result indicates that it able to find optimal solution but further analysis is required for a more complex combinatorial ogic circuit minimization |
|---|