Perceptron–perceptron net
Journal
Pattern Recognition Letters
Journal Volume
19
Journal Issue
7
Pages
559-568
Date Issued
1998
Date
1998
Author(s)
Hsu, Tsong-Chih
Abstract
It 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.
Subjects
Binary mapping; Dimension expansion; Functional link networks
Other Subjects
Boolean functions; Logic gates; Binary mapping; Functional link networks; Neural networks
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
13.pdf
Size
179.82 KB
Format
Adobe PDF
Checksum
(MD5):62b261f5c4245b85fe2660ad9fe86216