Gate-level optimization of polymorphic circuits using Cartesian genetic programming

  • Authors:
  • Zbysek Gajda;Lukas Sekanina

  • Affiliations:
  • Department of Computer Systems, Faculty of Information Technology, Brno University of Technology, Czech Republic;Department of Computer Systems, Faculty of Information Technology, Brno University of Technology, Czech Republic

  • Venue:
  • CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Polymorphic digital circuits contain ordinary and polymorphic gates. In the past, Cartesian Genetic Programming (CGP) has been applied to synthesize polymorphic circuits at the gate level. However, this approach is not scalable. Experimental results presented in this paper indicate that larger and more efficient polymorphic circuits can be designed by a combination of conventional design methods (such as BDD, Espresso or ABC System) and evolutionary optimization (conducted by CGP). Proposed methods are evaluated on two benchmark circuits - Multiplier/Sorter and Parity/Majority circuits of variable input size.