From a new way to show the universality of a two-layer perceptron to a new approach to digital design

作者: José Barahona da Fonseca

DOI:

关键词:

摘要: We show in a constructive way the universality of two layer perceptron. how to build any minterm logical function with one perceptron and OR all minterms another This it is possible implement N N+1 perceptrons. Next we addres question minimizing number perceptrons or threshold elements given function. Here have answer open questions that not yet answered literature:1) Is linearly separable? 2) If nonseparable minimize function? know separable can be implemented by trained Rosenblatt's Perceptron Learning Rule [1]-[2] guarantees convergence case existence solution. propose as test non-separable did converge after very great epochs iterations. As method minimization trial error procedure generates manners mnimum elements, if for them learning rule associations then must increment generate again implementation till got Finally present some examples functions minimum elements.

参考文章(24)
Yuen-Hsien Tseng, Ja-Ling Wu, An optimal dimension expansion procedure for obtaining linearly separable subsets international joint conference on neural network. pp. 2461- 2465 ,(1991) , 10.1109/IJCNN.1991.170758
M. Padure, S. Cotofana, S. Vassiliadis, High-speed hybrid threshold-Boolean logic counters and compressors The 2002 45th Midwest Symposium on Circuits and Systems, 2002. MWSCAS-2002.. ,vol. 3, ,(2002) , 10.1109/MWSCAS.2002.1187072
C.H. Chu, J.H. Kim, I. Kim, Applications of binary neural networks learning to pattern classification world congress on computational intelligence. ,vol. 2, pp. 907- 911 ,(1994) , 10.1109/ICNN.1994.374301
Sang-Kyu Sung, Jong-Won Jung, Joon-Tark Lee, Woo-Jin Choi, Seok-Jun Ji, Optimal Synthesis Method for Binary Neural Network Using NETLA soft computing. pp. 236- 244 ,(2002) , 10.1007/3-540-45631-7_32
Valeriu' Beiu, None, VLSI complexity of threshold gate COMPARISON 1st International Symposium on Neuro-Fuzzy Systems, AT '96. Conference Report. pp. 161- 170 ,(1996) , 10.1109/ISNFS.1996.603834
R. Dogaru, M. Alangiu, M. Rychetsky, M. Glesner, Perceptrons revisited: the addition of a non-monotone recursion greatly enhances their representation and classification properties international joint conference on neural network. ,vol. 2, pp. 862- 867 ,(1999) , 10.1109/IJCNN.1999.831065
E.M. Corwin, A.M. Logar, W.J.B. Oldham, An iterative method for training multilayer networks with threshold functions IEEE Transactions on Neural Networks. ,vol. 5, pp. 507- 508 ,(1994) , 10.1109/72.286926
M. Tajine, D. Elizondo, New methods for testing linear separability Neurocomputing. ,vol. 47, pp. 161- 188 ,(2002) , 10.1016/S0925-2312(01)00587-2
Di Wang, Narendra S. Chaudhari, An approach for construction of Boolean neural networks based on geometrical expansion Neurocomputing. ,vol. 57, pp. 455- 461 ,(2004) , 10.1016/J.NEUCOM.2003.11.004