Abstract
A new Graph-Based Clonal Selection Algorithm (GCSA) is proposed, which is applied to the automatic synthesis of combinational logic circuits. The new method applies a flexible circuit expression as well as a set of novel graph operators. GCSA could not only remain a high diversity of graph structures in a population, but also could demonstrate a satisfying performance of combinational logic circuit design, which is revealed by some examples in this paper.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
