## Abstract

This correspondence presents a theoretical study on the synthesis of multiple-valued logic networks based on tree-type universal logic modules (T-ULM’s). The mathematical notation of T-ULM is introduced. On the basis of the mathematical properties, an algorithm for synthesizing an arbitrary logic function of n variables with a smaller number of modules is presented. In this algorithm, only true and constant inputs are allowed at input terminals. The algorithm consists of two parts. The first one is a functional decomposition, and the other one is the proper order of the expansion which is the problem of finding the most incomplete tree structure. Thus it is established that the systematic and nonexhaustive procedure of the algorithm gives a suboptimal solution for the reduction of the number of T-ULM’s.

Original language | English |
---|---|

Pages (from-to) | 1297-1302 |

Number of pages | 6 |

Journal | IEEE Transactions on Computers |

Volume | C-26 |

Issue number | 12 |

DOIs | |

Publication status | Published - 1977 Dec |

Externally published | Yes |

## Keywords

- Compatible set
- Complex disjunctive decomposition
- Control variables
- Dependency
- Expansion
- Residue functions
- Row multiplicity
- Ternary T-gate
- Tree-type universal logic module (T-ULM)
- True and constant inputs

## ASJC Scopus subject areas

- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics