By Topic

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

Date 25-27 May 1994

Filter Results

Displaying Results 1 - 25 of 51
  • Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94)

    Publication Year: 1994
    Request permission for commercial reuse | PDF file iconPDF (21 KB)
    Freely Available from IEEE
  • A weak propositional calculus for signal processing with thresholds

    Publication Year: 1994, Page(s):356 - 361
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    A weak propositional calculus is presented for signal processing with lower threshold z and upper threshold u. For this result all signals are scaled to lie within the linearly ordered real interval [0,1], with focus on the case 0<z<u<1. A still weaker propositional calculus is given where this linear ordering is related to partial ordering in bounded distributive lattices View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A four-valued logic and switch-level differences

    Publication Year: 1994, Page(s):362 - 367
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    In this paper, the application of a four-valued logic to the switch-level test generation is studied. A switch-level operator fault model is proposed. Switch-level U difference and Z difference of a function to a fault are defined. A method to derive switch-level differences is given. Finally, a new switch-level test generation algorithm for CMOS circuits is presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On scheduling in multiprocessor systems using fuzzy logic

    Publication Year: 1994, Page(s):141 - 147
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    Proposes an algorithm for processor partitioning in multiprocessor systems. The algorithm is based on fuzzy logic. It takes crisp inputs that represent the remaining amount of work and the efficiency of an application and produces the output that determines the number of processors that are to be allocated to the application during a given reallocation period. Simulation results are presented that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of fault-tolerant cellular arrays on multiple-valued logic

    Publication Year: 1994, Page(s):297 - 304
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    This paper discusses the problems of the design and the fault tolerance in multiple-valued cellular arrays by considering the single-level array, the two-level array and the three-level array. These arrays are constructed by some cells that have the unique switch operation. It assumes the stuck-at-0 fault and the stuck-at-(k-1) fault of the switch cells on k-valued cellular arrays. The fault-toler... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimization for Kleene-Stone logic functions

    Publication Year: 1994, Page(s):124 - 131
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    Since the concept of fuzzy sets is proposed by L.A. Zadeh, as the extensions of Boolean functions many multiple-valued logic functions permitted to take truth values besides 0 and 1 have been investigated. Each one of multiple-valued logic functions motivated by the concept of fuzzy sets is one of the models of Kleene algebras, which have almost of the properties holding in Boolean algebras exclud... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decomposition-based synthesis of multiple-valued functions for threshold logic network realization

    Publication Year: 1994, Page(s):58 - 64
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    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 t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hereditary clones of multiple valued logic algebra

    Publication Year: 1994, Page(s):306 - 313
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    We discuss relationships between properties and operations over the set Ω of MVL functions. Closed properties are those invariant under the classical closure operation. A new type of properties, called hereditary, is defined, as well as hereditary closure. We calculate the ratio of hereditary properties, describe the families of maximal hereditary clones, and give a formula for their enumera... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Searching for complete functions over E(3) with small radii

    Publication Year: 1994, Page(s):172 - 176
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    Recent advances in laser and fiber optic technology have made it feasible to build optical processors which are based upon value systems larger than E(2)={0,1}. The problem of designing a transistor which can be used as the basis for the circuits of such a processor involves a detailed study of functions which are either complete or complete with constants over E(3) and E(4). The radii of all comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interband-tunneling III-V semiconductor structures for multiple-valued literal and arithmetic functions

    Publication Year: 1994, Page(s):198 - 206
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    Earlier MVL circuits used resonant tunneling devices based on intraband tunneling. Recently device concepts were explored in the AlSb/InAs system based on interband tunneling. Here non-resonant tunneling discharge from the 2DEG is effected into p+ doped InAs gates, whereas the 2DEG current is controlled with a Schottky gate as in the conventional HEMT. A wide range of physical and funct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CML current mode full adders for 2.5-V power supply

    Publication Year: 1994, Page(s):10 - 14
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    We present the basic structure and performance of CML current mode full adders, that are used as carry save adders (CSA) in combinatorial multipliers. A 1.2 μm BiCMOS technology is used for simulations but the schematic assumes a 2.5-V power supply. Compared with binary voltage mode CSAs, the multivalued current mode CSAs have chip area and power dissipation advantage, but speed disadvantage. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel processing of fuzzy inferences

    Publication Year: 1994, Page(s):134 - 140
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    Rule based systems are computationally very demanding, since a large number of rules has to be evaluated every time new input data are observed in order to undertake a corresponding action. The authors study the possible improvements in performance by using parallel processing. Both fine grade algorithms and standard multiprocessor architectures for Mamdani-type fuzzy systems with two inputs and o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A field programmable analog array for continuous, fuzzy, and multi-valued logic applications

    Publication Year: 1994, Page(s):148 - 155
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    We propose a novel approach to the realization of continuous, fuzzy, and multi-valued logic (mvl) circuits. We demonstrate how a general-purpose field programmable analog array (FPAA), with cells realizing simple arithmetic operations on signals, can be used for this purpose. The FPAA, which is being implemented in a bipolar transistor array technology, operates from ±3.3 V or ±5 V p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattices of resolution logics

    Publication Year: 1994, Page(s):108 - 114
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    We study classes of logical calculi which have the same inconsistent sets of formulas. We investigate the algebraic structure of these classes as well as general properties of logical calculi in these classes in the context of the search for efficient resolution based automated reasoning methods View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Calculation of Reed-Muller-Fourier coefficients of multiple-valued functions through multiple-place decision diagrams

    Publication Year: 1994, Page(s):82 - 88
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    We extend the method for the calculation of Walsh transform of binary switching functions through the binary decision diagrams to the calculation of Reed-Muller-Fourier transform of p-valued through multiple-place decision diagrams functions through multiple-place decision diagrams. The calculation of Reed-Muller coefficients of binary switching functions is involved as a special case for p=2 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient graph based representation of multi-valued functions with an application to genetic algorithms

    Publication Year: 1994, Page(s):65 - 72
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    We present a new general data structure for representation of multi-valued input, multi-valued output functions, called function graphs (FG). Ordered FGs are shown to be a canonical form. We investigate read-once FGs and show that type-restricted FGs are also canonical. We use FGs for multi-valued set representation and manipulation. They allow efficient manipulation algorithms for set operations,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Many-valued generalizations of two finite intervals in Post's lattice

    Publication Year: 1994, Page(s):314 - 318
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    E.L. Post's study (1941) shows that, although the lattice of clones in 2-valued logic is countably infinite, there exist only finitely many clones which contain both constants, and only finitely many which contain the negation function (neg). There are, however, uncountably many k-valued clones for all k>2; in fact, I. Agoston, et al. (1983) have shown that there are uncountably many containing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification of linear ternary logic functions and its algorithms

    Publication Year: 1994, Page(s):324 - 327
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    A new approach to identify the linear ternary logic functions is introduced. It is easy to know if a ternary function is linear using its truth-valued vector and three-three compression algorithm presented in this paper. The algebraic expression of the linear logic function given by its truth-valued vector can be derived from the three-three compression algorithm View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-valued-input TANT networks

    Publication Year: 1994, Page(s):334 - 341
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    The paper proposes mvTANTs, three-level networks with multiple-valued inputs and binary outputs. These networks are a generalization of binary TANTs (Three level And Not networks with True Inputs). One of possible interpretations of mvTANT is a four-level binary network with input decoders which realize multiple-valued literals. Similar to mvPLAs, mvTANTs have regular structures with predictable t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Soft computing perspectives

    Publication Year: 1994, Page(s):276 - 281
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    Soft computing stands for methods and techniques in fuzzy logic, probabilistic reasoning, neural networks, genetic algorithms, chaos or other approaches related to cognitive modelling. These overlapping domains can reinforce each other, thus offering suitable tools to represent and solve real world problems. Genetic algorithms and classifier systems are introduced in the framework of soft computin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Completeness criteria in many-valued set logic under compositions with Boolean functions

    Publication Year: 1994, Page(s):177 - 183
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    Discusses the functional completeness problems in r-valued set logic, which is the logic of functions mapping n-tuples of subsets into subsets over r values. Boolean functions are convenient choice as building blocks in the design of set logic functions. A set of functions F is Boolean complete if any set logic function can be composed from F once all Boolean functions are added to F. The paper pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quaternary multiplier circuit

    Publication Year: 1994, Page(s):15 - 18
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    A new quaternary multiplier circuit is presented. This current-mode CMOS circuit multiplies the values of two quaternary-valued input currents and adds a ternary-valued carry input current to generate the two-quaternary-digit output: a most-significant-digit ternary-valued CARRY output current and a quaternary-valued PRODUCT output current. This multiplier circuit uses 49 MOS transistors and gener... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of wave-parallel computing circuits for densely connected architectures

    Publication Year: 1994, Page(s):207 - 214
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    Investigates new architecture LSIs based on wave-parallel computing (WPC) to address the interconnection problems in highly parallel VLSI systems. The underlying concept is frequency multiplexing of digital signals, which enables the utilization of the parallelism of electrical (or optical) waves for parallel processing. The key to success with WPC architecture lies in finding efficient implementa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On multiple-valued separable unordered codes

    Publication Year: 1994, Page(s):350 - 355
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    A new encoding/decoding scheme of multiple-valued separable balanced codes are presented. These codes have 2·m information digits and m·(R-2) check digits in radices R⩾4, and 2·m-1 information digits and m+1 check digits in R=3 where code-length n=R·m. In actual use of code-lengths and radices, it is shown that the presented codes are efficient in comparison with mu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectral transformation of multiple-valued decision diagrams

    Publication Year: 1994, Page(s):89 - 96
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    This paper describes an algorithm which performs a spectral transformation of a multiple-valued function directly from a decision diagram representation. The spectrum is in turn represented as a decision diagram. The advantage of adding cycle operations to a spectral decision diagram is shown. The complexity of the representation of the spectrum is not fixed as in the matrix case and is shown to b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.