Decomposition-based synthesis of multiple-valued functions for threshold logic network realization

Author

Abdel-Hamid, Gamal H. ; Abd-El-Barr, Mostafa H.

Author_Institution

Dept. of Comput. Sci., Saskatchewan Univ., Saskatoon, Sask., Canada

fYear

1994

fDate

25-27 May 1994

Firstpage

58

Lastpage

64

Abstract

In this paper, a sub-optimal algorithm for reducing the number of threshold elements required to realize a given binary function is presented. The algorithm uses a matching-count matrix to obtain the input-output pairing that results the maximum total matching count, thus minimizing the number of switching operations required. The concept of output phase assignment is used to extend the approach to handle multiple-valued logic functions. Experimental results are given to illustrate the merits of the proposed algorithms

Keywords

logic design; many-valued logics; minimisation of switching nets; threshold elements; threshold logic; decomposition-based; input-output pairing; matching-count matrix; multiple-valued functions; multiple-valued logic functions; output phase assignment; synthesis; threshold elements; threshold logic; Circuit synthesis; Computer networks; DH-HEMTs; Logic functions; Matrix decomposition; Network synthesis; Switches; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Multiple-Valued Logic, 1994. Proceedings., Twenty-Fourth International Symposium on

Conference_Location

Boston, MA

Print_ISBN

0-8186-5650-6

Type

conf

DOI

10.1109/ISMVL.1994.302219

Filename

302219