SEPP: a New Compact Three-Level Logic Form

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 threelevel 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.

[1]  Fabio Somenzi,et al.  Logic synthesis and verification algorithms , 1996 .

[2]  Tsutomu Sasao,et al.  Or-and-Or Three-Level Networks , 1996 .

[3]  S. Yang,et al.  Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 , 1991 .

[4]  Tiziano Villa,et al.  Logic Minimization and Testability of 2-SPP Networks , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  Neil Weste,et al.  Principles of CMOS VLSI Design , 1985 .

[6]  Tsutomu Sasao,et al.  Switching Theory for Logic Synthesis , 1999, Springer US.

[7]  Fabrizio Luccio,et al.  On a New Boolean Function with Applications , 1999, IEEE Trans. Computers.

[8]  Tsutomu Sasao,et al.  On the Complexity of Three-Level Logic Circuits(Complexity Theory and Related Topics) , 1990 .

[9]  Zvonko G. Vranesic,et al.  A fast algorithm for OR-AND-OR synthesis , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Valentina Ciriani.  Synthesis of SPP three-level logic networks using affine spaces , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Tsutomu Sasao,et al.  Multiple-valued minimization to optimize PLAs with output EXOR gates , 1999, Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329).