In this paper, a dynamic k-winners-take-all (KWTA) neural network, which can quickly identify the K-winning neurons whose activations are larger than the remaining ones, is proposed and analyzed. For N competitors, the proposed KWTA network is composed of N feedforward hardlimit neurons and three feedback neurons, which are used to determine the dynamic threshold. From theoretical analysis and simulation results, we found that the convergence of the proposed KWTA network, which requires Log2 (N + 1) iterations in average to complete a KWTA process, is independent of K, the number of the desired winners, and faster than that of the existing KWTA networks.
|頁（從 - 到）||523-526|
|期刊||IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics|
|出版狀態||Published - 1997|
All Science Journal Classification (ASJC) codes