.png){kind=icon}
返回
An adaptive heuristic algorithm for VLSI test vectors selection
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2008.03.049.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The increasing complexity of today's system-on-a-chip designs is putting more pressure on the already stressed design verification process. The verification plan must cover several individual cores as well as the overall chip design. Conditions to be verified are identified by the system's architects, the designers, and the verification team. Testing for these conditions is a must for the design to tape out, especially for high priority conditions. A significant bottleneck in the verification process of such designs is that not enough time is usually given to the final coverage phase, which makes computing cycles very precious. Thus, intelligent selection of test vectors that achieve the best coverage using the minimum number of computing cycles is crucial for on time tape out. This paper presents a novel heuristic algorithm for test vectors selection. The algorithm attempts to achieve the best coverage level while minimizing the required number of computing cycles. (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
Heuristic algorithms
Integer programming
VLSI
Verification
SCP
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Investigating trends in those who experience menstrual bleeding changes after SARS-CoV-2 vaccination.png)
OAAI
IF0
OAAI分享收藏Computational experience with approximation algorithms for the set covering problem集合覆盖问题的近似算法的计算经验
PREAI
分享收藏THE EFFECTS OF PROBLEM-BASED LEARNING WITH THINKING MAPS ON FIFTH GRADERS’ SCIENCE CRITICAL THINKINGOAAI
OAAI分享收藏
查看更多内容