A sat based fitness function for evolutionary optimization of polymorphic circuits
Download
1 / 21

A SAT-based Fitness Function for Evolutionary Optimization of Polymorphic Circuits - PowerPoint PPT Presentation


  • 90 Views
  • Uploaded on

A SAT-based Fitness Function for Evolutionary Optimization of Polymorphic Circuits. Lukas Sekanina and Zdenek Vasicek. DATE’12. OUTLINE. 1. INTRODUCTION 2. POLYMORPHIC CIRCUITS 3. DIRECT EVOLUTION OF POLYMORPHIC CIRCUITS USING CGP

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' A SAT-based Fitness Function for Evolutionary Optimization of Polymorphic Circuits' - ulf


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
A sat based fitness function for evolutionary optimization of polymorphic circuits

A SAT-based Fitness Function for EvolutionaryOptimization of Polymorphic Circuits

Lukas Sekanina and ZdenekVasicek

DATE’12


Outline
OUTLINE

  • 1.INTRODUCTION

  • 2. POLYMORPHIC CIRCUITS

  • 3. DIRECT EVOLUTION OF POLYMORPHIC CIRCUITS USING CGP

  • 4. PROPOSED FITNESS EVALUATION FOR POLYMORPHIC CIRCUITS

  • 5.RESULTS

  • 6. CONCLUSIONS


Introduction
INTRODUCTION

  • Polymorphic gates were described by the NASA JPL evolvable hardware group in2001 [1]

  • Graphene reconfigurable logic devices, discovered at IBM T. J. Watson ResearchCenter, were presented in 2010[2].



Polymorphic circuits
POLYMORPHIC CIRCUITS

  • A.Polymorphic Multiplexing

    • In polymorphic multiplexing, we just connect the corresponding outputs of F1 and F2 by polymorphic multiplexers [5].


Polymorphic circuits1
POLYMORPHIC CIRCUITS

  • B.Polymorphic BDDs[5]

    • Terminal nodes can contain polymorphic logic functions.

    • Decision nodes are then implemented using standard multiplexers.


Polymorphic circuits2
POLYMORPHIC CIRCUITS

  • C.Evolutionary Approaches

    • Cartesian genetic programming (CGP)[11] can be seeded by a circuit created using polymorphic multiplexing or PolyBDDs and used to reduce the number of gates.

    • The method is applicable for small problem.


Direct evolution of polymorphic circuits using cgp
DIRECT EVOLUTION OF POLYMORPHIC CIRCUITSUSING CGP

  • Genetic Algorithm flow


Direct evolution of polymorphic circuits using cgp1
DIRECT EVOLUTION OF POLYMORPHIC CIRCUITSUSING CGP

  • CGP has been developed for circuit evolution by Miller and Thompson [11], [12].


Direct evolution of polymorphic circuits using cgp2
DIRECT EVOLUTION OF POLYMORPHIC CIRCUITSUSING CGP

  • b is the number of correct output bits obtained as response for all possible assignments to the inputs

  • z denotes the number of gates utilized in a offspring circuit


Proposed fitness evaluation for polymorphic circuits
PROPOSED FITNESS EVALUATION FOR POLYMORPHICCIRCUITS

  • The SAT-based Equivalence Checking





Results
RESULTS

  • Intel Xeon E5345 2.33 GHz

  • The MiniSAT 2 (version 070721) has been used as a SAT solver [18].

  • Benchmark LGSynth91







Conclusions
CONCLUSIONS

  • We proposed a new CGP-based method for evolutionary optimization of polymorphic circuits.

  • The new CGP-based method can reduce the number of gates by 20- 40% in comparison to conventional methods.


ad