An efficient algorithm to partition the combinational circuits for pseudoexhaustive testing

Proceedings of the Seventeenth National Radio Science Conference. 17th NRSC'2000 (IEEE Cat. No.00EX396) Pub Date : 2000-02-22 DOI:10.1109/NRSC.2000.838953

M. El-Mahlawy, W. Waller

引用次数: 8

Abstract

We have presented an efficient algorithm to partition the combinational circuits for built-in pseudoexhaustive self-testing of VLSI circuits. The partitioning procedure is based on several heuristics that enable the procedure to overcome the unexpected results of the greedy heuristic procedure.

查看原文本刊更多论文

伪穷举测试中组合电路划分的一种有效算法

提出了一种有效的组合电路划分算法，用于VLSI电路的内建伪穷举自测试。划分过程基于几种启发式方法，使划分过程能够克服贪心启发式过程的意外结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of the Seventeenth National Radio Science Conference. 17th NRSC'2000 (IEEE Cat. No.00EX396)

自引率

0.00%

发文量