Multiple Threshold Neural Logic
Abstract
We introduce a new Boolean computing element related to the Lin(cid:173) ear Threshold element, which is the Boolean version of the neuron. Instead of the sign function, it computes an arbitrary (with poly(cid:173) nornialy many transitions) Boolean function of the weighted sum of its inputs. We call the new computing element an LT M element, which stands for Linear Threshold with Multiple transitions. The paper consists of the following main contributions related to our study of LTM circuits: (i) the creation of efficient designs of LTM circuits for the addition of a multiple number of integers and the product of two integers. In particular, we show how to compute the addition of m integers with a single layer of LT M elements. (ii) a proof that the area of the VLSI layout is reduced from O(n2 ) in LT circuits to O(n) in LTM circuits, for n inputs symmetric Boolean functions, and (iii) the characterization of the computing power of LT M relative to LT circuits.
Cite
Text
Bohossian and Bruck. "Multiple Threshold Neural Logic." Neural Information Processing Systems, 1997.Markdown
[Bohossian and Bruck. "Multiple Threshold Neural Logic." Neural Information Processing Systems, 1997.](https://mlanthology.org/neurips/1997/bohossian1997neurips-multiple/)BibTeX
@inproceedings{bohossian1997neurips-multiple,
title = {{Multiple Threshold Neural Logic}},
author = {Bohossian, Vasken and Bruck, Jehoshua},
booktitle = {Neural Information Processing Systems},
year = {1997},
pages = {252-258},
url = {https://mlanthology.org/neurips/1997/bohossian1997neurips-multiple/}
}