论文部分内容阅读
提出一种在高层次综合过程中考虑可测性的算子资源分配算法：在算子调度完成后，通过建立各个算子之间的操作相容图和可测性相斥图，从而得到考虑可测性的操作相容图，然后对该图进行等价子类划分并使同一等价子类的操作共享同一资源，这样避免了综合时生成不可测或难测试的电路结构。根据文中算法建立了一个可测性高层次综合系统Ｔｅｓｔｓｙｎ，并对通用测试电路（ｂｅｎｃｈｍａｒｋ）作了实验，说明了算法的有效性。
This paper proposes an operator resource allocation algorithm that takes account of testability in high-level synthesis process. After operator scheduling is completed, the operator-compatible graph and the scalar repulsive graph between operators are considered Testable compatibility map, and then the figure for the equivalent subclass division and the same sub-class operations share the same resources, thus avoiding the synthesis of unmeasurable or difficult to test the circuit structure. According to the algorithm in the paper, a testable high-level synthesis system named Testsyn is established, and experiments are carried out on the universal test bench, which shows the effectiveness of the algorithm.