Testability of 2-Level AND/EXOR Circuits

It is often stated that AND/EXOR circuits are much easier to test than AND/OR circuits. This statement, however, only holds true for circuits derived from restricted classes of AND/EXOR expressions, like positive polarity Reed-Muller and fixed polarity Reed-Muller expressions. For these two classes of expressions, circuits with good deterministic testability properties are known. In this paper we show that these circuits also have good random pattern testability attributes. An input probability distribution is given that yields a short expected test length for biased random patterns. This is the first time theoretical results on random pattern testability are presented for 2-level AND/EXOR circuit realizations of arbitrary Boolean functions. It turns out that analogous results cannot be expected for less restricted classes of 2-level AND/EXOR circuits. We present experiments demonstrating that generally minimized 2-level AND/OR circuits can be tested as easy (or hard) as minimized 2-level AND/EXOR circuits.

[1]  Irving S. Reed,et al.  A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.

[2]  Tsutomu Sasao,et al.  Logic Synthesis and Optimization , 1997 .

[3]  Marek Perkowski,et al.  Design For Testability Properties of AND/XOR Networks , 1993 .

[4]  R W Brander,et al.  Diagnosis and Reliable Design of Digital Systems , 1978 .

[5]  Tsutomu Sasao,et al.  Minimization of AND-EXOR Expressions Using Rewrite Rules , 1993, IEEE Trans. Computers.

[6]  Sudhakar M. Reddy,et al.  Fault Detecting Test Sets for Reed-Muller Canonic Networks , 1975, IEEE Transactions on Computers.

[7]  Tsutomu Sasao.  And-Exor Expressions and their Optimization , 1993 .

[8]  Jean-Pierre Deschamps,et al.  Discrete and switching functions , 1978 .

[9]  John A. Waicukauski,et al.  A Method for Generating Weighted Random Test Patterns , 1989, IBM J. Res. Dev..

[10]  Joachim Hartmann,et al.  The Random Testability of the n-Input AND Gate , 1991, STACS.

[11]  Richard D. Eldred.  Test Routines Based on Symbolic Logical Statements , 1959, JACM.

[12]  Nur A. Touba,et al.  Automated logic synthesis of random pattern testable circuits , 1994, Proceedings., International Test Conference.

[13]  Bernd Becker,et al.  Fast OFDD based minimization of fixed polarity Reed-Muller expressions , 1994, EURO-DAC '94.

[14]  J. M. Saul.  Logic synthesis for arithmetic circuits using the Reed-Muller representation , 1992, [1992] Proceedings The European Conference on Design Automation.

[15]  Tsutomu Sasao.  Easily Testable Realizations for Generalized Reed-Muller Expressions , 1997, IEEE Trans. Computers.

[16]  Tomasz Kozlowski,et al.  An enhanced algorithm for the minimization of exclusive-OR sum-of-products for incompletely specified functions , 1995, Proceedings of ICCD '95 International Conference on Computer Design. VLSI in Computers and Processors.

[17]  SUDHAKAR M. REDDY,et al.  Easily Testable Realizations ror Logic Functions , 1972, IEEE Transactions on Computers.

[18]  Marek A. Perkowski,et al.  Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND/XOR canonical networks , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[19]  Melvin A. Breuer,et al.  Diagnosis and Reliable Design of Digital Systems , 1977 .

[20]  Tsutomu Sasao,et al.  Representations of Logic Functions Using EXOR Operators , 1996 .