{"title":"在O(1)时间内,测试向量嵌入存储进位累加器","authors":"I. Voyiatzis, C. Efstathiou, C. Sgouropoulou","doi":"10.1109/DTIS.2012.6232976","DOIUrl":null,"url":null,"abstract":"In test set embedding Built-In Self Test (BIST) schemes a precomputed test set is embedded into the sequence generated by a hardware generator. These schemes have to evaluate the location of each test pattern in the sequence as fast as possible, in order to test as many as possible candidate configurations of the test pattern generator; this problem is known as the test vector-embedding problem. In this paper we present a O(1) solution to the test vector-embedding problem for sequences generated by accumulators.","PeriodicalId":114829,"journal":{"name":"7th International Conference on Design & Technology of Integrated Systems in Nanoscale Era","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Test vector embedding in accumulators with stored carry in O(1) time\",\"authors\":\"I. Voyiatzis, C. Efstathiou, C. Sgouropoulou\",\"doi\":\"10.1109/DTIS.2012.6232976\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In test set embedding Built-In Self Test (BIST) schemes a precomputed test set is embedded into the sequence generated by a hardware generator. These schemes have to evaluate the location of each test pattern in the sequence as fast as possible, in order to test as many as possible candidate configurations of the test pattern generator; this problem is known as the test vector-embedding problem. In this paper we present a O(1) solution to the test vector-embedding problem for sequences generated by accumulators.\",\"PeriodicalId\":114829,\"journal\":{\"name\":\"7th International Conference on Design & Technology of Integrated Systems in Nanoscale Era\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"7th International Conference on Design & Technology of Integrated Systems in Nanoscale Era\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DTIS.2012.6232976\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Conference on Design & Technology of Integrated Systems in Nanoscale Era","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DTIS.2012.6232976","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Test vector embedding in accumulators with stored carry in O(1) time
In test set embedding Built-In Self Test (BIST) schemes a precomputed test set is embedded into the sequence generated by a hardware generator. These schemes have to evaluate the location of each test pattern in the sequence as fast as possible, in order to test as many as possible candidate configurations of the test pattern generator; this problem is known as the test vector-embedding problem. In this paper we present a O(1) solution to the test vector-embedding problem for sequences generated by accumulators.