{"title":"Using high-level primitives to speed up circuit partitioning in a mixed scan and non-scan environment for system level test generation","authors":"S. Kode","doi":"10.1109/ISVD.1991.185103","DOIUrl":null,"url":null,"abstract":"An approach to carving circuit partitions starting and stopping at controllable and observable points using high-level primitives is described. This approach allows considerable speed up over gate level partitioning. The minimum set of properties to accommodate multi-input, multi-output primitives is presented. The approach is both memory efficient and fast allowing for both deterministic and interactive heuristic partitioning at the system level. Partitioning is orthogonal to test generation, and the best scan test generator can still be used on the generated scan targets. Practical application of the approach for the system level scan test generation of the Apollo DN10000 and its CPU upgrade, both designs of more than a million gates, are presented. Evolution of the techniques to accommodate new technology will be addressed. Partitioning for test generation for both stuck-at and delay faults are addressed.<<ETX>>","PeriodicalId":183602,"journal":{"name":"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVD.1991.185103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
An approach to carving circuit partitions starting and stopping at controllable and observable points using high-level primitives is described. This approach allows considerable speed up over gate level partitioning. The minimum set of properties to accommodate multi-input, multi-output primitives is presented. The approach is both memory efficient and fast allowing for both deterministic and interactive heuristic partitioning at the system level. Partitioning is orthogonal to test generation, and the best scan test generator can still be used on the generated scan targets. Practical application of the approach for the system level scan test generation of the Apollo DN10000 and its CPU upgrade, both designs of more than a million gates, are presented. Evolution of the techniques to accommodate new technology will be addressed. Partitioning for test generation for both stuck-at and delay faults are addressed.<>