By Topic

On a constant-time, low-complexity winner-take-all neural network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yuen-Hsien Tseng ; Republic of China Army Gen. Headquarters, Taoyun, Taiwan ; Ja-Ling Wu

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(2s/(2s-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

Published in:

Computers, IEEE Transactions on  (Volume:44 ,  Issue: 4 )