Synthesis of P-circuits for logic restructuring

  • Authors:
  • Anna Bernasconi;Valentina Ciriani;Valentino Liberali;Gabriella Trucco;Tiziano Villa

  • Affiliations:
  • Department of Computer Science, Universití di Pisa, Italy;Department of Information Technologies, Universití degli Studi di Milano, Italy;Department of Physics, Universití degli Studi di Milano, Italy;Department of Information Technologies, Universití degli Studi di Milano, Italy;Department of Computer Science, Universití degli Studi di Verona, Italy

  • Venue:
  • Integration, the VLSI Journal
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Boolean functional decomposition techniques built on top of Shannon cofactoring are applied to obtain specialized 4-level forms called Projected Circuits, or P-circuits. We describe their minimization by heuristic and guaranteed approximation algorithms exploiting structural don't care conditions, and prove properties for special cases about cost estimation and testability. A specific application is synthesis for minimum switching activity, with small area penalty, where the decomposition moves toward the output critical signals with the highest switching activity. We report encouraging experiments for decomposition targeting power consumption or simply area.