OR-Bridging Fault Identification and Diagnosis for Exclusive-OR Sum of Products Reed-Muller Canonical Circuits

Problem statement: The faults in digital circuit can be classified broadly as single stuck-atfaults, multiple stuck-ay-faults, stuck-open faults, stuck-on faults, path delay faults, transient faults. Extensive research had been carried out in the field of testing of digital circuits to limit the number of input vectors. The cardinality of the test vectors proposed by many authors was quite high for large number of input variables. In this study a testable circuit with a small test set for detection and diagnosis of OR-bridging type fault in Reed-Muller canonical Exclusive-OR Sum of Products logic circuits, independent of the function for a given number of inputs had been proposed. Approach: A network structure comprising a set of Exclusive-OR gates and gates and a couple of auxiliary outputs were considered. The circuit as well as the test vectors were simulated by MATLAB coding. The faultfree and OR-bridging faults involving any two lines of control and data lines were then simulated. The outputs were represented in a compact decimal form for ease of tabulation. Two quantitative indices for comparison of results had also been discussed. Simulation and analysis for various random functions had been presented. Results: From the test results it was found that the identifiability for the set of random functions tested was more than 90% with just n + 5 test vectors compared to 2n test vectors required for conventional testing. It was also observed that even though the overall distinguishabililty factor was in the range of 45-80%, the individual set distinguishability was more than 90%. Conclusion: The proposed scheme had reduced the possibility of unidentifiable faults for the specified type of function. The location was also diagnosed through the output set. The analysis and diagnosis had been done through compact tabulation and two quantification indices.

[1]  P. Zhongliang Testable realizations for ESOP expressions of logic functions , 2002, Proceedings of the 11th Asian Test Symposium, 2002. (ATS '02)..

[2]  Marek A. Perkowski,et al.  Generalized Partially-Mixed-Polarity Reed-Muller Expansionand Its Fast Computation , 1996, IEEE Trans. Computers.

[3]  Dhiraj K. Pradhan,et al.  Universal Test Sets for Multiple Fault Detection in AND-EXOR Arrays , 1978, IEEE Transactions on Computers.

[4]  Douglas V. Hall,et al.  A Minimal Universal Test Set for Self-Test of EXOR-Sum-of-Products Circuits , 2000, IEEE Trans. Computers.

[5]  Tsutomu Sasao Easily testable realizations for generalized Reed-Muller expressions , 1994, Proceedings of IEEE 3rd Asian Test Symposium (ATS).

[6]  Hafizur Rahaman,et al.  Testing of stuck-open faults in generalised Reed-Muller and EXOR sum-of-products CMOS circuits , 2004 .

[7]  S. M Reddy,et al.  Easily testable realizations for logic functions , 1973 .

[8]  Rolf Drechsler,et al.  Testability of 2-Level AND/EXOR Circuits , 1999, J. Electron. Test..

[9]  Pan Zhongliang Bridging fault detections for testable realizations of logic functions , 2003, 16th International Conference on VLSI Design, 2003. Proceedings..

[10]  A. K. Choudhury,et al.  Testable design of RMC networks with universal tests for detecting stuck-at and bridging faults , 1985 .

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

[12]  A. E. Jeyakumar,et al.  Single Stuck-At Fault Diagnosing Circuit of Reed-Muller Canonical Exclusive-Or Sum of Product Boolean Expressions , 2006 .