By Topic

The Automatic Synthesis of Combinational Logic Circuits with Graph-Based Clonal Selection Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhaohui Gan ; Coll. of Inf. Sci. & Eng., Wuhan Univ. of Sci. & Technol., Wuhan, China ; Gang Shi ; Tao Shang

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.

Published in:

Artificial Intelligence and Computational Intelligence, 2009. AICI '09. International Conference on  (Volume:1 )

Date of Conference:

7-8 Nov. 2009