Winner-take-all cellular neural networks

An implementation of winner-take-all behavior in inputless cellular neural networks (CNNs) is presented which is defined as follows: the eventual output of the cell with the largest initial state is +1, while that of all other cells is -1. Although this basically requires a fully interconnected network, a simplified structure with only linear architectural complexity exist. Exact parameters are derived for winner-take-all CNNs with an arbitrary number of cells, such that their robustness with respect to the simplified structure is maximum. A proof of functionality is given which encompasses both the nominal and the distributed networks. It is found that accuracy requirements increase with the number of cells, such that the largest winner-take-all CNNs that can be reliably implemented with current methods may consist of only about ten cells. Also presented is a thorough example of how to apply a robust design method to the exact determination of optimal CNN parameters and network robustness