On Evolutionary Algorithms for Boolean Functions Minimization

被引:0
作者
Ilyin, B. [1 ]
Kazimirov, A. S. [1 ]
Panteleyev, V. I. [1 ]
Reimerov, S. Yu. [1 ]
Semicheva, N. [1 ]
机构
[1] Irkutsk Statue Univ, Inst Math Econ & Informat, Irkutsk, Russia
来源
PROCEEDINGS OF 2017 XX IEEE INTERNATIONAL CONFERENCE ON SOFT COMPUTING AND MEASUREMENTS (SCM) | 2017年
关键词
evolutionary algorithms; genetic algorithms; Boolean functions; ESOP; SEARCH;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper concerns evolutionary algorithms for minimization exclusive-or sum-of-products representations of Boolean functions. These representations are used in logic synthesis for certain class of circuits. Minimization is based on a decomposition for Boolean functions with parameter function. Selection of this function is a search task which can be solved with evolutionary algorithms. Algorithms for obtaining approximately minimal formulas for Boolean functions of up to 8 variables are proposed.
引用
收藏
页码:400 / 402
页数:3
相关论文
共 50 条