The word-level models for efficient computation of multiple-valued functions.2. LWL based model

For pt.1 see ibid., p. 202-8 (2002). This paper is a continuation of the study of neural-like networks (NLNs) for computation of multiple-valued logic (MVL) functions. NLN is defined as a feedforward network with no learning. In contrast to classical neural networks with threshold gates (TGs), the proposed NLN is built of so-called neuron-like gates (NLGs). It was shown in our previous study that NLG is modelled by a linear arithmetical expression (LAR). In this paper we show an even more simple NLG model. We have developed two word-level models; linear weighted logic expressions (LWLs) and a corresponding set of linear decision diagrams (LDDs). We compare the LWL- and LAR-based NLNs. The experimental study on large MVL circuits shows that the number of nodes in the LDDs derived from LWLs is four times less on average compared to those derived from LARs. They are also 2-7 times more compact (require less memory to store the terminal values)