Delay-testable implementations of symmetric functions

We show that most symmetric functions do not have delay-testable two-level implementations. A method of transforming any untestable minimal two-level implementation of a symmetric function into a delay-testable three- or four-level one using the distributive law is presented. >

[1]  Irith Pomeranz,et al.  Synthesis of multi-level combinational circuits for complete robust path delay fault testability , 1992, [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing.

[2]  Kurt Keutzer,et al.  Synthesis of robust delay-fault-testable circuits: theory , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  S. M. Reddy,et al.  On the design of path delay fault testable combinational circuits , 1990, [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium.

[4]  Ingo Wegener,et al.  Minimal Polynomials for the Conjunction of Functions on Disjoint Variables Can Be Very Simple , 1989, Inf. Comput..

[5]  Donald L. Dietmeyer.  Generating minimal covers of symmetric functions , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Gordon L. Smith,et al.  Model for Delay Faults Based upon Paths , 1985, ITC.

[7]  Sudhakar M. Reddy,et al.  On Delay Fault Testing in Logic Circuits , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.