Efficient minimization of fully testable 2-SPP networks

Proceedings -Design, Automation and Test in Europe, DATE

Volumn 1, Issue , 2006, Pages

  Bernasconi, Anna ^a   Ciriani, Valentina ^b   Drechsler, Rolf ^c   Villa, Tiziano ^d  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF MILAN   (Italy)

^c UNIVERSITY OF BREMEN   (Germany)

^d UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GATES (TRANSISTOR); HEURISTIC ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING;

EXPAND IRREDUNDANT REDUCE PARADIGM; LOCAL MINIMIZATION; MINIMIZATION ALGORITHM; SPP NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 34047149411     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/date.2006.244121     Document Type: Conference Paper

References (14)

1. A. Bernasconi, V. Ciriani, R. Drechsler, and T. Villa. Efficient Minimization of Fully Testable 2-SPP Networks. Technical Report TR-05-23, University of Pisa, 2005.
2. R. Brayton, G. Hachtel, C. McMullen, and A. Sangiovanni-Vincentelli. Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers, 1984.
3. M. Breuer and A. Friedman. Diagnosis & Reliable Design of Digital Systems. Computer Science Press, 1976.
4. V. Ciriani. Synthesis of SPP Three-Level Logic Networks using Affine Spaces. IEEE Transactions on TCAD, 22(10): 1310-1323, 2003.
5. V. Ciriani and A. Bernasconi. 2-SPP: a Practical Trade-Off between SP and SPP Synthesis. In 5th International Workshop on Boolean Problems (IWSBP2002), pages 133-140, 2002.
6. V. Ciriani, A. Bemasconi, and R. Drechsler. Testability of SPP Three-Level Logic Networks. In IFIP 12-th International Conference on Very Large Scale Integration, (VLSI-SOC), pages 331-336, 2003.
7. G. Hachtel and F. Somenzi. Logic Synthesis and Verification Algorithms. Kluwer Academy Publishers, 1996.
8. T. Kozlowski, E. L. Dagless, and J. M. Saul. An Enhanced Algorithm for the Minimization of Exclusive-Or Sum-Of-Products for Incompletely Specified Functions. In The Proceedings of the International Conference on Computer Design, pages 244-249, 1995.
9. F. Luccio and L. Pagli. On a New Boolean Function with Applications. IEEE Transactions on Computers, 48(3) :296-310, 1999.
10. S. Minato. Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems. In ACM/IEEE 30th Design Automation Conference (DAC), pages 272-277, 1993.
11. R. Rudell and A. Sangiovanni-Vincentelli. Multiple-valued minimization for PLA optimization. IEEE Transactions on Computer-Aided Design, CAD-6:727-750, Sept. 1987.
12. T. Sasao. EXM1N2: A Simplification Algorithm for Exclusive-OR-Sum-of Products Expressions for Multiple-Valued-Input Two-Valued-Output Functions. IEEE Transactions on Computer-Aided Design, 12:621-632, 1993.
13. E. Sentovich, K. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P. Stephan, R. Brayton, and A. Sangiovanni-Vincentelli. SIS: A System for Sequential Circuit Synthesis. Technical report, University of Berkeley, 1992.
14. S. Yang. Synthesis on Optimization Benchmarks. User guide, Microelectronic Center, 1991.