Abstract
A novel algorithm for diagnosing bridging faults in combinational circuits is presented. The voting model is assumed. The diagnosis algorithm guarantees the object bridging (bridging fault in the circuit being diagnosed) to be in the final fault list. The novelties of the algorithm are: (i) unlike previous algorithms it does not use the full fault dictionary but uses portions of the stuck-at fault dictionary which is computed dynamically; (ii) it enumerates the faults implicitly using a compact data structure; and (iii) fault dropping rules, using stuck-at fault simulation only, are used. The resulting algorithm is both time and space efficient. Experimental evaluation of the algorithm is presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
