Abstract
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.
Chapter PDF
References
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.
Breuer, M.A. and Friedman, A.D. (1976). Diagnosis & reliable design of digital systems. Computer Science Press.
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.
Ciriani, V. (2003a). Synthesis of SPP Three-Level Logic Networks using Affine Spaces. IEEE Transactions on TCAD, 22(10):1310–1323.
Ciriani, V. (2003b). Three-Level Logic Synthesis: Algebraic Approach and Minimization Algorithms. PhD thesis, Dipartimento di Informatica, University of Pisa.
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.
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.
Coudert, O. (1994). Two-Level Logic Minimization: an overview. INTEGRATION, 17:97–140.
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.
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.
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.
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.
Fiorenzo-Catalano, M. S. and Malucelli, F. (2001). Parallel Randomized Heuristics For The Set Covering Problem. International Journal of Computer Research, 10(4).
Hachtel, G. and Somenzi, F. (1996). Logic Synthesis and Verification Algorithms. Kluwer Academy Publishers.
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.
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.
Luccio, F. and Pagli, L. (1999). On a New Boolean Function with Applications. IEEE Transactions on Computers, 48(3):296–310.
Sasao, T. (1989). On the Complexity of Three-Level Logic Circuits. In Int. Workshop on Logic Synthesis.
Sasao, T. (1993). AND-EXOR Expressions and their Optimization. In Sasao, T., editor, Logic Synthesis and Optimization. Kluwer Academic Publisher.
Sasao, T. (1996). Representation of Logic Functions Using EXOR Operators. In Sasao, T. and Fujita, M., editors, Representation of Discrete Functions. Kluwier Academic.
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.
Tebboth, J. and Daniel, R. (2001). A Tightly Integrated Modelling and Optimisation Library. Annals of Operations Research, 104:313–333.
Weste, N.H.E. and Eshraghian, K. (1993). Principles of CMOS VLSI Design. Addison-Wesley Publishing Company.
Williams, T.W. and Parker, K.P. (1982). Design for Testability-A Survey. IEEE Transactions on Computers, 31(1):2–15.
Yang, S. (1991). Synthesis on Optimization Benchmarks. User guide, Microelectronic Center. Benchmarks available at ftp://ftp.sunsite.org.uk/computing/general/espresso.tar.Z.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Ciriani, V., Bernasconi, A., Drechsler, R. (2006). Stuck-At-Fault Testability of SPP Three-Level Logic Forms. In: Glesner, M., Reis, R., Indrusiak, L., Mooney, V., Eveking, H. (eds) VLSI-SOC: From Systems to Chips. IFIP International Federation for Information Processing, vol 200. Springer, Boston, MA. https://doi.org/10.1007/0-387-33403-3_19
Download citation
DOI: https://doi.org/10.1007/0-387-33403-3_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-33402-8
Online ISBN: 978-0-387-33403-5
eBook Packages: Computer ScienceComputer Science (R0)