Title :
An O(n) winner-take-all circuit using successive elimination
Author_Institution :
Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore
Abstract :
An efficient hardware solution to the winner-take-all problem which is frequently encountered in the literature of artificial neural networks is presented. The winner-take-all mechanism is an operation that identifies the identity of largest member from a set of n scalars, each taking values in the interval [0, 1]. The principle underlying the circuit is quite straightforward: from a set of n scalar inputs, those with magnitudes less than the average are eliminated iteratively until the winner emerges. Analysis proved that the circuit converges to the unique equilibrium given any input vector, is of O(n) complexity, and is robust with respect to variations in component values
Keywords :
computational complexity; neural nets; O(n) winner-take-all circuit; artificial neural networks; complexity; component values; identity; input vector; scalars; successive elimination; unique equilibrium; Artificial neural networks; Boosting; Circuit synthesis; Flip-flops; Microelectronics; Neural network hardware; Robustness; Silicon; Subspace constraints; Voltage;
Conference_Titel :
Circuits and Systems, 1991., IEEE International Sympoisum on
Print_ISBN :
0-7803-0050-5
DOI :
10.1109/ISCAS.1991.176653
