Winner-take-all networks of O(n) complexity (1989)
| Venue: | Advances in Neural Information Processing Systems |
| Citations: | 72 - 0 self |
BibTeX
@INPROCEEDINGS{Lazzaro89winner-take-allnetworks,
author = {J. Lazzaro and S. Ryckebusch and M. A. Mahowald and C. A. Mead},
title = {Winner-take-all networks of O(n) complexity},
booktitle = {Advances in Neural Information Processing Systems},
year = {1989},
pages = {703--711},
publisher = {Morgan Kaufmann}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We have designed, fabricated, and tested a series of compact CMOS integrated circuits that realize the winner-take-all function. These analog, continuous-time circuits use only O(n) of interconnect to perform this function. We have also modified the winner-take-all circuit, realizing a circuit that computes local nonlinear inhibition. Two general types of inhibition mediate activity in neural systems: subtractive inhibition, which sets a zero level for the computation, and multiplicative (nonlinear) inhibition, which regulates the gain of the computation. We report a physical realization of general nonlinear inhibition in its extreme form, known as winner-take-all. We have designed and fabricated a series of compact, completely functional CMOS integrated circuits that realize the winner-take-all function, using the full analog nature of the medium. This circuit has been used successfully as a component in several VLSI sensory systems that perform auditory localization (Lazzaro and Mead, in press) and visual stereopsis (Mahowald and Delbruck, 1988). Winnertake-all
Citations
No citations identified.
