期刊文献+

基于紧致遗传算法的组合电路测试集压缩 被引量:2

Test set compaction for combinational circuit based on compact genetic algorithm
下载PDF
导出
摘要 随着电路集成度和复杂度的不断增加,电路测试所需的测试矢量集的规模也迅速增长。本文针对现有测试集压缩算法全局寻优能力不足的问题,提出一种基于紧致遗传算法的组合电路测试集压缩方法。紧致遗传算法不但具有良好的全局搜索能力,而且其基于小种群进化的特性可以有效地降低计算花费.非常适合处理数据大的大规模测试集压缩问题。对ISCAS-85标准电路测试集的实验表明,与同类方法相比,该压缩方法能够得到更小的测试集。 As the increasing of digital circuit integration level and complexity, the test set size grows rapidly. In this paper, a new test compaction algorithm based on compact genetic algorithm for combinational circuits is presented. Compact genetic algorithm has the ability of global searching, and only needs two individuals for evolution. So compact genetic algorithm can deal with large scale test set compaction and consume less computing resources. The results of experiments on the ISCAS-85 benchmark circuits show that, the proposed method can get smaller test set than other similar methods.
出处 《仪器仪表学报》 EI CAS CSCD 北大核心 2008年第11期2384-2388,共5页 Chinese Journal of Scientific Instrument
关键词 测试集压缩 紧致遗传算法 组合电路 集合覆盖 test set compaction compact genetic algorithm combinational circuit set cover model
  • 相关文献

参考文献13

  • 1GOEL P, ROSALES B C. Test generation and dynamic compaction of tests [ A ]. In Digest of Papers 1979 Test Conf[ C ], 1979 : 189-192.
  • 2KAJIHARA S, POMERANZ I, KINOSHITA K, et al. Cost effective generation of minimal test sets for stuck at faults in combinational logic circuits [ J ]. IEEE Trans. Computer-Aided Design Integr. Circuits Syst, 1995,14 (12) :1496-1504.
  • 3SCHULZ M H, TRISCHLER E, SARFERT T M. SOCRATES:A highly efficient automatic test pattern generation system [ J ]. IEEE Trans. Computer-Aided Design Integr. Circuits Syst. , 1988,7( 1 ) : 126-137.
  • 4KAJIHARA S, POMERANZ I, KINOSHITA K, et al. On compacting test sets by addition and removal of test vectors [ A ]. Proc IEEE VLSI test Symp [ C ], NJ : IEEE press, 1994:202-207.
  • 5HAMZAOGLU I, PATEL J H. Test set compaction algorithms for combinational circuits [ J ]. IEEE Trans. Compurer- Aided Design Integr. Circuits Syst, 2000,19(8): 957-963.
  • 6HOCHBAUM D S. An optimal test compression procedure for combinational circuits [ J ]. IEEE Trans. Computer-Aided Design Integr Circuits Syst, 1996,15 (10) : 1294-1299.
  • 7FLORES P F, NETO H C, MARQUES-SILVA J P. On applying set covering models to test set compaction [ A ]. In Proceeding of the 9^th Great Lakes Symposium on VLSI [ C ]. Los Alamitos: IEEE Computer Society Press, 1999:8-11.
  • 8BOATENG K O, KONISHI H, NAKATA T. A method of static compaction of test stimuli [ A ]. In Proceedings of the Asian Test Symposium[ C ]. Los Alamito:IEEE Computer Society Press, 2001 : 137-142.
  • 9康波,陈光■,吕炳朝.基于混沌遗传算法的故障测试集最小化方法[J].仪器仪表学报,2005,26(1):100-103. 被引量:8
  • 10侯艳丽,赵春晖,廖艳苹.基于粒子群算法的电路测试集优化[J].哈尔滨工程大学学报,2006,27(B07):506-509. 被引量:1

二级参考文献13

  • 1H Fujiwara, et al.. The complexity of fault detection problem for combination circuits. IEEE Trans. on Comp. ,1982,c-31(6) : 555~560.
  • 2Chellapilla K . Combining mutation operators in evolutionary programming[J]. IEEE Trans. on Evolutionary Computation. 1998,2(3) :91~96.
  • 3Potts J C. The development and evolution of an improved genetic algorithm based on migration and artificial selection [J]. IEEE Trans. Syst. Man and Cybern. ,1994,24(1) :73~96.
  • 4HAMZAOGLU I,JANAK H P.Test set compaction algorithms for combinational circuits[J].IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems,2000,19(8):957-963.
  • 5LU Chang-hua,ZHANG Qi-bo,JIANG Wei-wei.A global optimization algorithm for the minimum test set of circuits[J].IEEE International Conference on Robotics,Intelligent Systems and Signal Proceeding,2003 (10):1203-1207.
  • 6BYSTROV A,ALMAINI A E A.Testability and test compaction for design diagram circuits[J].IEEE Proc Circuits Devices Syst,1999,146(4):153-158.
  • 7KENNEDY J,EBRHART R C.Particle swarm optimization[A].In:Proc.IEEE Int'l.Conf.on Neural Networks,Ⅳ[C].Piscataway,1995.
  • 8KENNEDY J,EBRHART R C.A discrete binary version of the particle swarm algorithm[A].In:Proc.1997 Conf on Systems,Man,and Cybernetics[C].Piscataway,1998.
  • 9SHY Y,EBERTHART R C.Empirical study of particle swarm optimization[A].In:Proceedings of IEEE International Conference on Evolutionary Computation[C].Piscataway:IEEE Press,1998.
  • 10ANGELINE P J.Using selection to improve particle swarm optimization[A].IEEE International Conference on Evolutionary Computation[C].Anchorage,USA,1998,84-89.

共引文献7

同被引文献33

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部