Stuck-At-Fault Testability of SPP Three-Level Logic Forms

  • Valentina Ciriani
  • Anna Bernasconi
  • Rolf Drechsler
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 200)


Recently introduced, three-level logic Sum of Pseudoproducts (SPP) forms allow the representation of Boolean functions with much shorter expressions than standard two-level Sum of Products (SOP) forms, or other three-level logic forms. In this paper the testability of circuits derived from SPPs is analyzed. We study testability under the Stuck-At Fault Model (SAFM). For SPP networks several minimal forms can be considered. While full testability can be proved for some classes, others are shown to contain redundancies. Experimental results are given to demonstrate the efficiency of the approach.


Reliability and Testing Testability Design for Testability SPP Three-Level Network 


  1. [Bernasconi et al., 2003]
    Bernasconi, A., Ciriani, V., Luccio, F., and Pagli, L. (2003). Three-Level Logic Minimization Based on Function Regularities. IEEE Transactions on TCAD, 22(8): 1005–1016.Google Scholar
  2. [Breuer and Friedman, 1976]
    Breuer, M.A. and Friedman, A.D. (1976). Diagnosis & reliable design of digital systems. Computer Science Press.Google Scholar
  3. [Chattopadhyay et al., 1997]
    Chattopadhyay, S., Roy, S., and Chaudhuri, P. (1997). KGPMIN: An Efficient Multilevel Multioutput AND-OR-XOR Minimizer. IEEE Transaction on CAD, 16(3):257–265.Google Scholar
  4. [Ciriani, 2003a]
    Ciriani, V. (2003a). Synthesis of SPP Three-Level Logic Networks using Affine Spaces. IEEE Transactions on TCAD, 22(10):1310–1323.Google Scholar
  5. [Ciriani, 2003b]
    Ciriani, V. (2003b). Three-Level Logic Synthesis: Algebraic Approach and Minimization Algorithms. PhD thesis, Dipartimento di Informatica, University of Pisa.Google Scholar
  6. [Ciriani and Bernasconi, 2002]
    Ciriani, V. and Bernasconi, A. (2002). 2-SPP: a Practical Trade-Off between SP and SPP Synthesis. In 5th International Workshop on Boolean Problems (IWSBP2002), pages 133–140.Google Scholar
  7. [Ciriani et al., 2003]
    Ciriani, V., Luccio, F., and Pagli, L. (2003). Synthesis of Integer Multipliers in Sum of Pseudoproducts Form. Integration-the VLSI journal, 36(3): 103–118.CrossRefGoogle Scholar
  8. [Coudert, 1994]
    Coudert, O. (1994). Two-Level Logic Minimization: an overview. INTEGRATION, 17:97–140.zbMATHGoogle Scholar
  9. [Debnath and Sasao, 1999]
    Debnath, D. and Sasao, T. (1999). Multiple-Valued Minimization to Optimize PLAs with Output EXOR Gates. In IEEE International Symposium on Multiple-Valued Logic, pages 99–104.Google Scholar
  10. [Debnath and Vransic, 2003]
    Debnath, D. and Vransic, Z.G. (2003). A Fast Algorithm for OR-AND-OR Synthesis. IEEE Transactions on Computer Aided Design, 22(9): 1166–1176.CrossRefGoogle Scholar
  11. [Dubrova et al., 1999]
    Dubrova, E.V., Miller, D.M, and Muzio, J.C. (1999). AOXMIN-MV: A Heuristic Algorithm for AND-OR-XOR Minimization. In 4th Int. Workshop on the Applications of the Reed Muller Expansion in circuit Design, pages 37–54.Google Scholar
  12. [Eggerstedt et al., 1993]
    Eggerstedt, M., Hendrich, N., and von der Heide, K. (1993). Minimization of Parity-Checked Fault-Secure AND/EXOR Networks. In IFIP WG 10.2 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, pages 142–146.Google Scholar
  13. [Fiorenzo-Catalano and Malucelli, 2001]
    Fiorenzo-Catalano, M. S. and Malucelli, F. (2001). Parallel Randomized Heuristics For The Set Covering Problem. International Journal of Computer Research, 10(4).Google Scholar
  14. [Hachtel and Somenzi, 1996]
    Hachtel, G. and Somenzi, F. (1996). Logic Synthesis and Verification Algorithms. Kluwer Academy Publishers.Google Scholar
  15. [Ishikawa et al., 2002]
    Ishikawa, R., Igarashi, T., Hirayama, T., and Shimizu, K. (2002). Pseudocube-based expressions to enhance testability. In IEEE Asia-Pacific Conference on Circuits and Systems, volume 2, pages 305–310.Google Scholar
  16. [Koda and Sasao, 1995]
    Koda, N. and Sasao, T. (1995). An Upper Bound on the Number of Products in Minimum ESOPs. In IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansions in Circuit Design.Google Scholar
  17. [Luccio and Pagli, 1999]
    Luccio, F. and Pagli, L. (1999). On a New Boolean Function with Applications. IEEE Transactions on Computers, 48(3):296–310.MathSciNetCrossRefGoogle Scholar
  18. [Sasao, 1989]
    Sasao, T. (1989). On the Complexity of Three-Level Logic Circuits. In Int. Workshop on Logic Synthesis.Google Scholar
  19. [Sasao, 1993]
    Sasao, T. (1993). AND-EXOR Expressions and their Optimization. In Sasao, T., editor, Logic Synthesis and Optimization. Kluwer Academic Publisher.Google Scholar
  20. [Sasao, 1996]
    Sasao, T. (1996). Representation of Logic Functions Using EXOR Operators. In Sasao, T. and Fujita, M., editors, Representation of Discrete Functions. Kluwier Academic.Google Scholar
  21. [Sentovich et al., 1992]
    Sentovich, E., Singh, K., Lavagno, L., Moon, Ch., Murgai, R., Saldanha, A., Savoj, H., Stephan, P., Brayton, R., and Sangiovanni-Vincentelli, A. (1992). SIS: A system for sequential circuit synthesis. Technical report, University of Berkeley.Google Scholar
  22. [Tebboth and Daniel, 2001]
    Tebboth, J. and Daniel, R. (2001). A Tightly Integrated Modelling and Optimisation Library. Annals of Operations Research, 104:313–333.zbMATHMathSciNetCrossRefGoogle Scholar
  23. [Weste and Eshraghian, 1993]
    Weste, N.H.E. and Eshraghian, K. (1993). Principles of CMOS VLSI Design. Addison-Wesley Publishing Company.Google Scholar
  24. [Williams and Parker, 1982]
    Williams, T.W. and Parker, K.P. (1982). Design for Testability-A Survey. IEEE Transactions on Computers, 31(1):2–15.Google Scholar
  25. [Yang, 1991]
    Yang, S. (1991). Synthesis on Optimization Benchmarks. User guide, Microelectronic Center. Benchmarks available at Scholar

Copyright information

© International Federation for Information Processing 2006

Authors and Affiliations

  • Valentina Ciriani
    • 1
  • Anna Bernasconi
    • 2
  • Rolf Drechsler
    • 3
  1. 1.Dip. di Tecnologie dell’InformazioneUniversita’ degli Studi di MilanoCremaItaly
  2. 2.Department of Computer ScienceUniversity of PisaPisaItaly
  3. 3.Institute of Computer ScienceUniversity of BremenBremenGermany

Personalised recommendations