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

K. Urahama, T. Nagao

研究成果: Contribution to journalArticle

73 引用 (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.

元の言語英語
ページ(範囲)776-778
ページ数3
ジャーナルIEEE Transactions on Neural Networks
6
発行部数3
DOI
出版物ステータス出版済み - 5 1995

All Science Journal Classification (ASJC) codes

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

フィンガープリント K-Winners-Take-All Circuit with O(N) Complexity' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用