{"title":"Associative search based test algorithms for test acceleration in FAST-RAMs","authors":"C. Elm, D. Tavangarian","doi":"10.1109/MT.1993.263152","DOIUrl":null,"url":null,"abstract":"To accelerate deterministic functional memory chip testing, the authors propose modifying a memory chip using circuit structures known from flag-oriented associative memories. Based on these modifications new test algorithms have been developed. Compared with existing test algorithms the complexity of algorithms developed for fault detection is one or two orders lower. For fault localization it is approximately one order lower and depends additionally on the number of faulty cells in a memory chip. It is shown that this complexity can be reduced further using contents-oriented processing of the information stored in a memory with corresponding circuit structures. In this contribution the basics of the new test approach, the structure of the newly developed test algorithms, the hardware requirements and the achievable test acceleration are discussed.<<ETX>>","PeriodicalId":248811,"journal":{"name":"Records of the 1993 IEEE International Workshop on Memory Testing","volume":"713 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Records of the 1993 IEEE International Workshop on Memory Testing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MT.1993.263152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
To accelerate deterministic functional memory chip testing, the authors propose modifying a memory chip using circuit structures known from flag-oriented associative memories. Based on these modifications new test algorithms have been developed. Compared with existing test algorithms the complexity of algorithms developed for fault detection is one or two orders lower. For fault localization it is approximately one order lower and depends additionally on the number of faulty cells in a memory chip. It is shown that this complexity can be reduced further using contents-oriented processing of the information stored in a memory with corresponding circuit structures. In this contribution the basics of the new test approach, the structure of the newly developed test algorithms, the hardware requirements and the achievable test acceleration are discussed.<>