A Caltech Library Service

Winner-Take-All Networks of O(N) Complexity

Lazzaro, J. and Ryckebusch, S. and Mahowald, M. A. and Mead, C. A. (1989) Winner-Take-All Networks of O(N) Complexity. In: Advances in Neural Information Processing Systems. Vol.1. Morgan Kaufmann Publishers , San Mateo, CA, pp. 703-711. ISBN 1558600159.

PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 1989 Morgan Kaufmann. John Platt, John Wyatt, David Feinstein, Mark Bell, and Dave Gillespie provided mathematical insights in the analysis of the circuit. Lyn Dupre proofread the document. We thank Hewlett-Packard for computing support, and DARPA and MOSIS for chip fabrication. This work was sponsored by the Office of Naval Research and the System Development Foundation.
Funding AgencyGrant Number
Defense Advanced Research Projects Agency (DARPA)UNSPECIFIED
Office of Naval Research (ONR)UNSPECIFIED
System Development FoundationUNSPECIFIED
Record Number:CaltechAUTHORS:20141212-145244773
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:52787
Deposited On:18 Dec 2014 00:44
Last Modified:03 Oct 2019 07:44

Repository Staff Only: item control page