首页 | 本学科首页   官方微博 | 高级检索  
     

GLOBAL: A Design for Random Testability Algorithm
作者姓名:Xiang Dong  Wei Daozheng
作者单位:CAD Lab.,Institute of Computing Technology,Chinese Academy Of Sciences,Beijing 100080
摘    要:1MotivationsIncreasingdensityofVLSIchipsmakesthecostoftestingveryexpensive.Designfortestabilitycantemperthisproblemdrastically.Therearetwokindsofsolutions:(i)localsolutionl3'2]withlowcomputingcomplexity,whichcannotalwaysgetsatisfactoryresults;(ii)globa.lsolutionwithprohibitivecomputingcomplekityl1'5].T.H.Chen'andM.A.Breuer1lpresentedanILPmodeltoplacetestpointsglobally.Becauseofitscomputingcomplealty,1lcanonlydealwithsmallormediumscalecircuits.SCOAPisusedin1],whichisnotaveryaccuratet…

关 键 词:计算机图形学  整体算法  曲面交叉线

GLOBAL: A design for random testability algorithm
Xiang Dong,Wei Daozheng.GLOBAL: A Design for Random Testability Algorithm[J].Journal of Computer Science and Technology,1994,9(2):182-192.
Authors:Dong Xiang  Daozheng Wei
Affiliation:CAD Lab.; Institute of Computing Technology; Chinese Academy Of Sciences; Beijing 100080;
Abstract:A global design for testability algorithm is offered in this paper. First, a test point candidate set is obtained to simplify the test point placemellt problem; the principle of selective tracing is offered to get a sequential test point placement solution, which is used as the initial solution of the global algorithm. Using this initial value, a branch & bound algorithm is then offered to obtain a global design for testability solution. Finally,a new test length analyser is offered to evaluate the global design for testability.
Keywords:Test point  testability  test length  design for testability
本文献已被 CNKI SpringerLink 等数据库收录!
点击此处可从《计算机科学技术学报》浏览原始摘要信息
点击此处可从《计算机科学技术学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号