Complete test set for multiple-valued logic networks

Hui Min Wang, Chung Len Lee, Jwu E. Chen

研究成果: 書貢獻/報告類型會議論文篇章同行評審

2 引文 斯高帕斯(Scopus)

摘要

A complete test set (CTS) is defined and derived for multiple-valued logic (MVL) Min/Max networks. The CTS can detect any single and multiple stuck-at faults of the MVL Min/Max network regardless of its implementation. Two splitting algorithms to generate the CTS for a given MVL function are proposed. One algorithm demonstrates over 2 orders speed improvement and 3 orders memory savings and the other algorithm demonstrates over 4 orders speed improvement and 2 orders memory savings with respect to the conventional truth table enumerating method.

原文???core.languages.en_GB???
主出版物標題Proceedings of The International Symposium on Multiple-Valued Logic
發行者Publ by IEEE
頁面289-296
頁數8
ISBN(列印)0818656522
出版狀態已出版 - 1994
事件Proceedings of the 24th International Symposium on Multiple-Valued Logic - Boston, MA, USA
持續時間: 25 5月 199427 5月 1994

出版系列

名字Proceedings of The International Symposium on Multiple-Valued Logic
ISSN(列印)0195-623X

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???Proceedings of the 24th International Symposium on Multiple-Valued Logic
城市Boston, MA, USA
期間25/05/9427/05/94

指紋

深入研究「Complete test set for multiple-valued logic networks」主題。共同形成了獨特的指紋。

引用此