Inversion Minimization in Majority-Inverter Graphs

@inproceedings{Testa2016InversionMI,
  title={Inversion Minimization in Majority-Inverter Graphs},
  author={Eleonora Testa and Mathias Soeken and Luca Gaetano Amar{\`u} and Pierre-Emmanuel Gaillardon and Giovanni De Micheli},
  year={2016}
}
In this paper, we present new optimization techniques for the recently introduced Majority-Inverter Graph (MIG). Our optimizations exploit intrinsic algebraic properties of MIGs and aim at rewriting the complemented edges of the graph without changing its shape. Two exact algorithms are proposed to minimize the number of complemented edges in the graph. The former is a dynamic programming method for trees; the latter finds the exact solution with a minimum number of inversions using Boolean… CONTINUE READING