Optimization of equational specifications using genetic techniques

Aitor Ibarra, J. Mendias, J. Lanchares, J. Hidalgo, R. Hermida
{"title":"Optimization of equational specifications using genetic techniques","authors":"Aitor Ibarra, J. Mendias, J. Lanchares, J. Hidalgo, R. Hermida","doi":"10.1109/DSD.2002.1115376","DOIUrl":null,"url":null,"abstract":"One of the goals of a high level synthesis process is to minimize the circuit implementation cost. Since the minimization problem associated with those transformations is NP complete, in this work we present an evolutionary algorithm that optimize circuit specifications by means of a special type of genetic operator. We have named this operator algebraic mutation, carried out with the help of algebraic equations. This work can be classified within the algebraic optimization of equational specifications of circuits by using genetic techniques. We have applied this technique to a simple circuit equational specification and to a much more complex algebraic equation. In the first case our algorithm simplifies the equation until the optimum specification is found and in the second a solution improving the former is always obtained, and when we increase the population size, the optimum solution is also found.","PeriodicalId":330609,"journal":{"name":"Proceedings Euromicro Symposium on Digital System Design. Architectures, Methods and Tools","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Euromicro Symposium on Digital System Design. Architectures, Methods and Tools","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSD.2002.1115376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

One of the goals of a high level synthesis process is to minimize the circuit implementation cost. Since the minimization problem associated with those transformations is NP complete, in this work we present an evolutionary algorithm that optimize circuit specifications by means of a special type of genetic operator. We have named this operator algebraic mutation, carried out with the help of algebraic equations. This work can be classified within the algebraic optimization of equational specifications of circuits by using genetic techniques. We have applied this technique to a simple circuit equational specification and to a much more complex algebraic equation. In the first case our algorithm simplifies the equation until the optimum specification is found and in the second a solution improving the former is always obtained, and when we increase the population size, the optimum solution is also found.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用遗传技术优化方程规范
高级合成过程的目标之一是使电路实现成本最小化。由于与这些变换相关的最小化问题是NP完全的,在这项工作中,我们提出了一种进化算法,该算法通过一种特殊类型的遗传算子来优化电路规格。我们将这个算子命名为代数变异,借助代数方程来实现。这项工作可以归类为利用遗传技术对电路的方程规格进行代数优化。我们已经将这种技术应用于一个简单的电路方程说明和一个更复杂的代数方程。在第一种情况下,我们的算法将方程简化,直到找到最优规格;在第二种情况下,我们总是得到一个改进前者的解,当我们增加种群规模时,我们也会找到最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fault latencies of concurrent checking FSMs On the fundamental design gap in terabit per second packet switching Bit-level allocation of multiple-precision specifications Improving mW/MHz ratio in FPGAs pipelined designs Hardware implementation of a memory allocator
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1