N-bit Parity Neural Networks with minimum number of threshold neurons
In this paper ordered neural networks for the Nbit parity function containing [log2(N + 1)] threshold elements are constructed. The minimality of this network is proved. The connection between minimum perceptrons of Gamb for the N-bit parity function and one combinatorial problems is established.
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2016-11-01
|
| Series: | Open Engineering |
| Subjects: | |
| Online Access: | http://www.degruyter.com/view/j/eng.2016.6.issue-1/eng-2016-0037/eng-2016-0037.xml?format=INT |