Efficient Decomposition of Comparison and Its Applications

Valeriu Beiu, Jan Peperstraete, Joos Vandewalle, Rudy Lauwereins

    Research output: Chapter in Book/Report/Conference proceedingConference contribution


    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 languageEnglish
    Title of host publicationEuropean Symposium on Artificial Neural Networks
    Publication statusPublished - Apr 7 1993
    EventESANN'93 - Brussels, Belgium
    Duration: Apr 7 1993 → …


    Period4/7/93 → …


    Dive into the research topics of 'Efficient Decomposition of Comparison and Its Applications'. Together they form a unique fingerprint.

    Cite this