Evolutionary design of combinational circuits using Boolean function signatures

Abstract

In this paper, a novel single objective evolutionary algorithm (SOEA) for combinational circuit design is proposed. The approach uses Boolean function signatures (BFSs) to calculate fitness function (FF), and can be considered as a generalization of standard calculation of FF, which is based on Boolean Matching (BM). The performance of proposed algorithm is tested and verified on the representatives of 12 different classes of Boolean functions (BFs).