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

几种求取电路最小测试集算法的比较研究
引用本文:张菲菲,鲁昌华,王妍妍. 几种求取电路最小测试集算法的比较研究[J]. 电测与仪表, 2006, 43(3): 43-45,39
作者姓名:张菲菲  鲁昌华  王妍妍
作者单位:合肥工业大学,合肥,230009;合肥工业大学,合肥,230009;合肥工业大学,合肥,230009
基金项目:安徽省教育厅自然科学基金;合肥工业大学校科研和教改项目
摘    要:近年来发展的离散事件系统(DES)为数模混合电路中数字信号和模拟信号提供了一种统一的测试方法,而求取电路的最小测试集一直是该研究领域的重点和难点。本文阐述了目前学者提出的几种求取最小测试集算法的基本思想,分析了各算法的优缺点,并深入地比较了各个算法,通过具体实验说明了各算法的优劣性,最后指出了该学科今后的发展方向。

关 键 词:离散事件系统  最小测试集  算法复杂度
文章编号:1001-1390(2006)03-0043-03
收稿时间:2005-10-27
修稿时间:2005-10-27

Study on Some Algorithms for the Computing of the Minimal Test Set of Circuits
ZHANG Fei-fei,LU Chang-hua,WANG Yan-yan. Study on Some Algorithms for the Computing of the Minimal Test Set of Circuits[J]. Electrical Measurement & Instrumentation, 2006, 43(3): 43-45,39
Authors:ZHANG Fei-fei  LU Chang-hua  WANG Yan-yan
Affiliation:Hefei University of Technology, Hefei 230009, China
Abstract:Discrete Event System(DES) theory provides a uniform,systemic and efficient method for testing the digital and analog signals in the mixed-signal circuits.The computing of the minimal test set of circuits is a key and difficulty in this field,this paper studies some algorithms for computing the minimal test set of circuits,expounds the their thoughts,analyzes their advantages and disadvantages,and compares them.The experiment shows that every algorithm's run time,and future research directions are pointed out.
Keywords:DES  minimal observable event set(minOES)  the complexity of the algorithmquency tracking
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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