Efficient Decomposition of Comparison and Its Applications

Valeriu Beiu; Jan Peperstraete; Joos Vandewalle; Rudy Lauwereins

Efficient Decomposition of Comparison and Its Applications

Valeriu Beiu, Jan Peperstraete, Joos Vandewalle, Rudy Lauwereins

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

The paper deals with transformation algorithms for decomposing Boolean neural networks (NNs); this being done with a view to possible VLSI implementation of NNs using threshold gates (TGs). We detail a possible tree decomposition for COMPARISON, and show how this can be used for the decomposition of Boolean functions (BFs) belonging to FN,m – the class of BFs of N variables that have exactly m groups of ones. Complexity estimates are given, the results being: (i) linear size; (ii) logarithmic depth; (iii) constant weights; and (iv) constant threshold.

Original language	English
Title of host publication	European Symposium on Artificial Neural Networks
Publication status	Published - Apr 7 1993
Event	ESANN'93 - Brussels, Belgium Duration: Apr 7 1993 → …

Conference

Conference	ESANN'93
Period	4/7/93 → …

Access to Document

https://www.elen.ucl.ac.be/Proceedings/esann/esannpdf/es1993-507-S.pdf

Cite this

@inproceedings{cd92797f65f745bb9900ad3f34222619,

title = "Efficient Decomposition of Comparison and Its Applications",

abstract = "The paper deals with transformation algorithms for decomposing Boolean neural networks (NNs); this being done with a view to possible VLSI implementation of NNs using threshold gates (TGs). We detail a possible tree decomposition for COMPARISON, and show how this can be used for the decomposition of Boolean functions (BFs) belonging to FN,m – the class of BFs of N variables that have exactly m groups of ones. Complexity estimates are given, the results being: (i) linear size; (ii) logarithmic depth; (iii) constant weights; and (iv) constant threshold.",

author = "Valeriu Beiu and Jan Peperstraete and Joos Vandewalle and Rudy Lauwereins",

year = "1993",

month = apr,

day = "7",

language = "English",

booktitle = "European Symposium on Artificial Neural Networks",

note = "ESANN'93 ; Conference date: 07-04-1993",

}

TY - GEN

T1 - Efficient Decomposition of Comparison and Its Applications

AU - Beiu, Valeriu

AU - Peperstraete, Jan

AU - Vandewalle, Joos

AU - Lauwereins, Rudy

PY - 1993/4/7

Y1 - 1993/4/7

N2 - The paper deals with transformation algorithms for decomposing Boolean neural networks (NNs); this being done with a view to possible VLSI implementation of NNs using threshold gates (TGs). We detail a possible tree decomposition for COMPARISON, and show how this can be used for the decomposition of Boolean functions (BFs) belonging to FN,m – the class of BFs of N variables that have exactly m groups of ones. Complexity estimates are given, the results being: (i) linear size; (ii) logarithmic depth; (iii) constant weights; and (iv) constant threshold.

AB - The paper deals with transformation algorithms for decomposing Boolean neural networks (NNs); this being done with a view to possible VLSI implementation of NNs using threshold gates (TGs). We detail a possible tree decomposition for COMPARISON, and show how this can be used for the decomposition of Boolean functions (BFs) belonging to FN,m – the class of BFs of N variables that have exactly m groups of ones. Complexity estimates are given, the results being: (i) linear size; (ii) logarithmic depth; (iii) constant weights; and (iv) constant threshold.

M3 - Conference contribution

BT - European Symposium on Artificial Neural Networks

T2 - ESANN'93

Y2 - 7 April 1993

ER -

Efficient Decomposition of Comparison and Its Applications

Abstract

Conference

Access to Document

Fingerprint

Cite this