Don't cares and multi-valued logic network minimization

We address optimizing multi-valued (MV) logic functions in a multi-level combinational logic network. Each node in the network, called an MV-node, has multi-valued inputs and single multi-valued output. The notion of don't cares used in binary logic is generalized to multi-valued logic. It cont...

Full description

Saved in:
Bibliographic Details
Published inDigest of technical papers - IEEE/ACM International Conference on Computer-Aided Design pp. 520 - 525
Main Authors Yunjian Jiang, Brayton, R.K.
Format Conference Proceeding Journal Article
LanguageEnglish
Published IEEE 2000
Subjects
Circuit synthesis
Computer networks
Minimization methods
Multivalued logic
Observability
Online AccessGet full text

Cover

More Information
Summary:We address optimizing multi-valued (MV) logic functions in a multi-level combinational logic network. Each node in the network, called an MV-node, has multi-valued inputs and single multi-valued output. The notion of don't cares used in binary logic is generalized to multi-valued logic. It contains two types of flexibility: incomplete specification and non-determinism. We generalize the computation of observability don't cares for a multi-valued function node. Methods are given to compute (a) the maximum set of observability don't cares, and (b) the compatible set of observability don't cares for each MV-node. We give a recursive image computation to transform the don't cares into the space of local inputs of the node to be minimized. The methods are applied to some experimental multi-valued networks, and demonstrate reduction in the size of the tables that represent multi-valued logic functions.
Bibliography:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISBN:9780780364455
0780364457
ISSN:1092-3152
1558-2434
DOI:10.1109/ICCAD.2000.896525