VLSI complexity of threshold gate COMPARISON

Beiu Valeriu

Research output: Contribution to conferencePaperpeer-review


The paper overviews recent developments concerning optimal (from the point of view of size and depth) implementations of COMPARISON using threshold gates. We detail a class of solutions which covers another particular solution, and spans from constant to logarithmic depths. These circuit complexity results are supplemented by fresh VLSI complexity ones having applications to hardware implementations of neural networks and to VLSI-friendly learning algorithms. In order to estimate the area (A) and the delay (T), as well as the classical AT2, we use the following 'cost functions': (i) the connectivity (i.e., sum of fan-ins) and the number-of-bits for representing the weights and thresholds are used to approximate the area; while (ii) the fan-ins and the length of the wires are used for closer estimates of the delay. Such approximations allow us to compare the different solutions-which present very interesting fan-in dependent depth-size and area-delay tradeoffs-with respect to AT2.

Original languageEnglish
Number of pages10
Publication statusPublished - 1996
Externally publishedYes
EventProceedings of the 1996 1st International Symposium on Neuro-Fuzzy Systems, AT'96 - Lausanne, Switz
Duration: Aug 29 1996Aug 31 1996


OtherProceedings of the 1996 1st International Symposium on Neuro-Fuzzy Systems, AT'96
CityLausanne, Switz

ASJC Scopus subject areas

  • General Computer Science


Dive into the research topics of 'VLSI complexity of threshold gate COMPARISON'. Together they form a unique fingerprint.

Cite this