A winner-take-all spiking network with spiking inputs
暂无分享,去创建一个
Recurrent networks that perform a winner-take-all computation have been studied extensively. Although some of these studies include spiking networks, they consider only analog inputs. We present results from an analog VLSI implementation of a winner-take-all network that receives spike trains as input. We show how we can configure the connectivity in the network so that the winner is selected after a predetermined number of input spikes. To reduce the effect of transistor mismatch on the network operation, we use bursts of input spikes to compensate for this mismatch. The chip with a network of 64 integrate-and-fire neurons can reliably detect the winning neuron, that is, the neuron that receives spikes with the shortest inter-spike interval.
[1] Tobi Delbrück,et al. Orientation-Selective aVLSI Spiking Neurons , 2001, NIPS.
[2] John Lazzaro,et al. Winner-Take-All Networks of O(N) Complexity , 1988, NIPS.
[3] Kwabena Boahen,et al. Point-to-point connectivity between neuromorphic chips using address events , 2000 .
[4] Dezhe Z Jin,et al. Fast computation with spikes in a recurrent neural network. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.