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

نویسندگان

  • V. Geetha
  • N. Devarajan
چکیده

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 2 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.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single Stuck-At Fault Diagnosing Circuit of Reed-Muller Canonical Exclusive-Or Sum of Product Boolean Expressions

A testable design with a universal test set for single stuck-at zero and stuck-at one faults of Reed-Muller canonical form of Exclusive-OR sum of product logic expressions is proposed. The test circuit detects almost all the single stuck-at faults and needs only simple modifications for variations in the circuit under test. The number of test vectors is also quite small compared with the classi...

متن کامل

Canonical restricted mixed-polarity exclusive-OR sums of products and the efficient algorithm for th - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE

The concept of canonical restricted mixed polarity (CRMP) exclusive-OR sum of products forms is introduced. The CRMP forms include the inconsistent canonical Reed-Muller forms and the fixed-polarity Reed-Muller (FPRM) forms as special cases. The set of CRMP forms is included in the set of exclusive-OR sum-of-product (ESOP) expressions. An attempt to characterise minimal CRMP forms for completel...

متن کامل

Eecient Synthesis of Anddxor Networks

|A new graph-based synthesis method for general Exclusive Sum-of-Product forms (ESOP) is presented in this paper. Previous research has largely concentrated on a class of ESOP's, the Canonical Restricted Fixed/Mixed Polarity Reed-Muller form, also known as Generalized Reed-Muller (GRM) form. However, for many functions, the minimum GRM can be much worse than the ESOP. We have de ned a Shared Mu...

متن کامل

Easily Testable Multiple-Valued Logic Circuits Derived from Reed-Muller Circuits

ÐIn 1972, Reddy showed that the binary circuits realizing Reed-Muller canonical form are easily testable. In this paper, we extend Reddy's result to multiple-valued logic circuits, employing more than two discrete levels of signal. The electronic fabrication of such circuits became feasible due to the recent advances in integrated circuit technology. We show that, in the multiple-valued case, s...

متن کامل

Software-hardware Codesign Approach to Generalized Zakrevskij Staircase Method for Exact Solutions of Arbitrary Canonical and Non-canonical Expressions in Galois Logic

Staircase Method of Zakrevskij has been used for exact solution to incomplete Exclusive Or Sum of Products ESOP and Fixed Polarity Reed Muller FPRM forms It can be observed that the method of Zakrevskij can be generalized to all problems where the function sought is the canonical form of an EXOR of arbitrary linearly independent LI generating functions Next it can be observed that the EXOR expr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011