Modular decomposition of combinatorial multiple-values circuits

A decomposition approach to the modular design of multiple-valued logic functions is discussed. Systematic procedures to utilize a fixed set of building blocks from which an arbitrary function can be designed are illustrated. The building blocks are composed of T gates (multiplexers). The first step...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. 37; no. 10; pp. 1293 - 1301
Main Authors Fang, K.-Y., Wojcik, A.S.
Format Journal Article
LanguageEnglish
Published IEEE 01.10.1988
Subjects
Automatic control
Circuit faults
Circuit testing
Fault tolerance
Integrated circuit interconnections
Logic design
Logic functions
Space technology
Very large scale integration
Online AccessGet full text

Cover

More Information
Summary:A decomposition approach to the modular design of multiple-valued logic functions is discussed. Systematic procedures to utilize a fixed set of building blocks from which an arbitrary function can be designed are illustrated. The building blocks are composed of T gates (multiplexers). The first step is the partitioning of all logic functions into classes. Representative building blocks for each class are then developed. Finally, optimization techniques are described that reduce the number of building blocks required in the design. This approach is, in principle, applicable to functions in any radix and will always yield a design for the target function. Examples are presented to illustrate the approach for ternary functions.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
1557-9956
DOI:10.1109/12.5993