A CMOS K-winners-take-all circuit with O(n) complexity
Authors:
- B. SekerkiranBSB. Sekerkiran
- U. CilingirogluUCU. Cilingiroglu
- 1 January 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
- Vol. 46 (1) , 1-5
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- K-winners-take-all circuit with O(N) complexityIEEE Transactions on Neural Networks, 1995
- A charge-based neural Hamming classifierIEEE Journal of Solid-State Circuits, 1993
- K-winner networksIEEE Transactions on Neural Networks, 1991