一种用于互连测试的线性最优测试生成算法

ICCAD. IEEE/ACM International Conference on Computer-Aided Design Pub Date : 1998-11-01 DOI:10.1145/288548.288626

C. Su

{"title":"一种用于互连测试的线性最优测试生成算法","authors":"C. Su","doi":"10.1145/288548.288626","DOIUrl":null,"url":null,"abstract":"A linear optimal test generation algorithm is proposed to decompose serial test vectors into segments with one for each driver. Each driver is assigned a serial vector with two or more transitions for the detection of net and driver faults. As compared to the conventional counting and transition sequences, the reduction is up to 20% for buses and 36% for general networks.","PeriodicalId":90518,"journal":{"name":"ICCAD. IEEE/ACM International Conference on Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A linear optimal test generation algorithm for interconnect testing\",\"authors\":\"C. Su\",\"doi\":\"10.1145/288548.288626\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A linear optimal test generation algorithm is proposed to decompose serial test vectors into segments with one for each driver. Each driver is assigned a serial vector with two or more transitions for the detection of net and driver faults. As compared to the conventional counting and transition sequences, the reduction is up to 20% for buses and 36% for general networks.\",\"PeriodicalId\":90518,\"journal\":{\"name\":\"ICCAD. IEEE/ACM International Conference on Computer-Aided Design\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICCAD. IEEE/ACM International Conference on Computer-Aided Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/288548.288626\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICCAD. IEEE/ACM International Conference on Computer-Aided Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/288548.288626","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种线性最优测试生成算法，将串行测试向量分解为多个片段，每个片段对应一个驱动程序。每个驱动器被分配一个串行向量，其中有两个或多个转换，用于检测网络和驱动器故障。与传统的计数和转换序列相比，总线减少了20%，一般网络减少了36%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A linear optimal test generation algorithm for interconnect testing

A linear optimal test generation algorithm is proposed to decompose serial test vectors into segments with one for each driver. Each driver is assigned a serial vector with two or more transitions for the detection of net and driver faults. As compared to the conventional counting and transition sequences, the reduction is up to 20% for buses and 36% for general networks.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ICCAD. IEEE/ACM International Conference on Computer-Aided Design

自引率

0.00%

发文量