用于ULSI存储器的高速边界搜索Shmoo图

Records of the 1993 IEEE International Workshop on Memory Testing Pub Date : 1993-08-09 DOI:10.1109/MT.1993.263158

M. Hamada, M. Kumanoya, M. Ishii, T. Kawagoe, M. Niiro

{"title":"用于ULSI存储器的高速边界搜索Shmoo图","authors":"M. Hamada, M. Kumanoya, M. Ishii, T. Kawagoe, M. Niiro","doi":"10.1109/MT.1993.263158","DOIUrl":null,"url":null,"abstract":"The authors describe a new high-speed Shmoo plot algorithm for ULSI memory devices. The proposed boundary search method is 8 times faster than the conventional (linear searching) method. Using this method the evaluation time of a 64 Mbit memory is reduced to 2.5 hours from the 20 hours of the conventional method.<<ETX>>","PeriodicalId":248811,"journal":{"name":"Records of the 1993 IEEE International Workshop on Memory Testing","volume":"49 17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A high-speed boundary search Shmoo plot for ULSI memories\",\"authors\":\"M. Hamada, M. Kumanoya, M. Ishii, T. Kawagoe, M. Niiro\",\"doi\":\"10.1109/MT.1993.263158\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors describe a new high-speed Shmoo plot algorithm for ULSI memory devices. The proposed boundary search method is 8 times faster than the conventional (linear searching) method. Using this method the evaluation time of a 64 Mbit memory is reduced to 2.5 hours from the 20 hours of the conventional method.<<ETX>>\",\"PeriodicalId\":248811,\"journal\":{\"name\":\"Records of the 1993 IEEE International Workshop on Memory Testing\",\"volume\":\"49 17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-08-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"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.263158\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","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.263158","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

作者描述了一种新的用于ULSI存储器件的高速Shmoo绘图算法。提出的边界搜索方法比传统的(线性搜索)方法快8倍。采用该方法可将64mbit存储器的评估时间从传统方法的20小时缩短到2.5小时。

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

查看原文本刊更多论文

A high-speed boundary search Shmoo plot for ULSI memories

The authors describe a new high-speed Shmoo plot algorithm for ULSI memory devices. The proposed boundary search method is 8 times faster than the conventional (linear searching) method. Using this method the evaluation time of a 64 Mbit memory is reduced to 2.5 hours from the 20 hours of the conventional method.<>

求助全文

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

来源期刊

Records of the 1993 IEEE International Workshop on Memory Testing

自引率

0.00%

发文量