A new k-winners-take-all neural network

In this paper, the k-winners-take-all (KWTA) operation is converted to an equivalent constrained convex quadratic optimization formulation. A simplified dual neural network, called KWTA network, is further developed for solving the convex quadratic programming (QP) problem. The KWTA network is shown to be globally convergent to the exact optimal solution of the QP problem. Simulation results are presented to show the effectiveness and performance of the KWTA network.