Abstract
An efficient diagnosis algorithm for data paths (or interconnection circuits) in reconfigurable arrays is proposed. The data paths, including data registers, data links, and programmable switches, are tested by applying test patterns from the outside of an array. Fault-free paths identified partition the array into smaller subarrays so that testing can be done recursively. Fault masking due to programmable switch failures is examined. A sufficient condition to avoid fault masking is obtained. The performance of the diagnosis algorithm is evaluated by computer simulation. >
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.
