Solving the N-bit parity problem using neural networks

✍ Scribed by Myron E Hohil; Derong Liu; Stanley H Smith

• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 48 KB
• Volume: 12
• Category: Article
• ISSN: 0893-6080
• DOI: 10.1016/s0893-6080(99)00069-6

✦ Synopsis

In this letter, a constructive solution to the N-bit parity problem is provided with a neural network that allows direct connections between the input layer and the output layer. The present approach requires no training and adaptation, and thus it warrants the use of the simple threshold activation function for the output and hidden layer neurons. It is previously shown that this choice of activation function and network structure leads to several solutions for the 3-bit parity problem obtained using linear programming. One of the solutions for the 3-bit parity problem is then generalized to obtain a solution for the N-bit parity problem using left floor N/2 right floor hidden layer neurons. It is shown that through the choice of a "staircase" type activation function, the left floor N/2 right floor hidden layer neurons can be further combined into a single hidden layer neuron.