数字电路与系统可测性测度及计算软件分析.pdfVIP

摘 要 数字系统中可测性的测度是表征电路可测性难易程度的一个量，可测性 是用可控制性和可观察性来表征的。在电路设计过程中，就应该对所设计的 电路的可测性进行分析，以估计电路的可测性，为了便于数字系统的测试， 对可测性太差的电路必须对其进行可测性改进设计，以提高其可测性。 本文用面向对象程序设计语言构造描述集成电路的数据结构，论文详细 介绍了数字电路的拓扑结构的描述方法，给出了可测性分析算法，并将有向 图的拓扑排序引入可测性分析程序设计，提高了可测性分析的计算速度。理 论分析和试验结果表明，用改进后的算法计算可控性、可观性是行之有效的。 本文第一章讨论了课题的研制背景及意义。第二章对可测性分析进行了 介绍。第三章讲述了数字电路拓扑结构的描述及数据结构的实现。第四章讲 述了算法的设计与实现。第五章讲述程序界面的设计与实现。第六章总结， 并提出了一些设计上的改进意见，以使该设计更加完善。 关键字： 可测性，算法，数据结构 拓扑排序 I ABSTRACT Testability measure for a digital system is a quantitative indication which reflects the difficulty or ease degree while a circuit is tested. Testability for digital circuit is expressed with controllability and observebility. Early in the design process of a circuit ， Testability analysis of the designed circuit is given in order to evaluate its testability. To be easy for the testing of digital system ， the design of the circuit with too bad testability must be modified to improve its testability. In this paper, the data structure which is used to describe the topology of integrated circuit is constructed by virtue of Object-Oriented programming language, the description method of digital circuit is presented, testability analysis is given and the topological sort of graphics is introduced to program design of testability analysis. As a result, calculation speed of testability analysis is improved. Theoretical analysis and experiments indicate that the calculation of controllability and observability using algorithm in this paper is effective. Chapter one introduces the background and significance about the task 。 Chapter two introduces the test