The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Winner-Take-All Networks of O(N) Complexity
Abstract
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). Winner-take-all circuits with over 170 inputs function correctly in these sensory systems. We have also modified this global winner-take-all circuit, realizing a circuit that computes local nonlinear inhibition. The circuit allows multiple winners in the network, and is well suited for use in systems that represent a feature space topographically and that process several features in parallel. We have designed, fabricated, and tested a CMOS integrated circuit that computes locally the winner-take-all function of spatially ordered input.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Some studies proposed to implement the argmax() function via hardware128–148, which could be beneficial to reduce the total transistor count and power consumption while at the same time increasing the throughput.”
From Hardware implementation of memristor-based artificial neural networks (2024) · cites this paper as [132]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Analog VLSI and Neural Systems
Mead, C. (1989) · CaltechAUTHORS (California Institute of Technology) · Cited by 2,776
Self-citationA Silicon Model Of Auditory Localization
Lazzaro, J., & Mead, C. (1989) · Neural Computation · doi:10.1162/neco.1989.1.1.47 · Cited by 121
Self-citationAn analog VLSI implementation of the marr-poggio stereo correspondence algorithm
Mahowald, M. A., & Delbrück, T. (1988) · Neural Networks · doi:10.1016/0893-6080(88)90418-2 · Cited by 13
Self-citation
Research works printed but not linked: 1
- Mead, C. A. (in press). AnalogVLSI and Neural Systems. Reading, MA: AddisonWesley.
Cited by
Neuromorphic Electronic Circuits for Building Autonomous Cognitive Systems
Chicca, E., Stefanini, F., Bartolozzi, C., & Indiveri, G. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2313954 · Cited by 552
Hardware implementation of memristor-based artificial neural networks
Aguirre, F., Sebastian, A., Le Gallo, M., Song, W., Wang, T., Yang, J. J., Lu, W., Chang, M.-F., Ielmini, D., Yang, Y., et al. (2024) · Nature Communications · doi:10.1038/s41467-024-45670-9 · Cited by 564
Finding a roadmap to achieve large neuromorphic hardware systems
Hasler, J., & Marr, B. (2013) · Frontiers in Neuroscience · doi:10.3389/fnins.2013.00118 · Cited by 392
Competitive learning with floating-gate circuits
Hsu, D., Figueroa, M., & Diorio, C. (2002) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2002.1000139 · Cited by 379
On the Computational Power of Winner-Take-All
Maass, W. (2000) · Neural Computation · doi:10.1162/089976600300014827 · Cited by 355
Metadata
- Authors
- Lazzaro, J., Ryckebusch, S., Mahowald, M. A., & Mead, C. A.
- Affiliations
- California Institute of Technology (US)
- Publisher
- Defense Technical Information Center
- Published
- 1988-01-01
- OpenAlex
- W2139016795
- Cited by
- 582
- References
- 3
- Citations by year
- 2026: 10 · 2025: 24 · 2024: 16 · 2023: 24 · 2022: 24 · 2021: 6 · 2020: 8 · 2019: 13 · 2018: 13 · 2017: 11 · 2016: 18 · 2015: 14 · 2014: 18 · 2013: 21 · 2012: 4
- Type
- report
- Language
- en
- Open access
- closed
- Locations
- CaltechAUTHORS (California Institute of Technology) (submittedVersion)
- Defense Technical Information Center (DTIC) (submittedVersion)
- Funders
- Defense Advanced Research Projects Agency
- Office of Naval Research
- Topics
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Analog and Mixed-Signal Circuit Design
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Memory and Neural Computing
- Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
- Keywords
- winner-take-all circuit, CMOS integrated circuit, analog neural circuits, sound localization, feature space representation, linear time complexity
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Winner-Take-All Networks of O(N) Complexity. https://app.cochat.ai/papers/10.21236/ada451466
- The paper
- Lazzaro, J., Ryckebusch, S., Mahowald, M. A., & Mead, C. A. (1988). Winner-Take-All Networks of O(N) Complexity. https://doi.org/10.21236/ada451466
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.