Compact area, low delay, and fast synthesis time are important issues in logic circuit design. In order to orchestrate these main goals, this paper proposes a new algebraic three- level expression called sum of extended pseudoproducts (SEPP) with low delay and compact area. These forms are an extension of sum of pseudoproduct (SPP) three-level expressions. The paper proposes an efficient heuristic algorithm that gives compact solutions in a reduced synthesis time. A wide set of experimental results confirms that SEPP forms are often more compact than SPP forms, and their synthesis is always a fast reoptimization phase after SPP minimization.
SEPP: a New Compact Three-Level Logic Form
BERNASCONI, ANNA
2010-01-01
Abstract
Compact area, low delay, and fast synthesis time are important issues in logic circuit design. In order to orchestrate these main goals, this paper proposes a new algebraic three- level expression called sum of extended pseudoproducts (SEPP) with low delay and compact area. These forms are an extension of sum of pseudoproduct (SPP) three-level expressions. The paper proposes an efficient heuristic algorithm that gives compact solutions in a reduced synthesis time. A wide set of experimental results confirms that SEPP forms are often more compact than SPP forms, and their synthesis is always a fast reoptimization phase after SPP minimization.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.