Proceedings 1997 27th International Symposium on Multiple- Valued Logic

28-30 May 1997

Filter Results

Displaying Results 1 - 25 of 43
  • Proceedings 1997 27th International Symposium on Multiple- Valued Logic

    Publication Year: 1997
    Request permission for commercial reuse | PDF file iconPDF (220 KB)
    Freely Available from IEEE
  • Decomposition of multiple-valued relations

    Publication Year: 1997, Page(s):13 - 18
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (630 KB)

    This paper presents a new decomposition problem: decomposition of multi-valued (MV) relations, and a method of its solution. Decomposition is non-disjoint and multi-level. A fundamental difference in decomposition of MV functions and MV relations is discussed: the column (cofactor) pair compatibility translates to the group compatibility for functions, but not for relations. This makes the decompo... View full abstract»

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

    Publication Year: 1997, Page(s): 293
    Request permission for commercial reuse | PDF file iconPDF (57 KB)
    Freely Available from IEEE
  • Cube diagram bundles: a new representation of strongly unspecified multiple-valued functions and relations

    Publication Year: 1997, Page(s):287 - 292
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    Efficient function representation is very important for speed and memory requirements of multiple-valued decomposers. This paper presents a new representation of multiple-valued relations (functions in particular), called multiple-valued cube diagram bundles (MVCDB). MVCDBs improve on rough partition representation by labeling their blocks with variable values and by representing blocks efficientl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fourier decision diagrams on finite non-Abelian groups with preprocessing

    Publication Year: 1997, Page(s):281 - 286
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    This paper introduces a method for optimization of Fourier decision diagrams representations of discrete functions based on the preprocessing of the represented functions. Fourier decision diagrams are defined for matrix-valued-function on non-Abelian groups. Their application to number-valued functions is provided through a simple preprocessing of the represented functions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Properties of Lindenmayer fuzzy languages and α-driven Lindenmayer languages

    Publication Year: 1997, Page(s):195 - 200
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    This paper introduces Lindenmayer fuzzy languages and studies some of their properties. Lindenmayer languages are characterized by a parallel rewriting generation process. Lindenmayer fuzzy languages are characterized by expressiveness. Closure as well as a non-monotonic development aspects of these languages and their α-cut are discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Family of complex Hadamard transforms: relationship with other transforms and complex composite spectra

    Publication Year: 1997, Page(s):125 - 130
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    Relationship of the recently introduced family of unified complex Hadamard transforms with other transforms used in binary and multiple-valued logic design are investigated in this paper. All the complex Hadamard matrices can be generated by a common unifying formula presented here. Only half of all possible 64 unified complex Hadamard transforms have half-spectrum property. The existence of such ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-junction surface tunnel transistors for multiple-valued logic circuits

    Publication Year: 1997, Page(s):41 - 46
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    Multiple-junction surface tunnel transistors (MJ-STTs), in which gate-controlled multiple p-/n- tunnel-junctions are connected in series between the source and drain, are proposed for application as multiple-valued logic circuits. The transistor operation with four negative-differential-resistance characteristics is confirmed by fabricating a GaAs-based four-tunnel-junction M... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Circuit design from Kronecker Galois field decision diagrams for multiple-valued functions

    Publication Year: 1997, Page(s):275 - 280
    Cited by:  Papers (19)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    In this paper we define the Kronecker Galois field decision diagrams (KGFDDs), a generalization of Kronecker decision diagrams (KDDs) to the representation of multiple-valued (MV) functions. Starting from the multi-place decision diagrams (MDDs) and Galois field decision diagrams (GFDDs) we give a generalization that allows more compact representation with respect to the nodes needed. Based on KGF... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ternary decision diagrams. Survey

    Publication Year: 1997, Page(s):241 - 250
    Cited by:  Papers (22)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    This paper surveys seven types of TDDs: General-TDD, SOP-TDD, ESOP-TDD, AND-TDD, prime-TDD, EXOR-TDD, and Kleene-TDD. We give new definitions for SOP-TDDs and ESOP-TDDs and introduce unifying terminology. After showing some theorems on complexities, we compare the sizes of these TDDs using benchmark functions. Finally, we review important works on TDDs View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VLSI design of a quaternary multiplier with direct generation of partial products

    Publication Year: 1997, Page(s):169 - 174
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    This paper presents the VLSI design of a novel quaternary multiplier with direct generation of partial products using a radix-4 redundant number system. The structure of the multiplier is so simple and regular that it is suitable for VLSI implementation. Partial products in the multiplier are generated as the corresponding value 0 to 9 and are implemented by simple CMOS current-mode circuits. To a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Training fuzzy logic based software components for reuse

    Publication Year: 1997, Page(s):189 - 194
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    A training framework of an effective method for off-line training of a class of control software components (for example, for first-order nonlinear feedback control systems) using combinations of three kinds of adaptation algorithms is presented. Each control software component is represented at the abstract level by means of a set of adaptive fuzzy logic (FL) rules and at the concrete level by me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • What is many-valued logic?

    Publication Year: 1997, Page(s):117 - 121
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    Firstly we examine the definition of many-valued logic within the framework of (logical) matrix theory. Secondly we discuss the general result, challenging the existence of many-valued logic, according to which every logic may be seen as two-valued. Thirdly we analyze the principle of bivalence and show that it appears at a deeper level than one usually thinks View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding composition trees for multiple-valued functions

    Publication Year: 1997, Page(s):19 - 26
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realization of the function at a minimal cost. Previously and independently, the authors had studied the class of multiple-valued functions that are fully sensitive to their variables. These functions are useful for test generat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of ternary CCD circuits referencing to current-mode CMOS circuits

    Publication Year: 1997, Page(s):209 - 214
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    This paper investigates the relationship between current-mode and charge-mode circuits. In particular, it shows that four basic CCD logic elements have their counterparts in the current-mode circuits. This is in turn used to show how to apply design principles used for current-mode CMOS circuits to the design of charge-mode CCD circuits View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparison of the worst and best sum-of-products expressions for multiple-valued functions

    Publication Year: 1997, Page(s):55 - 60
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    Because most practical logic design algorithms produce irredundant sum-of-products (ISOP) expressions, the understanding of ISOPs is crucial. We show a class of functions for which Morreale-Minato's ISOP generation algorithm produces worst ISOPs (WSOP), ISOPs with the most product terms. We show this class has the property that the ratio of the number of products in the WSOP to the number in the m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of resonant-tunneling quaternary quantizer to ultrahigh-speed A/D converter

    Publication Year: 1997, Page(s):35 - 40
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    An analog-to-quaternary quantizer using resonant-tunneling (RT) devices is applied to an ultrahigh-speed analog-to-digital (A/D) converter. First, transient analysis results for the quaternary quantizer, which consists of six RT diodes and one HEMT, are presented. A 4-bit A/D converter employing this quantizer with multiple-valued logic encoding circuits is then described. The number of transistor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A proof method for the six-valued logic for incomplete information

    Publication Year: 1997, Page(s):223 - 226
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    O. Garcia and M. Moussavi (1990) proposed a six-valued logic to model incomplete information. Although their logic is promising, it lacks a proof theory to serve as a basis for automated reasoning. We describe a sequent style proof method for the logic and show that the consequence relation in the logic is equivalent to the one by N.D. Belnap's (1977) four-valued logic. We also suggest alternative... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of an asynchronous digital system with B-ternary logic

    Publication Year: 1997, Page(s):265 - 271
    Cited by:  Papers (4)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    Some of the recent digital systems have a serious clock skew problem which comes from huge hardware implementations and high speed operations in VLSI's. To overcome this problem, clock distribution techniques and more notably, asynchronous system design methodologies, have been investigated. Since, the latest asynchronous digital systems use two-rail logic with two-phase data transfer manner, more... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-valued immune network model and its simulations

    Publication Year: 1997, Page(s):233 - 238
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    This paper describes a new model of multiple-valued immune network based on biological immune response network. The model of multiple-valued immune network is formulated based on the analogy with the interaction between B cells and T cells in immune system. The model has a property that resembles immune response quite well. The immunity of the network is simulated and makes several experimentally ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-valued programmable logic arrays with universal literals

    Publication Year: 1997, Page(s):163 - 168
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    A universal literal is a single-variable function and has an ability to manipulate more information than a set literal. The array size therefore could be eliminated by using universal literal generators (ULGs for short) in programmable logic arrays (PLAs), compared to PLAs with set literals. This paper discusses what operator is the most suitable in the term of eliminating the array size. We find ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault simulation in sequential multi-valued logic networks

    Publication Year: 1997, Page(s):145 - 150
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    In this paper we present a fault simulator for Sequential Multi-Valued Logic Networks (SMVLN). With this tool we investigate their random pattern testability (RPT). We discuss a unified approach for fault models in SMVLNs and show that it is possible to describe all static fault models with a global formalism. A large set of experimental results is given that demonstrates the efficiency of our app... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hyperclones on a finite set

    Publication Year: 1997, Page(s):83 - 88
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    The composition-closed sets of multivalued operations, called hyperclones, defined on the finite set E(k)={0, 1, …, k-1} (k⩾2) are investigated. It is shown that the lattice of all hyperclones on E(k) is dual atomic and has only the finite number of dual atoms (maximal hyperclones). Some of them are described in this paper. The full list of hyperclones defined on the set E(2) which are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A useful application of CMOS ternary logic to the realisation of asynchronous circuits

    Publication Year: 1997, Page(s):203 - 208
    Cited by:  Papers (3)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    This paper shows how the application of a CMOS ternary logic is useful in the realisation of delay insensitive (DI) asynchronous circuits. It is shown that fully DI asynchronous circuits are obtained with a ternary handshake protocol which employs the third logic level as idle state of the asynchronous interface. The advantages obtained are a dramatic reduction of the communication requirement and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Properties and applications of unified complex Hadamard transforms

    Publication Year: 1997, Page(s):131 - 136
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    A family of Unified Complex Hadamard Transforms derived from Walsh functions is defined. Newly developed direct matrix operator is introduced which is able to generate different types of Complex Hadamard matrices. Higher dimension matrices of the transforms may also be generated recursively by means of Kronecker product from basic matrices. Sparse matrix factorization or matrix partitioning of the... View full abstract»

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