{"title":"A new method for testing EEPLAs","authors":"A. Munshi, F. Meyer, F. Lombardi","doi":"10.1109/DFTVS.1998.732161","DOIUrl":null,"url":null,"abstract":"We present a new method for testing electrically erasable programmable logic arrays (EEPLA) under multiple faults. These include line stuck-at faults, bridging faults, and crosspoint faults. Our proposed method achieves 100% fault coverage of multiple faults by reprogramming the EEPLA many times. The complexity of testing EEPLAs is largely dependent on the number of programming phases, because programming time is much larger than test application time. The proposed method achieves a substantial reduction in programming phases compared with prior methods; and, thereby, in testing time, even though it involves more test vectors. The programming is based on a parallel sequence in which a larger number of crosspoints are tested per phase-a toroidal sequence with which full coverage is still guaranteed. We analyze the method to obtain the testing time as a function of the numbers of input variables, product lines, and output functions.","PeriodicalId":245879,"journal":{"name":"Proceedings 1998 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (Cat. No.98EX223)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1998 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (Cat. No.98EX223)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DFTVS.1998.732161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We present a new method for testing electrically erasable programmable logic arrays (EEPLA) under multiple faults. These include line stuck-at faults, bridging faults, and crosspoint faults. Our proposed method achieves 100% fault coverage of multiple faults by reprogramming the EEPLA many times. The complexity of testing EEPLAs is largely dependent on the number of programming phases, because programming time is much larger than test application time. The proposed method achieves a substantial reduction in programming phases compared with prior methods; and, thereby, in testing time, even though it involves more test vectors. The programming is based on a parallel sequence in which a larger number of crosspoints are tested per phase-a toroidal sequence with which full coverage is still guaranteed. We analyze the method to obtain the testing time as a function of the numbers of input variables, product lines, and output functions.