SHENG-DE WANGHsu, Tsong-ChihTsong-ChihHsu2009-03-042018-07-062009-03-042018-07-06199801678655http://ntur.lib.ntu.edu.tw//handle/246246/142268https://www.scopus.com/inward/record.uri?eid=2-s2.0-0032066454&doi=10.1016%2fS0167-8655%2898%2900045-2&partnerID=40&md5=c7139d8bfa0adc64989f1d35e2ff0a18It is well known that if a Boolean function is expressed in sum of products, each function can be implemented with one level of AND gates followed by an OR gate. We will prove that if each desired output of a binary function is expressed in sum of products, each desired output can be implemented with one layer of perceptron nodes followed by a perceptron node. © 1998 Elsevier Science B.V. All rights reserved.application/pdf184135 bytesapplication/pdfen-USBinary mapping; Dimension expansion; Functional link networksBoolean functions; Logic gates; Binary mapping; Functional link networks; Neural networksjournal article10.1016/S0167-8655(98)00045-22-s2.0-0032066454http://ntur.lib.ntu.edu.tw/bitstream/246246/142268/1/13.pdf