A CMOS K-winners-take-all circuit with O(n) complexity
B. Sekerkiran, Uğur Çilingiroğlu · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · 1999
Design and implementation of a CMOS K-winners-take-all circuit are presented. The proposed architecture is of O(n) complexity and enables the number of winners to be determined before each competition phase by adjusting the current ratio of two current sources. A 10-cell test chip has been designed and fabricated in a 3 /spl mu/m CMOS process. Functionality has been verified by testing. The simple structure of the circuit is highly suitable for analog VLSI implementations.