Issue No. 10 - October (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.5993
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
modular decomposition; combinatorial multiple-values circuits; logic functions; multiplexers; optimization; ternary functions; combinatorial circuits; many-valued logics.
K. Fang and A. Wojcik, "Modular Decomposition of Combinatorial Multiple-Values Circuits," in IEEE Transactions on Computers, vol. 37, no. , pp. 1293-1301, 1988.