Skip to main content
Conference Proceedings

An Analog Circuit Design for k-Winners-Take-All Operations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2018) 11307 LNCS 666-675
DOI: 10.1007/978-3-030-04239-4_60
4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper designs an analog circuit for k-winners-take-all (kWTA) operations. The circuit is stable and finite-time convergent. The stable state of the circuit is equivalent to the optimal solution of the kWTA. Simulation results via SPICE substantiate the efficiency of the design.

Author supplied keywords

Cite

CITATION STYLE

APA

Liu, X., & Wang, J. (2018). An Analog Circuit Design for k-Winners-Take-All Operations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11307 LNCS, pp. 666–675). Springer Verlag. https://doi.org/10.1007/978-3-030-04239-4_60

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free