抄録
It is known that N-bit parity problem can be solved by a 3-layer sigmoidal neural network employing N/2+1 hidden units if N is even and (N+1)/2 hidden units if N is odd. In this paper, a kind of multiplication unit was proposed. It is shown that networks constructed with one multiplication hidden unit can solve the N-bit parity problem easily.