用扫描链拟合ATE通道:一种测试数据压缩技术与扫描链串行加载的比较

Julien Dalmasso, M. Flottes, B. Rouzeyre
{"title":"用扫描链拟合ATE通道:一种测试数据压缩技术与扫描链串行加载的比较","authors":"Julien Dalmasso, M. Flottes, B. Rouzeyre","doi":"10.1109/DELTA.2006.49","DOIUrl":null,"url":null,"abstract":"Since systems-on-chip (SoCs) keep on being more and more complex, test data compression has become essential to reduce test costs. In particular, a common technique for reducing test time is to use multiple scan chains. Nevertheless, this possibility is limited by the number of available ATE (automatic test equipment) channels. In this context, horizontal compression allows to fit the number of available ATE channels with the number of scan chains. But to achieve compression, these methods rely on the presence of don't care bits (X's) in the test sequences. Therefore, the length of these sequences is significantly greater than ones with fully specified bits. Conversely, serialization based methods allow to use fully specified test sequences, that are significantly smaller. This paper first presents a new method for horizontal test data compression and secondly proposes an answer to the question: is there really a benefit in terms of test application time (TAT) and test data volume of using compression instead of a simple serialization of test data?.","PeriodicalId":439448,"journal":{"name":"Third IEEE International Workshop on Electronic Design, Test and Applications (DELTA'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Fitting ATE channels with scan chains: a comparison between a test data compression technique and serial loading of scan chains\",\"authors\":\"Julien Dalmasso, M. Flottes, B. Rouzeyre\",\"doi\":\"10.1109/DELTA.2006.49\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Since systems-on-chip (SoCs) keep on being more and more complex, test data compression has become essential to reduce test costs. In particular, a common technique for reducing test time is to use multiple scan chains. Nevertheless, this possibility is limited by the number of available ATE (automatic test equipment) channels. In this context, horizontal compression allows to fit the number of available ATE channels with the number of scan chains. But to achieve compression, these methods rely on the presence of don't care bits (X's) in the test sequences. Therefore, the length of these sequences is significantly greater than ones with fully specified bits. Conversely, serialization based methods allow to use fully specified test sequences, that are significantly smaller. This paper first presents a new method for horizontal test data compression and secondly proposes an answer to the question: is there really a benefit in terms of test application time (TAT) and test data volume of using compression instead of a simple serialization of test data?.\",\"PeriodicalId\":439448,\"journal\":{\"name\":\"Third IEEE International Workshop on Electronic Design, Test and Applications (DELTA'06)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-01-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third IEEE International Workshop on Electronic Design, Test and Applications (DELTA'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DELTA.2006.49\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third IEEE International Workshop on Electronic Design, Test and Applications (DELTA'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DELTA.2006.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

由于片上系统(soc)越来越复杂,测试数据压缩已成为降低测试成本的必要手段。特别是,减少测试时间的一种常用技术是使用多个扫描链。然而,这种可能性受到可用ATE(自动测试设备)通道数量的限制。在这种情况下,水平压缩允许将可用ATE通道的数量与扫描链的数量相匹配。但是为了实现压缩,这些方法依赖于测试序列中不关心比特(X)的存在。因此,这些序列的长度明显大于具有完全指定位的序列。相反,基于序列化的方法允许使用完全指定的测试序列,这要小得多。本文首先提出了一种横向测试数据压缩的新方法,然后对使用压缩代替简单的测试数据序列化在测试应用时间(TAT)和测试数据量方面是否真的有好处这一问题提出了答案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fitting ATE channels with scan chains: a comparison between a test data compression technique and serial loading of scan chains
Since systems-on-chip (SoCs) keep on being more and more complex, test data compression has become essential to reduce test costs. In particular, a common technique for reducing test time is to use multiple scan chains. Nevertheless, this possibility is limited by the number of available ATE (automatic test equipment) channels. In this context, horizontal compression allows to fit the number of available ATE channels with the number of scan chains. But to achieve compression, these methods rely on the presence of don't care bits (X's) in the test sequences. Therefore, the length of these sequences is significantly greater than ones with fully specified bits. Conversely, serialization based methods allow to use fully specified test sequences, that are significantly smaller. This paper first presents a new method for horizontal test data compression and secondly proposes an answer to the question: is there really a benefit in terms of test application time (TAT) and test data volume of using compression instead of a simple serialization of test data?.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信