基于图克隆选择算法的组合逻辑电路自动合成

2009 International Conference on Artificial Intelligence and Computational Intelligence Pub Date : 2009-11-07 DOI:10.1109/AICI.2009.267

Zhaohui Gan, Gang Shi, Tao Shang

{"title":"基于图克隆选择算法的组合逻辑电路自动合成","authors":"Zhaohui Gan, Gang Shi, Tao Shang","doi":"10.1109/AICI.2009.267","DOIUrl":null,"url":null,"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.","PeriodicalId":289808,"journal":{"name":"2009 International Conference on Artificial Intelligence and Computational Intelligence","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Automatic Synthesis of Combinational Logic Circuits with Graph-Based Clonal Selection Algorithm\",\"authors\":\"Zhaohui Gan, Gang Shi, Tao Shang\",\"doi\":\"10.1109/AICI.2009.267\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":289808,\"journal\":{\"name\":\"2009 International Conference on Artificial Intelligence and Computational Intelligence\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Artificial Intelligence and Computational Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AICI.2009.267\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Artificial Intelligence and Computational Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICI.2009.267","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种新的基于图的克隆选择算法(GCSA)，用于组合逻辑电路的自动合成。该方法采用了一种柔性电路表达式和一组新颖的图算子。GCSA不仅可以保持种群中图结构的高度多样性，而且可以显示出令人满意的组合逻辑电路设计性能，本文的一些例子说明了这一点。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 International Conference on Artificial Intelligence and Computational Intelligence

自引率

0.00%

发文量