Scheduled System Maintenance
IEEE Xplore is currently undergoing scheduled maintenance.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)

22-24 May 2017

Filter Results

Displaying Results 1 - 25 of 60
  • [Front cover]

    Publication Year: 2017, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (8570 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2017, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (103 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2017, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (137 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2017, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (114 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2017, Page(s):v - ix
    Request permission for commercial reuse | PDF file iconPDF (152 KB)
    Freely Available from IEEE
  • Message from the General Chairs

    Publication Year: 2017, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (77 KB)
    Freely Available from IEEE
  • Message from the Program Chair

    Publication Year: 2017, Page(s):xi - xii
    Request permission for commercial reuse | PDF file iconPDF (79 KB)
    Freely Available from IEEE
  • Committee Lists

    Publication Year: 2017, Page(s):xiii - xiv
    Request permission for commercial reuse | PDF file iconPDF (92 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2017, Page(s): xv
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • An Algorithm for Constraint Satisfaction Problem

    Publication Year: 2017, Page(s):1 - 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (211 KB) | HTML iconHTML

    Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on theform of the constraints can ensure tractability. The standard way to parameterize interesting subclasses of the constraint satisfaction problem is via finite constraint languages. The mainproblem is to classify those ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analog-to-Digital Converters Using Not Multi-level But Multi-bit Feedback Paths

    Publication Year: 2017, Page(s):7 - 12
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB) | HTML iconHTML

    Conventional analog-to-digital converters (ADCs) with medium or high bit-resolution have a feedback path that connects a tentative digital output with the analog input to obtain a final digital output. Digital-to-analog converters (DACs) are used in the feedback path to generate the multi-level analog signal that is needed to process the feedback signal with the input signal in the analog domain. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PAM-4 Eye Diagram Analysis and Its Monitoring Technique for Adaptive Pre-Emphasis for Multi-valued Data Transmissions

    Publication Year: 2017, Page(s):13 - 18
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1156 KB) | HTML iconHTML

    To address the ever-increasing demand for highseed interconnectivity between VLSI systems, the emerging IEEE 802.3bs and CEI-56G standards support a maximum data rate of 400Gb/s. A significant challenge at these data rates is overcoming the bit errors caused by intersymbol interference (ISI) in bandwidth-limited legacy channels. To reduce the bandwidth limitation by half, 4-level pulse amplitude m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fine-Grain Pipelined Reconfigurable VLSI Architecture Based on Multiple-Valued Multiplexer Logic

    Publication Year: 2017, Page(s):19 - 24
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (466 KB) | HTML iconHTML

    This paper presents a novel bit-serial fine-grain pipelined reconfigurable VLSI architecture based on multiplexer logic to achieve high utilization of hardware resources and high throughput. A basic cell is constructed by a logic block composed of a 2-data-input multiplexer and a switch box for data transfer between adjacent logic blocks by 8-near neighborhood mesh network. A multiplexer merged wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novel Ternary Multiplier Based on Ternary CMOS Compact Model

    Publication Year: 2017, Page(s):25 - 30
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (589 KB) | HTML iconHTML

    Multiple-valued logic (MVL) has potential advantages for energy-efficient design by reducing a circuit complexity. Because of physical device and circuit realization issues, however, there are relatively small number of researches on MVL circuit designs. We design a novel ternary multiplier based on a ternary CMOS (T-CMOS) compact model. To estimate performance and energy efficiency of our ternary... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Phase Semantics for Multilattice Formalism

    Publication Year: 2017, Page(s):31 - 36
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (222 KB) | HTML iconHTML

    A new logic called linear multilattice logic (LMLn), which is a substructural refinement of Shramko's multilattice logic, is introduced as a Gentzen-type sequent calculus. A phase semantics for LMLn is introduced, and the completeness theorem with respect to this semantics is proved. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Median Based Calculus for Lattice Polynomials and Monotone Boolean Functions

    Publication Year: 2017, Page(s):37 - 42
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    In this document, we consider a median-based calculus for efficiently representing polynomial functions over distributive lattices. We extend an equational specification of median forms from the domain of Boolean functions to the domain of lattice polynomials. We show that it is sound and complete, and we illustrate its usefulness when simplifying median formulas algebraically. Furthermore, we pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Posets of Minors of Functions in Multiple-Valued Logic

    Publication Year: 2017, Page(s):43 - 48
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (253 KB) | HTML iconHTML

    We study the structure of the partially ordered set of minors of an arbitrary function of several variables. We give an abstract characterization of such "minor posets" in terms of colorings of partition lattices, and we also present infinite families of examples as well as constructions that can be used to build new minor posets. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending Ideal Paraconsistent Four-Valued Logic

    Publication Year: 2017, Page(s):49 - 54
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (199 KB) | HTML iconHTML

    We introduce a Gentzen-type sequent calculus PL for a modified extension of Arieli, Avron and Zamansky's ideal paraconsistent four-valued logic 4CC. The calculus PL, which is also regarded as a paradefinite four-valued logic, is formalized based on the idea of connexive logic. Theorems for syntactically and semantically embedding PL into a Gentzen-type sequent calculus LK for classical logic and v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Fixed Points of the Reed-Muller-Fourier Transform

    Publication Year: 2017, Page(s):55 - 60
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB) | HTML iconHTML

    The Reed-Muller-Fourier transform combines relevant aspects of the RM transform and the DFT. It constitutes a bijection in the set of p-valued functions. Some properties of the transform matrix are formally analyzed and its eigenvectors with eigenvalue λ = 1, which are its fixed points, are studied. Some methods to generate fixed points from known fixed points are presented and the number of fixed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Spectral Invariant Operations for Multiple-Valued Functions with Homogeneous Disjoint Products in the Polynomial Form

    Publication Year: 2017, Page(s):61 - 66
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB) | HTML iconHTML

    It has long been known that some transformations of the Boolean functions affect only the permutation of some subset of coefficients in the Walsh-Hadamard spectrum or just change the sign of some coefficients. These operations are known as spectral invariant operations. It exists a generalization of these invariant operations for multi-valued functions and Vilenkin-Chrestenson spectrum. Here some ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Properties of the Two-Sided RMF Spectrum of Matrices

    Publication Year: 2017, Page(s):67 - 72
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (205 KB) | HTML iconHTML

    The Reed-Muller-Fourier transform, defined in a q-valued domain, is applied to obtain two-sided spectra of classes of matrices, which may be interpreted as representing pixels of pictures or patterns. Operations on matrices, representing operations on pictures are considered, and their effect in the spectral domain is analyzed. It is shown that the transform is very effective to calculate the spec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards the Gibbs Characterization of a Class of Quaternary Bent Functions

    Publication Year: 2017, Page(s):73 - 78
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (207 KB) | HTML iconHTML

    Bent functions generalized to the alphabet Zq, the ring of integers modulo q, are interesting not just in the realm of multiple-valued functions, but have some applications in the binary environment. The case q = 4, i.e., quaternary bent functions, are of a particular interest due to a simple relationship to binary functions. We consider the possibilities for characterization of quatern... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ivan Stojmenović — A Life Well-Spent in the Service of Science

    Publication Year: 2017, Page(s):79 - 81
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (181 KB) | HTML iconHTML

    This is a brief reflexion on the life and personality of abeloved colleague, Professor Ivan Stojmenović, who left usin 2014. His achievements, his students, and the scientificand personal relationships he built will impact our community for a long time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Nonexistence of Minimal Strong Partial Clones

    Publication Year: 2017, Page(s):82 - 87
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB) | HTML iconHTML

    Let k be a k-element set. We show that the lattice of all strong partial clones on k has no minimal elements. Moreover, we show that if C is a strong partial clone, then the family of all partial subclones of C is of continuum cardinality. We also show that in almost all cases, every strong partial clone contains a family of continuum cardinality of strong partial subclones. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Interval of Boolean Strong Partial Clones Containing Only Projections as Total Operations

    Publication Year: 2017, Page(s):88 - 93
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (233 KB) | HTML iconHTML

    A strong partial clone is a set of partial operations closed under composition and containing all partial projections. Let X be the set of all Boolean strong partial clones whose total operations are the projections. This set is of practical interest since it induces a partial order on the complexity of NP-complete constraint satisfaction problems. In this paper we study X from the algebraic point... View full abstract»

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