Advertisement

Spectrally Preconditioned Threshold Logic

  • R. K. Rao Yarlagadda
  • John E. Hershey
Chapter
  • 186 Downloads
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 383)

Abstract

In a more visual sense, consider f d to be a pattern consisting of a pasting of black and white stickers on some or all of the vertices of a d-dimensional boolean hypercube. It is at this early juncture that two important questions arise. First, how can we efficiently code or store a random pattern, or how, when presented with a d-bit address of a vertex on the hypercube, can we decide, either with total certainty or within a given error tolerance, the color at the vertex without using a look up technique? Second, some patterns appear more random or complex than ethers. Can this random quality be defined and is there a metric or even a fuzzy measure for it?

Keywords

Boolean Function Discrete Fourier Transform Fuzzy Measure Bend Function Hadamard Matrix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • R. K. Rao Yarlagadda
    • 1
  • John E. Hershey
    • 2
  1. 1.Oklahoma State UniversityUSA
  2. 2.General Electric Corporate Research & Development CenterUSA

Personalised recommendations