K-Winners-Take-All Circuit with O(N) Complexity

K. Urahama, T. Nagao

Research output: Contribution to journalArticlepeer-review

76 Citations (Scopus)


In this letter we present a k-winners-take-all circuit that is an extension of the winner-take-ail circuit by Lazzaro et al. [4], The problem of selecting the largest k numbers is formulated as a mathematical programming whose solution scheme, based on the Lagrange multiplier method, is directly implemented on an analog circuit. The wire length in this circuit grows only linearly with the number of elements, and the circuit is more suitable for real-time processing than the Hopfield networks because the present circuit produces the solution almost instantaneously—in contrast to the Hopfield network, which requires transient convergence to the solution from a precise initial state. The selection resolution in the present circuit is, however, only finite in contrast to the almost infinite resolution in the Hopfield networks.

Original languageEnglish
Pages (from-to)776-778
Number of pages3
JournalIEEE Transactions on Neural Networks
Issue number3
Publication statusPublished - May 1995
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Artificial Intelligence


Dive into the research topics of 'K-Winners-Take-All Circuit with O(N) Complexity'. Together they form a unique fingerprint.

Cite this