DocumentCode :
957927
Title :
A Partitioning Method for Combinational Synthesis
Author :
Smith, David R.
Author_Institution :
Dept. of Electrical Sciences, State university of New York, Stony Brook, N. Y. 11790
Issue :
1
fYear :
1968
Firstpage :
72
Lastpage :
75
Abstract :
A method of network synthesis for general combinational functions that uses a number of fixed threshold logic units not greatly in excess of the theoretical minimum is described. It can be used with adaptive logic in which case a minority of the interconnections are simply adapted once according to the rule originally suggested by Hebb. This network on its own has no capacity for ``generalization,´´ and if used for pattern recognition must therefore be operated in conjunction with a suitable property filter, such as that of the previous paper.[1] In this case the present network could perform as a trainable ``categorizer.´´
Keywords :
Delay; Filters; Logic; Network synthesis; Pattern recognition; Shape; Upper bound;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1968.5008873
Filename :
5008873
Link To Document :
بازگشت