An Experimental Study Of Combinational Logic Circuit Minimization Using Firefly Algorithm
Combinatorial logic circuit minimization is usually done using Karnaugh’s Map or Boolean equation. This paper presents an application 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 bench...
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | en |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://eprints.utem.edu.my/id/eprint/13783/1/004_CRUSC-17-21.pdf http://eprints.utem.edu.my/id/eprint/13783/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Combinatorial logic circuit minimization is usually done using Karnaugh’s Map or Boolean equation. This paper presents an application 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 logic circuit minimization.
|
|---|