| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 1.26 MB | Adobe PDF |
Advisor(s)
Abstract(s)
This paper proposes a genetic algorithm for designing combinational logic circuits and studies three different case examples: the one-bit full adder, the four-bit parity checker and the two-bit multiplier. The objective of this work is to generate a functional circuit with the minimum number of gates.
Description
Keywords
Circuit design Combinational circuits Genetic algorithms Computer-aided design
