{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T03:48:55Z","timestamp":1775274535246,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030042387","type":"print"},{"value":"9783030042394","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04239-4_60","type":"book-chapter","created":{"date-parts":[[2018,11,17]],"date-time":"2018-11-17T01:55:08Z","timestamp":1542419708000},"page":"666-675","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Analog Circuit Design for k-Winners-Take-All Operations"],"prefix":"10.1007","author":[{"given":"Xiaoyang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,18]]},"reference":[{"key":"60_CR1","doi-asserted-by":"crossref","unstructured":"Ferreira, L., Kaszkurewicz, E., Bhaya, A.: Synthesis of a k-winners-take-all neural network using linear programming with bounded variables. In: Proceedings of the International Joint Conference on Neural Networks, vol. 3, pp. 2360\u20132365. IEEE (2003)","DOI":"10.1109\/IJCNN.2003.1223781"},{"issue":"3","key":"60_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/B:ALOG.0000029661.59987.3c","volume":"39","author":"A Fish","year":"2004","unstructured":"Fish, A., Akselrod, D., Yadid-Pecht, O.: High precision image centroid computation via an adaptive k-winner-take-all circuit in conjunction with a dynamic element matching algorithm for star tracking applications. Analog Integr. Circ. Sig. Process 39(3), 251\u2013266 (2004)","journal-title":"Analog Integr. Circ. Sig. Process"},{"issue":"6","key":"60_CR3","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1109\/72.641477","volume":"8","author":"TC Hsu","year":"1997","unstructured":"Hsu, T.C., Wang, S.D.: k-winners-take-all neural net with $$\\rm {\\Theta (1)}$$ time complexity. IEEE Trans. Neural Networks 8(6), 1557\u20131561 (1997)","journal-title":"IEEE Trans. Neural Networks"},{"issue":"12","key":"60_CR4","doi-asserted-by":"publisher","first-page":"2022","DOI":"10.1109\/TNN.2008.2003287","volume":"19","author":"X Hu","year":"2008","unstructured":"Hu, X., Wang, J.: An improved dual neural network for solving a class of quadratic programming problems and its $$k$$-winners-take-all application. IEEE Trans. Neural Networks 19(12), 2022\u20132031 (2008)","journal-title":"IEEE Trans. Neural Networks"},{"key":"60_CR5","volume-title":"Introduction to the Theory of Neural Computation","author":"A Krogh","year":"1991","unstructured":"Krogh, A., Hertz, J., Palmer, R.G.: Introduction to the Theory of Neural Computation. Addison-Wesley, Reedwood City CA (1991)"},{"issue":"4","key":"60_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF00983559","volume":"6","author":"TM Kwon","year":"1995","unstructured":"Kwon, T.M., Zervakis, M.: KWTA networks and their applications. Multidimension. Syst. Signal Process. 6(4), 333\u2013346 (1995)","journal-title":"Multidimension. Syst. Signal Process."},{"key":"60_CR7","doi-asserted-by":"crossref","unstructured":"Lazzaro, J., Ryckebusch, S., Mahowald, M.A., Mead, C.A.: Winner-take-all networks of O(n) complexity. In: Advances in Neural Information Processing Systems, pp. 703\u2013711 (1989)","DOI":"10.21236\/ADA451466"},{"issue":"2\u20133","key":"60_CR8","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.neunet.2007.12.044","volume":"21","author":"Q Liu","year":"2008","unstructured":"Liu, Q., Wang, J.: Two k-winners-take-all networks with discontinuous activation functions. Neural Networks 21(2\u20133), 406\u2013413 (2008)","journal-title":"Neural Networks"},{"issue":"6","key":"60_CR9","doi-asserted-by":"publisher","first-page":"1500","DOI":"10.1109\/TNN.2006.881046","volume":"17","author":"S Liu","year":"2006","unstructured":"Liu, S., Wang, J.: A simplified dual neural network for quadratic programming with its kwta application. IEEE Trans. Neural Networks 17(6), 1500\u20131510 (2006)","journal-title":"IEEE Trans. Neural Networks"},{"key":"60_CR10","unstructured":"Maass, W.: Neural computation with winner-take-all as the only nonlinear operation. In: Advances in Neural Information Processing Systems, pp. 293\u2013299 (2000)"},{"key":"60_CR11","unstructured":"Majani, E., Erlanson, R., Abu-Mostafa, Y.S.: On the k-winners-take-all network. In: Advances in Neural Information Processing Systems, pp. 634\u2013642 (1989)"},{"issue":"1","key":"60_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1109\/82.659465","volume":"45","author":"IE Opris","year":"1998","unstructured":"Opris, I.E.: Rail-to-rail multiple-input min\/max circuit. IEEE Trans. Circuits Syst. II: Analog Digital Sig. Process. 45(1), 137\u2013140 (1998)","journal-title":"IEEE Trans. Circuits Syst. II: Analog Digital Sig. Process."},{"key":"60_CR13","unstructured":"Ou, S.H., Lin, C.S., Liu, B.D.: A scalable sorting architecture based on maskable WTA\/MAX circuit. In: IEEE International Symposium on Circuits and Systems, ISCAS 2002, vol. 4, p. IV. IEEE (2002)"},{"issue":"1\u20132","key":"60_CR14","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1008204616413","volume":"13","author":"PO Pouliquen","year":"1997","unstructured":"Pouliquen, P.O., Andreou, A.G., Strohbehn, K.: Winner-takes-all associative memory: a hamming distance vector quantizer. Analog Integr. Circ. Sig. Process 13(1\u20132), 211\u2013222 (1997)","journal-title":"Analog Integr. Circ. Sig. Process"},{"issue":"1","key":"60_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/82.749038","volume":"46","author":"B Sekerkiran","year":"1999","unstructured":"Sekerkiran, B., Cilingiroglu, U.: A CMOS k-winners-take-all circuit with O(N) complexity. IEEE Trans. Circuits Syst. II: Analog Digital Sig. Process. 46(1), 1\u20135 (1999)","journal-title":"IEEE Trans. Circuits Syst. II: Analog Digital Sig. Process."},{"key":"60_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-1-4419-8710-5_4","volume-title":"Adaptive Resonance Theory Microchips","author":"Teresa Serrano-Gotarredona","year":"1998","unstructured":"Serrano-Gotarredona, T., Linares-Barranco, B., Andreou, A.G.: A high-precision current-mode WTA-MAX circuit with multi-chip capability. In: Adaptive Resonance Theory Microchips, pp. 89\u2013115. Springer, Boston (1998). https:\/\/doi.org\/10.1007\/978-1-4419-8710-5_4"},{"issue":"1","key":"60_CR17","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/72.737494","volume":"10","author":"JPF Sum","year":"1999","unstructured":"Sum, J.P.F., Leung, C.S., Tam, P.K.S., Young, G.H., Kan, W.K., Chan, L.W.: Analysis for a class of winner-take-all model. IEEE Trans. Neural Networks 10(1), 64\u201371 (1999)","journal-title":"IEEE Trans. Neural Networks"},{"key":"60_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-642-24965-5_29","volume-title":"Neural Information Processing","author":"JP-F Sum","year":"2011","unstructured":"Sum, J.P.-F., Leung, C.-S., Ho, K.: Analysis on Wang\u2019s kWTA with stochastic output nodes. In: Lu, B.-L., Zhang, L., Kwok, J. (eds.) ICONIP 2011. LNCS, vol. 7064, pp. 268\u2013275. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24965-5_29"},{"issue":"3","key":"60_CR19","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1109\/72.377986","volume":"6","author":"K Urahama","year":"1995","unstructured":"Urahama, K., Nagao, T.: K-winners-take-all circuit with O(N) complexity. IEEE Trans. Neural Networks 6(3), 776\u2013778 (1995)","journal-title":"IEEE Trans. Neural Networks"},{"issue":"3","key":"60_CR20","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1080\/00207219408926068","volume":"77","author":"J Wang","year":"1994","unstructured":"Wang, J.: Analogue winner-take-all neural networks for determining maximum and minimum signals. Int. J. Electron. 77(3), 355\u2013367 (1994)","journal-title":"Int. J. Electron."},{"issue":"9","key":"60_CR21","doi-asserted-by":"publisher","first-page":"1496","DOI":"10.1109\/TNN.2010.2052631","volume":"21","author":"J Wang","year":"2010","unstructured":"Wang, J.: Analysis and design of a k-winners-take-all model with a single state variable and the heaviside step activation function. IEEE Trans. Neural Networks 21(9), 1496\u20131506 (2010)","journal-title":"IEEE Trans. Neural Networks"},{"issue":"2","key":"60_CR22","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1109\/72.80342","volume":"2","author":"WJ Wolfe","year":"1991","unstructured":"Wolfe, W.J., Mathis, D., Anderson, C., Rothman, J., Gottler, M., Brady, G., Walker, R., Duane, G., Alaghband, G.: K-winner networks. IEEE Trans. Neural Networks 2(2), 310\u2013315 (1991)","journal-title":"IEEE Trans. Neural Networks"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04239-4_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T02:55:55Z","timestamp":1775271355000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04239-4_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030042387","9783030042394"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04239-4_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"18 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Siem Reap","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambodia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/iconip\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"575","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"401","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}