• DocumentCode
    962743
  • Title

    Combinatorial Approach to Multiple Contact Faults Coverage in Programmable Logic Arrays

  • Author

    Rajski, Janusz ; Tyszer, Jerzy

  • Author_Institution
    Computer Center, Technical University of Pozna¿, 60-965 Pozna¿, Poland; visiting professor with the Department of Electrical Engineering, McGill University, Montreal, P. Q., Canada H3A 2A7.
  • Issue
    6
  • fYear
    1985
  • fDate
    6/1/1985 12:00:00 AM
  • Firstpage
    549
  • Lastpage
    553
  • Abstract
    The increasing number of applications of programmable logic arrays (PLA´s) has evoked the development of test generation methods for these circuits. There are known methods for complete single contact fault detection test set generation. These test sets fail to detect all multiple faults in a PLA due to the phenomenon of masking. In this correspondence, we present a method to quantitively predict the multiple fault coverage capability of a single fault detection test set in a PLA. The method enables us to determine the coverage ratio, which is defined as the ratio of the number of multiple contact faults detected by a single fault test Tc to the total number of all multiple faults. It is shown that the multiple fault coverage ratio of Tc drops with an increasing size of faults, and most unexpectedly, the ratio increases with an increasing number of rows. The number of crosspoints in one product line has very little influence on the ratio.
  • Keywords
    Circuit faults; Concurrent computing; Decoding; Diodes; Fault detection; Nearest neighbor searches; Programmable logic arrays; Switching circuits; Testing; Very large scale integration; Combinatorial analysis; PLA testing; contact faults; multiple faults detection; single fault coverage;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1985.5009407
  • Filename
    5009407