The Word-Level Models for Efficient Computation of Multiple-Valued Functions. PART 1: LAR Based Model

  • Authors:

  • Svetlana N. Yanushkevich;Piotr Dziurzanski;Vlad P. Shmerko

  • Affiliations:

  • -;-;-

  • Venue:
  • ISMVL '02 Proceedings of the 32nd International Symposium on Multiple-Valued Logic
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new model of a multi-level combinational Multiple-Valued Logic (MVL)circuit with no feedback and no learning is introduced. This model includes Neuron-Like Gates (NLGs), each represents a level of the MVL circuit, so that the number of NLGs in the corresponding Neural-Like Network (NLN)s equal to the number of levels n the circuit. The formal description of an NLG is a Linear Arithmetic Expression (LAR)that is directly mapped to the Linear word-level Decision Diagram (LDD)planar by its nature. Thus, an l -level MVL circuit is described by a set of l LDDs. The experiments on simulation of large MVL circuits show that the LDD format of an MVL circuit consumes 5-20 times less memory than EDIF and ISCAS formats. The proposed technique allows to simulate an arbitrary MVL circuit by an NLN and corresponding set of LDDs. In particular, we successfully simulated an NLN with about 250 NLGs corresponding to an MVL circuit with more than 8000 ternary gates that has been impossible by any recently reported threshold gate-based network.