Complete test set for multiple-valued logic networks

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of The International Symposium on Multiple-Valued Logic
PublisherPubl by IEEE
Pages289-296
Number of pages8
ISBN (Print)0818656522
StatePublished - 1994
EventProceedings of the 24th International Symposium on Multiple-Valued Logic - Boston, MA, USA
Duration: 25 May 199427 May 1994

Publication series

NameProceedings of The International Symposium on Multiple-Valued Logic
ISSN (Print)0195-623X

Conference

ConferenceProceedings of the 24th International Symposium on Multiple-Valued Logic
CityBoston, MA, USA
Period25/05/9427/05/94

Fingerprint

Dive into the research topics of 'Complete test set for multiple-valued logic networks'. Together they form a unique fingerprint.

Cite this