On a constant-time, low-complexity winner-take-all neural network
Yuen‐Hsien Tseng, Ja‐Ling Wu · IEEE Transactions on Computers · 1995
A nearly cost-optimal winner-take-all (WTA) neural network derived from a constant-time sorting network is presented. The resultant WTA network has connection complexity O(n(2/sup s(2/sup s/-1))) where s is the depth of cascaded sorting networks. Application of the WTA network to other problems such as nonbinary majority is also included.>