DocumentCode :
3330830
Title :
Why VLSI implementations of associative VLCNs require connection multiplexing
Author :
Bailey, Jim ; Hammerstrom, Dan
Author_Institution :
Dept. of Comput. Sci./Eng., Oregon Graduate Center, Beaverton, OR, USA
fYear :
1988
fDate :
24-27 July 1988
Firstpage :
173
Abstract :
A discussion is presented of some of the implementation constraints imposed on VLSI architectures for emulations of very large connectionist/neural networks (VLCNs). Specifically, the authors show that multiplexing of interconnections is necessary for networks exhibiting poor locality. They show that it is more feasible to build a VLCN system with sharing or multiplexing of interconnections than to build one with dedicated wires for each connection. This is true unless the network exhibits extreme locality and all CNs are connected to others within some small-radius region. Unfortunately, association requires some global connectivity.<>
Keywords :
VLSI; computer architecture; multiplexing; neural nets; VLSI architectures; associative VLCNs; connection multiplexing; global connectivity; locality; very large connectionist/neural networks; Computer architecture; Multiplexing; Neural networks; Very-large-scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 1988., IEEE International Conference on
Conference_Location :
San Diego, CA, USA
Type :
conf
DOI :
10.1109/ICNN.1988.23926
Filename :
23926
Link To Document :
بازگشت