Evolutionary design of combinational logic circuits
This paper proposes a genetic algorithm for designing combinational logic circuits and studies four different case examples: 2-to-1 multiplexer, one-bit full adder, four-bit parity checker and a two-bit multiplier. The objective of this work is to generate a functional circuit with the minium number...
Main Author: | |
---|---|
Other Authors: | , |
Format: | article |
Language: | eng |
Published: |
2019
|
Subjects: | |
Online Access: | http://hdl.handle.net/10400.22/13499 |
Country: | Portugal |
Oai: | oai:recipp.ipp.pt:10400.22/13499 |
Summary: | This paper proposes a genetic algorithm for designing combinational logic circuits and studies four different case examples: 2-to-1 multiplexer, one-bit full adder, four-bit parity checker and a two-bit multiplier. The objective of this work is to generate a functional circuit with the minium number of gates. |
---|